Study on Container Loading Problem Based on NSGA-α Algorithm

Article Preview

Abstract:

Container loading problem with multi-constraints is usually modeled as a three-dimensional packing problem which is known to be NP-complete. This paper presents a novel approach to resolve the container loading problem via multi-objective optimization algorithm (NSGA-II). Specific encoding method and genetic operators are designed based on the mathematics description of the problem. The process also takes several practical constraints into account. Simulation results show that this approach is feasible and effective.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 753-755)

Pages:

2954-2958

Citation:

Online since:

August 2013

Authors:

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] W.M. Cheng and D.Z. Zhao: Modular Machine Tool & Automatic Manufacturing Technique, Vol. 9, (2005), p.107 (in Chinese).

Google Scholar

[2] G.N. Xu and J.S. Yu: Journal of East China University of Science and Technology (Natural Science Edition), Vol. 33(3), (2007), p.425 (in Chinese).

Google Scholar

[3] D.F. Zhang, Y. Peng, P. Yu and S.C.H. Leung: Computers & Operations Research, Vol. 39, (2012), p.2267.

Google Scholar

[4] K. Kang, I. Moon and H.F. Wang: Applied Mathematics and Computation, Vol. 219, (2012), p.1287.

Google Scholar

[5] W.B. Zhu and W.L. Huang, Andrew Lim: European Journal of Operational Research, Vol. 223, (2012), p.27.

Google Scholar

[6] K. Deb, A. Pratap, S. Agarwal, and T. Meyarivan: IEEE Transactions on Evolutionary Computation, Vol. 6(2), (2002), p.182.

Google Scholar