Abstract
Due to increasing ships and quay cranes, container terminals operations become more and more busy. The traditional handling based on work line is converted into pool strategy, namely loading and unloading containers with multiple work lines are operating simultaneously. In the paper we discuss the yard crane scheduling problem with multiple work lines in container terminals. We develop a multi-objective 0-1 integer programming model considering the minimum total completion time of all yard cranes and the maximization balanced distribution of the completion time at the same time. With the application of adaptive weight GA approach, the problem can be solved by a multi-objective hybrid genetic algorithm and the Pareto solutions can be finally got. Using the compromised approach, the nearest feasible solution to ideal solution is chosen to be the best compromised Pareto optimal solution of the multi-objective model. The numerical example proves the applicability and effectiveness of the proposed method to the multi-objective yard crane scheduling problem.
Similar content being viewed by others
References
Gen, M., Cheng, R., & Lin, L. (2008). Network models and optimization: Multiobjective genetic algorithms approach. London: Springer.
He, J. L., Chang, D. F., & Mi, W. J. (2010). A hybrid parallel genetic algorithm for yard crane scheduling. Transportation Research Part E, 46, 136–155.
Kim, K. Y., & Kim, K. H. (1997). A routing algorithm for a single transfer crane to load export containers onto a container ship. Computers & Industrial Engineering, 33(3/4), 673–676.
Kim, K. H., & Kim, H. B. (1998). The optimal determination of the space requirement and the number of transfer cranes for import containers. Computers & Industrial Engineering, 35, 427–430.
Liang, C. J., Huang, Y. F., & Yang, Y. (2009). A quay crane dynamic scheduling problem by hybrid evolutionary algorithm for berth allocation planning. Computers & Industrial Engineering, 56(3), 1021–1028.
Liang, C. J., Chen, M., & Ma, X. F. (2011a). Study on yard crane scheduling with multiple container flows in a container terminal. Journal of Quality, 18(4), 375–392.
Liang, C. J., Guo, J. Q., & Yang, Y. (2011b). Multiobjective hybrid genetic algorithm for quay crane dynamic assignment in berth allocation planning. Journal of Intelligent Manufacturing, 22, 471–479.
Liang, C. J., Hwang, H., & Gen, M. (2012). A berth allocation planning problem with direct transshipment consideration. Journal of Intelligent Manufacturing, 23, 2207–2214.
Lin, L., Shinn, S. W., Gen, M., & Hwang, H. (2006). Network model and effective evolutionary approach for AGV dispatching in manufacturing system. Journal of Intelligent Manufacturing, 17, 465–477.
Lin, L., & Gen, M. (2009). Auto-tuning strategy for evolutionary algorithms: Balancing between exploration and exploitation. Soft Computing, 13, 157–168.
Lin, L., Hao, X. C., Gen, M., & Jo, J. B. (2012). Network modeling and evolutionary optimization for scheduling in manufacturing. Journal of Intelligent Manufacturing, 23, 2237–2253.
Linn, I. J., & Zhang, C.-Q. (2003). A heuristic for dynamic yard crane deployment in a container terminal. IIE Transactions, 35, 161–174.
Xu, X. G. (2006). Yard crane operation control system in container terminal. Ph.D. dissertation at Shanghai Maritime University.
Yang, C. X., & Wang, N. (2010). Berth-quay crane allocation in container terminal based on multi-objective genetic algorithm. Application Research of Computers, 27(1), 1720–1725.
Zhang, C. Q., Wan, Y. W., & Liu, J. Y. (2002). Dynamic crane deployment in container storage yards. Transportation Research Part B, 36, 537–555.
Acknowledgments
This research is partly supported by National Natural Science Foundation of China (71071093), partly Shanghai Municipal Natural Science Foundation (10ZR1413300), Innovation Program of Shanghai Municipal Education Commission (11YZ136), Foundation of Shanghai Maritime University (s2009286), Science and Technology Commission Foundation of Shanghai (08170511300, 09DZ2250400, 9530708200, 10190502500), Shanghai Education Commission Leading Academic Discipline Project (J50604), the Grant-in-Aid for Scientific Research (C) of Japan Society of Promotion of Science (JSPS) No. 245102190001, National Tsing Hua University (NSC 101-2811-E-007-004, NSC 102-2811-E-007-005) and the Dongseo Frontier Project Research Fund of Dongseo University in 2011.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Liang, CJ., Chen, M., Gen, M. et al. A multi-objective genetic algorithm for yard crane scheduling problem with multiple work lines. J Intell Manuf 25, 1013–1024 (2014). https://doi.org/10.1007/s10845-013-0792-4
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10845-013-0792-4