Solving packing problems by a distributed global optimization algorithm

Nian Ze Hu, Han-Lin Li, Jung Fa Tsai*

*Corresponding author for this work

研究成果: Article同行評審

4 引文 斯高帕斯(Scopus)

摘要

Packing optimization problems aim to seek the best way of placing a given set of rectangular boxes within a minimum volume rectangular box. Current packing optimization methods either find it difficult to obtain an optimal solution or require too many extra 0-1 variables in the solution process. This study develops a novel method to convert the nonlinear objective function in a packing program into an increasing function with single variable and two fixed parameters. The original packing program then becomes a linear program promising to obtain a global optimum. Such a linear program is decomposed into several subproblems by specifying various parameter values, which is solvable simultaneously by a distributed computation algorithm. A reference solution obtained by applying a genetic algorithm is used as an upper bound of the optimal solution, used to reduce the entire search region.

原文English
文章編號931092
期刊Mathematical Problems in Engineering
2012
DOIs
出版狀態Published - 17 八月 2012

指紋 深入研究「Solving packing problems by a distributed global optimization algorithm」主題。共同形成了獨特的指紋。

引用此