Three Dimensional Offline Packing Optimization Problem Based on Genetic Simulated Annealing Algorithm

Article Preview

Abstract:

In this paper, we try to solve 3D offline packing optimization problem by combining two methods-genetic algorithm’ global performance and simulated annealing algorithm’ local performance. Given Heuristic rules in loading conditions, we use the optimal preservation strategy and the roulette wheel method to choose selection operator, integrating simulated annealing algorithm into genetic algorithm , and achieving code programming and algorithms by Matlab.This paper carries out an actual loading in a vehicle company in Changchun City, then makes a contrast between the final optimization results and each suppliers’ current packing data.The experimental results show that the algorithm has a certain validity and practicability in multiple container packing problem.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

1919-1923

Citation:

Online since:

March 2015

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2015 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] Wong T.N. ,Chan L.C. F,Lau H.C. W.Machining process sequencing with fuzzy expertsystem and genetic algorithms.Engineering Computations. 191-202(2003), p.191.

Google Scholar

[2] Yu Zhai. Study on Hybrid Genetic Algorithm for the three-dimensional packing problem. Shanghai: Shanghai Jiao Tong University(2007).

Google Scholar

[3] Bortfeldt A, M ack D. A heuristic for the three-dimensional strip packing problem[J].European Journal of Operational Research. 1267-1279 (2007), p.183(3).

DOI: 10.1016/j.ejor.2005.07.031

Google Scholar

[4] Bortfeldt A, Gehring H. A tabu search algorithm for weakly heterogeneous container loading problems. OR S pectrum. 237- 250 (1998), p.20(4).

DOI: 10.1007/s002910050071

Google Scholar

[5] Teodor Gabriel Crainic,Guido Perboli,Roberto Tadei.TS2PACK: A two-level tabu search for the three-dimensional bin packing problem. European Journal of Operational Research, 744–760 (2009), p.195.

DOI: 10.1016/j.ejor.2007.06.063

Google Scholar

[6] Kyungdaw Kang,IlkyeongMoonb,Hongfeng Wang.A hybrid genetic algorithm with a new packing strategy for the three-dimensional bin packing problem[J].Applied Mathematics and Computation, 1287–1299 (2012), p.219.

DOI: 10.1016/j.amc.2012.07.036

Google Scholar

[7] Lingzhi Cao. Study on mixed simulation annealing algorithm for the three dimensional packing problem. Guangzhou: South China University of Technology. (2013).

Google Scholar