Addressing a Coordinated Quay Crane Scheduling and Assignment Problem by Red Deer Algorithm

Document Type : Original Article


1 Department of Industrial Engineering, Shomal University, Amol, Iran

2 Department of Industrial Engineering and Management Systems, Amirkabir University of Technology, Tehran, Iran

3 School of Mechanical Engineering, Shandong University, Jinan, China Key Laboratory of High Efficiency and Clean Mechanical Manufacture (Ministry of Education), Shandong University, Jinan, China


Nowadays, there is much attention for planning of container terminals in the global trade centers. The high cost of quay cranes motivates both scholars and industrial practitioners especially in the last decade to develop novel optimization models to address this dilemma. This study proposes a coordinated optimization model to cover both Quay Crane Scheduling Problem (QCSP) and Quay Crane Assignment Problem (QCAP) as among the first attempts in this area. Another main contribution of this paper is to apply a recent nature-inspired algorithm called Red Deer Algorithm (RDA). The RDA revealed its performance for a variety of combinatorial optimization problems in different real-world applications. This is the first attempt in the literature to employ this recent metaheuristic to solve the proposed Coordinated Quay Crane Scheduling and Assignment Problem (CQCSAP). Finally, an extensive comparison discussion is considered to reveal the main benefits of the proposed optimization model and solution algorithm.


Main Subjects

1. Frojan, P., Correcher, J.F., Alvarez-Valdes, R., Koulouris, G. and
Tamarit, J.M., "The continuous berth allocation problem in a
container terminal with multiple quays", Expert Systems with
Applications,  Vol. 42, No. 21, (2015), 7356-7366. 
2. Hajiaghaei-Keshteli, M. and Fathollahi-Fard, A.M., "A set of
efficient heuristics and metaheuristics to solve a two-stage 
stochastic bi-level decision-making model for the distribution
network problem", Computers & Industrial Engineering,  Vol.
123, (2018), 378-395. 
3. Lalla-Ruiz, E., González-Velarde, J.L., Melián-Batista, B. and
Moreno-Vega, J.M., "Biased random key genetic algorithm for
the tactical berth allocation problem", Applied Soft Computing, 
Vol. 22, (2014), 60-76. 
4. Fathollahi-Fard, A.M., Hajiaghaei-Keshteli, M. and TavakkoliMoghaddam,
Journal of Cleaner Production,  Vol. 200, (2018),
5. Al-Dhaheri, N. and Diabat, A., "The quay crane scheduling
problem", Journal of Manufacturing Systems,  Vol. 36, (2015),
6. Daganzo, C.F., "The crane scheduling problem", Transportation
Research Part B: Methodological,  Vol. 23, No. 3, (1989), 159175.
7. Kim, K.H. and Park, Y.-M., "A crane scheduling method for port
container terminals", European Journal of operational research, 
Vol. 156, No. 3, (2004), 752-768. 
8. Imai, A., Chen, H.C., Nishimura, E. and Papadimitriou, S., "The
simultaneous berth and quay crane allocation problem", 
Transportation Research Part E: Logistics and Transportation
Review,  Vol. 44, No. 5, (2008), 900-920. 
9. Goodchild, A.V. and Daganzo, C., "Crane double cycling in
container ports: Planning methods and evaluation", 
Transportation Research Part B: Methodological,  Vol. 41, No.
8, (2007), 875-891. 
10. Wu, L. and Ma, W., "Quay crane scheduling with draft and trim
constraints", Transportation Research Part E: Logistics and
Transportation Review,  Vol. 97, (2017), 38-68. 
11. Agra, A. and Oliveira, M., "Mip approaches for the integrated
berth allocation and quay crane assignment and scheduling
problem", European Journal of Operational Research,  Vol.
264, No. 1, (2018), 138-148. 
12. Azevedo, A.T., de Salles Neto, L.L., Chaves, A.A. and Moretti,
A.C., "Solving the 3d stowage planning problem integrated with
the quay crane scheduling problem by representation by rules and
genetic algorithm", Applied Soft Computing,  Vol. 65, (2018),
13. Kasm, O.A., Diabat, A. and Cheng, T., "The integrated berth
allocation, quay crane assignment and scheduling problem:
Mathematical formulations and a case study", Annals of
Operations Research,  (2019), 1-27. 
14. Correcher, J.F., Alvarez-Valdes, R. and Tamarit, J.M., "New
exact methods for the time-invariant berth allocation and quay
crane assignment problem", European Journal of Operational
Research,  Vol. 275, No. 1, (2019), 80-92. 
15. Fard, A.F. and Hajiaghaei-Keshteli, M., "Red deer algorithm
(rda); a new optimization algorithm inspired by red deers’
mating", in International Conference on Industrial Engineering,
IEEE.,(2016 e)., (2016), 33-34. 
16. Fathollahi-Fard, A.M., Hajiaghaei-Keshteli, M. and Mirjalili, S.,
"A set of efficient heuristics for a home healthcare problem", 
Neural Computing and Applications,  (2019), 1-21.
17. Fu, Y., Tian, G., Fathollahi-Fard, A.M., Ahmadi, A. and Zhang, 
C., "Stochastic multi-objective modelling and optimization of an
energy-conscious distributed permutation flow shop scheduling
problem with the total tardiness constraint", Journal of Cleaner
Production,  Vol. 226, (2019), 515-525. 
18. Hajiaghaei-Keshteli, M., Abdallah, K. and Fathollahi-Fard, A.,
"A collaborative stochastic closed-loop supply chain network
design for tire industry", International Journal of Engineering, 
Transactions A: Basics, Vol. 31, No. 10, (2018), 1715-1722.