A New Optimal Algorithm for Multi-Containers Packing Problem

Abstract:

Container packing has become more and more important for long-distance transportation as the development of logistics industry. A good container load plan will help to improve efficiency, reduce transportation cost and increase economic benefits. In this paper, we proposed a new optimal algorithm for multi-containers packing problem. The algorithm consists of a heuristic method which is for single-bin loading, and a genetic algorithm which is for multi-containers packing. A new placement nodes strategy was designed according to the container loading characteristics in the heuristics. Through this method, the number of placement nodes was reduced effectively. In genetic algorithm, an innovative chromosome encoding was presented, which is efficient to decrease the chromosome length. The simulation results show that the new algorithm is available and efficient. The proposed algorithm performs better in terms of space utilizations and running time.

• Periodical: Applied Mechanics and Materials (Volumes 201-202)
• Pages: 983-986
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.201-202.983
• Online since: October 2012
• Authors: Yan Lin Wang, Hong Sheng Lu, Ai Bing Yu
• Keywords: Genetic Algorithm (GA), Multi-Containers, Optimal Algorithm

References

[1] J.A. George, D.F. Robinson: Computers and Operations Research, Vol.7, (1980) No.3, pp.147-156

[2] Y.D. Cui, D.L. He, X.X. Song: Computers and Operations Research, Vol.33, (2006) No.6, pp.1505-1520

[3] A. Lim, B. Rodrigues, Y. Yang: Applied Intelligence, Vol.22, (2005) No.2, pp.125-134

[4] A. Bortfeldt, H. Gehring: Theory and Methodology, (2001) No.131, pp.143-159

[5] D.F. Zhang, Y. Peng, W.X. Zhu, et al: Chinese Journal of Computers, Vol.32, (2009) No.11, pp.2147-2156 (in Chinese)

[6] B.CH. Jiang, W.Q. Xiong: Computer Engineering and Application, Vol.43, (2007), No.26, pp.200-202 (in Chinese)