A Tabu Search Based Algorithm for Cargo Loading Problem

摘要：

Given a finite set of three-dimensional boxes in different sizes and an unlimited set of containers in the same size, the cargo loading problem is to determine the minimum number of containers that can contain all the boxes. The problem is NP-hard. In this paper, we propose to use Tabu search optimization with a tree-based heuristic cargo loading algorithm as its inner heuristic to solve this problem. This approach is more flexible in taking different box conditions into consideration. Experimental results have shown that the new approach could find better solutions on average than those by other recent recta- or heuristic algorithms.

关键词： Tabu search cargo loading bin packing tree-based heuristic algorithm

作者: Li Pan Joshua Z. Huang Sydney C.K. Chu

作者单位: Department of Mathematics, University of Hong Kong, Hong Kong, China E-Business Technology Institute, University of Hong Kong, Hong Kong, China

会议类型: 国际会议

会议名称: The Seventh International Symposium(ISORA08)(第七届国际效力研究及其应用学术会议)

会议地点: 云南丽江

会议语种:英文

页码: 292-302

在线出版日期: 2008-10-31（万方平台首次上网日期，不代表论文的发表时间）