MULTI-STAGE GENETIC ALGORITHM FOR CONTAINER PRE-MARSHALLING PROBLEM
Abstract
In order to solve the pre-marshalling problem in container yard, a mathematical programming model and a multi-stage genetic algorithm with binary encoding scheme are required. In the proposed algorithm, the objective function is designed via the definition of confuse coefficient; several heuristic operators provide development of necessary methodical and operational actions. The way how to achieve better solutions is shown at the example of two researches, confirming the efficiency of genetic algorithm with binary encoding as an optimizer to construct a container pre-marshalling model.
About the Authors
Li. HaoyuanRussian Federation
S. Dongshi
Russian Federation
References
1. Kim, K. H., Bae, J.W. Re-marshalling export containers in port container terminals. Computers and Industrial Engineering, 1998, 35, pp. 655-658.
2. Kim, K. H., Hong, G. P. A heuristic rule for relocating blocks. Computers and Operations Research, 2006, 33 (4), pp. 940-954.
3. Lee, Y, Hsu, N. Y. An optimization model for the container pre-marshalling problem. Computers and Operations Research, 2007, 34, pp. 3295-3313.
4. Lee, Y, Chao, S. H. A neighborhood search heuristic for pre-marshalling export containers. European Journal of Operational Research, 2009, 196 (2), pp. 468-475.
5. Rodriguez-Molins, M., Salido, M. A., Barber, F. Intelligent planning for allocating containers in maritime terminals. Expert Systems with Applications, 2012, 39(1), pp. 978-989.
6. Hao Jumin, Ji Zhuoshang, Lin Yan. Optimization model in mixture order contain yard. Journal of Dalian University of Technology, 2000, 40(1), pp. 102-105.
7. BianZhan, LiNa, LiXiangjun. Mixture optimization algorithm of pre-marshaling problem in container yard. Control and decision, 2014, 29(2), pp. 373-378.
8.
Review
For citations:
Haoyuan L., Dongshi S. MULTI-STAGE GENETIC ALGORITHM FOR CONTAINER PRE-MARSHALLING PROBLEM. World of Transport and Transportation. 2015;13(5):6-15.