A Quasi-Human Heuristic Algorithm for the Container Loading Problem

摘要：

This paper presents a quasi-human heuristic algorithm(QHHA)for the container loading problem with boxes of difrerent sizes and a single container for loading.The objective is to maximize the volume utilization of the container.TWO important quasi-human strategies are considered in the algorithm proposed.The first is the maximum caving degree principle,the other is the minimum edge degree principie.The performance of the alRorithm is evaluated bv LN and BR test problems.For these two test problems,the average volume utiHzation of the container achieved by the algorithm presented is 70.6％and 88.73％ within reasonable runtime. respectively. Experimental results demonstrate that the algorithm proposed is fairly efficient for solving the container loading problem.

关键词： Container loading problem Quasi-human heuristic Caving degree Edge degree Corner-occupying action

作者: Duanbing Chen Wenqi Huang

会议类型: 国际会议

会议名称: The International Conference Information Computing and Automation(2007国际信息计算与自动化会议)

会议地点: 成都

会议语种:英文

页码: 1529-1533

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