Study on Hybrid Genetic Simulated Annealing Algorithm for Multi-Vehicle and Multi-Cargo Loading Problem

Article Preview

Abstract:

This paper studies multi-vehicle and multi-cargo loading problem under the limited loading capacity. Hybrid genetic simulated annealing algorithm is used to get the optimization solution. Firstly, adopt hybrid coding so as to make the problem more succinctly. On the basis of cubage-weight balance algorithm, construct initial solution to improve the feasibility. Adopt the improved non-uniform mutation so as to enhance local search ability of chromosomes. Secondly, through utilizing Boltzmann mechanism of simulated annealing algorithm, control crossover and mutation operation of genetic algorithm, search efficiency so as to improve the solution quality of algorithm. Finally, the example can be shown that the above model and algorithm is effective and can provide for large-scale ideas to solve practical problems.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 171-172)

Pages:

167-170

Citation:

Online since:

December 2010

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2011 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Shachnai H, Tamir T. Polynomial time approximation schemes for class-constrained packing problems. Journal of Scheduling, Vol. 4(2001), pp.312-338.

DOI: 10.1002/jos.86

Google Scholar

[2] Bhattacharya S, Roy R. An exact depth-first algorithm for the pallet loading problem. European Journal of Operational Research, Vol. 110(1998), pp.610-625.

DOI: 10.1016/s0377-2217(97)00272-5

Google Scholar

[3] Seheithauer G, Sommerweib U. 4-Bloek heuristic for the rectangle Packing Problem. European Journal of Operational Research, Vol. 108(1998), pp.509-526.

DOI: 10.1016/s0377-2217(96)00359-1

Google Scholar

[4] K.A. Dowsland. Some experiments with simulated annealing techniques for packing problems. European Journal of Operation Research, Vol. 68(1993), pp.389-399.

DOI: 10.1016/0377-2217(93)90195-s

Google Scholar

[5] K.H. Loh, G. Bruce, W. Edward. Solving the one-dimensional bin packing problem with a weight annealing heuristic. Computers & Operations Research, Vol. 10(2006), pp.1-9.

DOI: 10.1016/j.cor.2006.10.021

Google Scholar

[6] HE Guo-xian, LIU Kai. Application of annealing algorithm in optimizing loading project of dangerous goods in railway cargo terminal. Journal of the China Railway Society, Vol. 25(2003), pp.9-14.

Google Scholar

[7] YANG Xi-qing, NIU Hui-min. Model and Algorithm for the Multi-model and Multi-cargo Loading Problem. Journal of Lanzhou Jiaotong University, Vol. 28(2009), pp.123-125.

Google Scholar