標題: | A distributed global optimization method for packing problems |
作者: | Li, HL Tsai, JF Hu, NZ 資訊管理與財務金融系 註:原資管所+財金所 Department of Information Management and Finance |
關鍵字: | cutting stock problem;distributed computation;layout;optimization |
公開日期: | 1-四月-2003 |
摘要: | Packing optimization problems aim to seek the best way of placing a given set of rectangular cartons within a minimum volume rectangular container. Currently, packing optimization methods either have difficulty in finding a globally optimal solution or are computationally inefficient, because models involve too many 0-1 variables and because use of just a single computer. This study proposes a distributed computation method for solving a packing problem by a set of personal computers via the Internet. First, the traditional packing optimization model is converted into an equivalent model containing many fewer 0-1 variables. Then the model is decomposed into several sub-problems by dividing the objective value into many intervals. Each of these sub-problems is a linearized logarithmic program expressed as a linear mixed 0-1 problem. The whole problem is solvable and reaches a globally optimal solution. The numerical examples demonstrate that the proposed method can obtain the global optimum of a packing problem effectively. |
URI: | http://dx.doi.org/10.1057/palgrave.jors.2601528 http://hdl.handle.net/11536/27978 |
ISSN: | 0160-5682 |
DOI: | 10.1057/palgrave.jors.2601528 |
期刊: | JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY |
Volume: | 54 |
Issue: | 4 |
起始頁: | 419 |
結束頁: | 425 |
顯示於類別: | 期刊論文 |