現在位置首頁 > 期刊論文 > 詳目
  • 全文下載
主要題名:An efficient deterministic optimization approach for rectangular packing problems
作者姓名:Tsai, Jung-FaLin, Ming-HuaWang, Pei-Chun
貢獻者資料:管理學院/經營管理系
關鍵詞:rectangular packingpiecewise linearizationglobal optimization
論文中文摘要:The rectangular packing problem aims to seek the best way of placing a
given set of rectangular pieces within a large rectangle of minimal area.
Such a problem is often constructed as a quadratic mixed-integer program.
To find the global optimum of a rectangular packing problem, this study
transforms the original problem as a mixed-integer linear programming
problem by logarithmic transformations and an efficient piecewise
linearization approach that uses a number of binary variables and
constraints logarithmic in the number of piecewise line segments. The
reformulated problem can be solved to obtain an optimal solution within a
tolerable error. Numerical examples demonstrate the computational
efficiency of the proposed method in globally solving rectangular packing
problems.
出版日期:2011-12
論文ID:11117-pa-cm-2011-12_1p
典藏單位:國立臺北科技大學
數位物件檔名:11117-pa-cm-2011-12_1p.pdf
統一資源識別號:http://dx.doi.org/10.1080/02331934.2011.625029
備註:©2011 Taylor & Francis
資料開放狀態:開放
刊物名稱:Optimization
期數:62(7)
論文起迄頁碼:989-1002