A heuristic for the container loading problem: A tertiary-tree-based dynamic space decomposition approach

作     者：Wang, Zhoujing Li, Kevin W. Levy, Jason K. 

作者机构：Univ Windsor Odette Sch Business Windsor ON N9B 3P4 Canada Xiamen Univ Dept Automat Xiamen 361005 Fujian Peoples R China Western Washington Univ Huxley Coll Environm Bellingham WA 98225 USA 

出 版 物：《EUROPEAN JOURNAL OF OPERATIONAL RESEARCH》 (Eur J Oper Res)

年 卷 期：2008年第191卷第1期

页      面：86-99页

核心收录：

学科分类：1201[管理学-管理科学与工程(可授管理学、工学学位)] 07[理学] 070104[理学-应用数学] 0701[理学-数学] 

基　　金：Natural Sciences and Engineering Research Council of Canada  NSERC 

主　　题：heuristics container loading problem dynamic space decomposition holistic loading tertiary tree 

摘      要：Increasing fuel costs, post-911 security concerns, and economic globalization provide a strong incentive for container carriers to use available container space more efficiently, thereby minimizing the number of container trips and reducing socio-economic vulnerability. A heuristic algorithm based on a tertiary tree model is proposed to handle the container loading problem (CLP) with weakly heterogeneous boxes. A dynamic space decomposition method based on the tertiary tree structure is developed to partition the remaining container space after a block of homogeneous rectangular boxes is loaded into a container. This decomposition approach, together with an optimal-fitting sequencing and an inner-right-corner-occupying placement rule, permits a holistic loading strategy to pack a container. Comparative studies with existing algorithms and an illustrative example demonstrate the efficiency of this algorithm. (c) 2007 Elsevier B.V. All rights reserved.