Abstract
For the optimization problem on container pick-up operation scheduling, a multi-stage mathematical programming model is established to minimize the total operation cost. This model is comprised of two parts: rehandling operation scheduling and the shortest path search. A nested genetic algorithm with two layers is proposed, where the inner layer algorithm is embedded in the outer one. The outer algorithm is responsible for optimizing rehandling operation scheduling, and the inner is for searching the shortest path of rehandling operation. Two reformative operations are introduced, including the parent population involving selection and optimal individual maintaining. With an actual example, the algorithm is testified, the result shows that the algorithm is effective to solve this problem and has a high efficiency and speed of convergence.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Kim, K.H.: Evaluation of the number of rehandles in container yards. Computers and Industrial Engineering 32(4), 701–711 (1997)
Kozan, E., Preston, P.: Genetic algorithms to schedule container transfers at multimodal terminals. International Transactions in Operational Research 6(3), 311–329 (1999)
Preston, P., Kozan, E.: An approach to determine storage locations of containers at seaport terminals. Computers and Operations Research 28(10), 983–995 (2001)
Maojun, L., Shaosheng, F., An, L.: A Partheno-genetic Algorithm for Combinatorial Optimization. In: Pal, N.R., Kasabov, N., Mudi, R.K., Pal, S., Parui, S.K. (eds.) ICONIP 2004. LNCS, vol. 3316, pp. 224–229. Springer, Heidelberg (2004)
Rocha, M., Vilela, C., Neves, J.: A Study of Order Based Genetic and Evolutionary Algorithms in Combinatorial Optimization Problems. In: Logananthara, R., Palm, G., Ali, M. (eds.) IEA/AIE 2000. LNCS (LNAI), vol. 1821, pp. 601–611. Springer, Heidelberg (2000)
Gomez-Albarran, de las Mercedes, M., Cesteros, F.P., Ana, M., Sanchez-Perez, Juan, M.: A routing strategy based on genetic algorithms. Microelectronics Journal (Incorporating Journal of Semicustom ICs) 28(6), 641–656 (1997)
Davies, C., Lingras, P.: Genetic algorithms for rerouting shortest paths in dynamic and stochastic networks. European Journal of Operational Research 144(1), 127–138 (2003)
Yoo, S.-H., Sung-Bae, C.: Partially Evaluated Genetic Algorithm Based on Fuzzy c-Means Algorithm. In: Yao, X., Burke, E.K., Lozano, J.A., Smith, J., Merelo-Guervós, J.J., Bullinaria, J.A., Rowe, J.E., Tiňo, P., Kabán, A., Schwefel, H.-P. (eds.) PPSN 2004. LNCS, vol. 3242, pp. 440–449. Springer, Heidelberg (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Shen, J., Jin, C., Gao, P. (2006). A Nested Genetic Algorithm for Optimal Container Pick-Up Operation Scheduling on Container Yards. In: Jiao, L., Wang, L., Gao, Xb., Liu, J., Wu, F. (eds) Advances in Natural Computation. ICNC 2006. Lecture Notes in Computer Science, vol 4221. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11881070_91
Download citation
DOI: https://doi.org/10.1007/11881070_91
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-45901-9
Online ISBN: 978-3-540-45902-6
eBook Packages: Computer ScienceComputer Science (R0)