2007年11月
A TOC-based heuristic algorithm for solving a two-row pattern container loading problem
International Journal of Services Operations and Informatics
- ,
- ,
- 巻
- 2
- 号
- 4
- 開始ページ
- 339
- 終了ページ
- 356
- 記述言語
- 英語
- 掲載種別
- 研究論文(学術雑誌)
- DOI
- 10.1504/IJSOI.2007.015639
The container loading problem, a real hard problem, is usually difficult to obtain even a suboptimal solution because of not only multiple complicated restrictions but also of multiple objectives. In this paper, a heuristic algorithm is proposed for solving the two-row pattern of the container loading problem in real-world. The algorithm is based on Drum-Buffer-Rope (DBR) presented in the Theory of Constraints (TOC) and the multiagent cooperative negotiation model. A particular attention is focused on improving the constrained agent by striving for the trade-off of restrictions and cooperative negotiations, so that the final solution can arrive its biggest profit. Copyright © 2007, Inderscience Publishers.
- ID情報
-
- DOI : 10.1504/IJSOI.2007.015639
- ISSN : 1741-539X
- ISSN : 1741-5403
- SCOPUS ID : 42149139322