A global optimization method for packing problems

檔案

日期

2006-09-01

類型

期刊名稱

ENGINEERING OPTIMIZATION

卷期與頁次

第 38 卷第 6 期,頁 687–700

ISSN

0305-215X

語言

英文

摘要

The objective of packing problems is to determine an optimal way of placing a given set of three-dimensional (3D) rectangular cartons within a minimum volume 3D rectangular container. Current packing optimization methods either use too many extra 0-1 variables or find it difficult to obtain a globally optimal solution. This study proposes an efficient method for finding the global optimum of packing problems. First the traditional packing optimization problem is converted into an equivalent program containing many fewer 0-1 variables than contained in current methods. Then the global optimum of the converted program is found by utilizing piecewise linearization techniques. The numerical examples demonstrate that the proposed method is capable of finding the global optimum of a packing problem.

所屬典藏

期刊論文
顯示完整詮釋資料 統計資料

引用此條目

Tsai, J., & Li, H. (2006). A global optimization method for packing problems. ENGINEERING OPTIMIZATION, 38(6), 687–700. https://doi.org/10.1080/03052150600603264

BibTeX RIS

引用文字依 APA 第 7 版格式自動產生,使用前請再核對。

分享

永久網址:https://ir.lib.nycu.edu.tw/handle/11536/11890