2011年11月
A tree search method for the container loading problem with shipment priority
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- ,
- ,
- 巻
- 214
- 号
- 3
- 開始ページ
- 526
- 終了ページ
- 535
- 記述言語
- 英語
- 掲載種別
- 研究論文(学術雑誌)
- DOI
- 10.1016/j.ejor.2011.04.025
- 出版者・発行元
- ELSEVIER SCIENCE BV
This paper addresses a special kind of container loading problem with shipment priority. We present a tree search method, which is based on a greedy heuristic. In the greedy heuristic, blocks made up of identical items with the same orientation are selected for packing into a container. Five evaluation functions are proposed for block selection, and the different blocks selected by each evaluation function constitute the branches of the search tree. A method of space splitting and merging is also embedded in the algorithm to facilitate efficient use of the container space. In addition, the proposed algorithm covers an important constraint called shipment priority to solve practical problems. The validity of the proposed algorithm is examined by comparing the present results with those of published algorithms using the same data. (C) 2011 Elsevier B.V. All rights reserved.
- リンク情報
- ID情報
-
- DOI : 10.1016/j.ejor.2011.04.025
- ISSN : 0377-2217
- Web of Science ID : WOS:000293485800007