Abstract
Solving the problem of allocating and scheduling quay cranes (QCs) is very important to ensure favorable port service. This work proposes a bi-criteria mixed integer programming model of the continual and dynamic arrival of several vessels at a port. A multi-objective genetic algorithm is applied to solve the problem in three cases. The results thus obtained confirm the feasibility and effectiveness of the model and GA. Additionally, the multi-objective solution considering both the total duration for which vessels stay in the port and QCs move is the best, as determined by comparing with considering only the total time for which vessels stay in the port or QCs move, as it considers, and it balances these two objectives.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Fan, Z., & Le, M. (2013). A genetic algorithm to minimize the makespan and waiting time for the bi-objective quay crane scheduling problem. Journal of Systems & Management, 22(1), 120–127.
Gen, M., & Cheng, R. (2000). Genetic Algorithms and Engineering Optimization. New York: John Wiley & Sons.
Gen, M., & Lin, L. (2014). Multiobjective evolutionary algorithm for manufacturing scheduling problems: State-of-the-art survey. Journal of Intelligent Manufacturing, 25(5), 849–866.
Han, J., Sun, X., & Jin, Z. (2008). Coordinated optimization method for berth and quay crane allocation in container terminal. Journal of Dalian Maritime University, 2, 117–121.
Jin, Z., & Li, N. (2011). Optimization of quay crane dynamic scheduling based on berth schedules in container terminals. Journal of Transportation Systems Engineering and Information Technology, 11(3), 58–64.
Kim, K. H., & Park, Y. M. (2004). A crane scheduling method for port container terminals. European Journal of Operational Research, 156, 752–768.
Moghaddam, R. T., Makui, A., Salahi, A., et al. (2009). An efficient algorithm for solving a new mathematical model for a quay crane scheduling problem in container ports. Computers & Industrial Engineering, 56, 241–248.
Qin, J., Ni, L., & Wang, C. (2013). Optimization model and algorithm for quay crane scheduling in container terminals. Journal of Southwest Jiao Tong University, 1, 184–192.
Tang, S. (2011). Research of optimal allocation for container berth and quay crane resources. MS Dissertation, Dalian Maritime University.
Zhang, Y. (2012). Quay crane scheduling problem at container terminal based on operations balance. PhD Dissertation, Shanghai Maritime University.
Acknowledgments
This research is supported by National Natural Science Foundation of China (71471110, 71301101, 2014M550084), Science and Technology Commission Foundation of Shanghai (09DZ2250400, 9530708200, 10190502500) and Shanghai Education Commission Leading Academic Discipline Project (J50604), Liaoning Social Science Planning Fund Plan (L14CJY041); 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, C., Li, M., Lu, B. et al. Dynamic configuration of QC allocating problem based on multi-objective genetic algorithm. J Intell Manuf 28, 847–855 (2017). https://doi.org/10.1007/s10845-015-1035-7
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10845-015-1035-7