A distributed global optimization method for packing problems
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
425 | en_US |
dc.citation.issue |
4 | en_US |
dc.citation.spage |
419 | en_US |
dc.citation.volume |
54 | en_US |
dc.citation.woscount |
7 | |
dc.contributor.author |
Li, HL | en_US |
dc.contributor.author |
Tsai, JF | en_US |
dc.contributor.author |
Hu, NZ | en_US |
dc.contributor.department |
資訊管理與財務金融系 註:原資管所+財金所 | zh_TW |
dc.contributor.department |
Department of Information Management and Finance | en_US |
dc.date.accessioned |
2014-12-08T15:41:07Z | |
dc.date.available |
2014-12-08T15:41:07Z | |
dc.date.issued |
2003-04-01 | en_US |
dc.description.abstract |
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. | en_US |
dc.identifier.doi |
10.1057/palgrave.jors.2601528 | en_US |
dc.identifier.issn |
0160-5682 | en_US |
dc.identifier.journal |
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY | en_US |
dc.identifier.uri |
http://dx.doi.org/10.1057/palgrave.jors.2601528 | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/27978 | |
dc.identifier.wosnumber |
WOS:000182584700010 | |
dc.language.iso |
en_US | en_US |
dc.subject |
cutting stock problem | en_US |
dc.subject |
distributed computation | en_US |
dc.subject |
layout | en_US |
dc.subject |
optimization | en_US |
dc.title |
A distributed global optimization method for packing problems | en_US |
dc.type |
Article | en_US |
檔案
本條目沒有附加檔案。
所屬典藏: 期刊論文