Supported by the Academician Start-Up Fund of China under Grant No.X01109 (厦门大学院士启动基金); the 985 Information Technology Fund of China under Grant No.0000-X07204 (985信息科技平台资助)
A Combinational Heuristic Algorithm for the Three-Dimensional Packing Problem
By combining the personification heuristics and simulated annealing,a combinational heuristic algorithm for the three-dimensional packing problem is presented.This personification heuristic algorithm is inspired by the strategy of building wall in the daily life.The point-finding way and the rules of horizontal and vertical reference line are developed to control the packing process.Simulated annealing algorithm is further used to improve the personification heuristics.Computational results on benchmark instances show that this algorithm can compete with excellent heuristics from the literature.