A Mathematical Model and Grouping Imperialist Competitive Algorithm for Integrated Quay Crane and Yard Truck Scheduling Problem with Non-crossing Constraint

In this research, an integrated approach is presented to simultaneously solve quay crane scheduling and yard truck scheduling problems. A mathematical model was proposed considering the main real-world assumptions such as quay crane non-crossing, precedence constraints and variable berthing times for vessels with the aim of minimizing vessels completion time. Based on the numerical results, this proposed mathematical model has suitable efficiency for solving small instances. Two versions of imperialist competitive algorithm (ICA) are presented to heuristically solve the problem. The grouping version of  algorithm (G-ICA) is used to solve the large-sized instances based on considering the allocation of trucks as a grouping problem. Effectiveness of the proposed metaheuristics on small-sized problems is compared with the optimal results of the mathematical model. In order to compare the efficiency of the proposed algorithms for large-sized instances, several instances were generated and solved, and the performance of algorithms has been compared with each other. Moreover, a simulated annealing (SA) algorithm is developed to solve the problem and evaluate the performance of the proposed ICA algorithms. Based on the experimental results, the G-ICA has a better performance compared to the ICA and SA. Also an instance of a container terminal in Iran has been investigated which shows that the proposed model and solution methods are applicable in real-world problems.

[1]  Christian Bierwirth,et al.  A follow-up survey of berth allocation and quay crane scheduling problems in container terminals , 2015, Eur. J. Oper. Res..

[2]  Carlos F. Daganzo,et al.  THE CRANE SCHEDULING PROBLEM , 1989 .

[3]  K. L. Mak,et al.  Scheduling trucks in container terminals using a genetic algorithm , 2007 .

[4]  Reza Tavakkoli-Moghaddam,et al.  Solving a Redundancy Allocation Problem by a Hybrid Multi-objective Imperialist Competitive Algorithm , 2013 .

[5]  S. M. Hosseinirad.  A Hierarchy Topology Design Using a Hybrid Evolutionary Algorithm in Wireless Sensor Networks , 2018 .

[6]  I. Nakhai Kamalabadi,et al.  Critical Path Method for Lot Streaming Problem in Flexible Job Shop Environment , 2017 .

[7]  Manisha Mishra,et al.  A Multiobjective Path-Planning Algorithm With Time Windows for Asset Routing in a Dynamic Weather-Impacted Environment , 2017, IEEE Transactions on Systems, Man, and Cybernetics: Systems.

[8]  Youfang Huang,et al.  Integrated internal truck, yard crane and quay crane scheduling in a container terminal considering energy consumption , 2015, Expert Syst. Appl..

[9]  André Langevin,et al.  Integrated scheduling of crane handling and truck transportation in a maritime container terminal , 2013, Eur. J. Oper. Res..

[10]  Ebru K. Bish,et al.  A multiple-crane-constrained scheduling problem in a container terminal , 2003, Eur. J. Oper. Res..

[11]  Nathan Huynh,et al.  Integrated quay crane and yard truck scheduling for unloading inbound containers , 2015 .

[12]  Christian Bierwirth,et al.  A fast heuristic for quay crane scheduling with interference constraints , 2009, J. Sched..

[13]  Simon Emde.  Optimally scheduling interfering and non‐interfering cranes , 2017 .

[14]  Christian Bierwirth,et al.  A survey of berth allocation and quay crane scheduling problems in container terminals , 2010, Eur. J. Oper. Res..

[15]  Nasser Salmasi,et al.  Total completion time minimisation of no-wait flowshop group scheduling problem with sequence dependent setup times , 2017 .

[16]  Behnam Vahdani,et al.  Bi-objective optimization for integrating quay crane and internal truck assignment with challenges of trucks sharing , 2019, Knowl. Based Syst..

[17]  Dehong Xu,et al.  Research on coupling scheduling of quay crane dispatch and configuration in the container terminal , 2018, Comput. Ind. Eng..

[18]  Lixin Tang,et al.  Modeling and solution of the joint quay crane and truck scheduling problem , 2014, Eur. J. Oper. Res..

[19]  Ali Husseinzadeh Kashan,et al.  A particle swarm optimizer for grouping problems , 2013, Inf. Sci..

[20]  Kap Hwan Kim,et al.  A crane scheduling method for port container terminals , 2004, Eur. J. Oper. Res..

[21]  Akio Imai,et al.  Yard trailer routing at a maritime container terminal , 2005 .

[22]  M. F. Monaco,et al.  A tabu search heuristic for the quay crane scheduling problem , 2007 .

[23]  Zhi-Hua Hu,et al.  Sequencing twin automated stacking cranes in a block at automated container terminal , 2016 .

[24]  K. L. Mak,et al.  Quay crane scheduling in container terminals , 2006 .

[25]  Mark Johnston,et al.  Hybrid evolutionary computation methods for quay crane scheduling problems , 2013, Comput. Oper. Res..

[26]  Caro Lucas,et al.  Imperialist competitive algorithm: An algorithm for optimization inspired by imperialistic competition , 2007, 2007 IEEE Congress on Evolutionary Computation.

[27]  Nathan Huynh,et al.  An efficient genetic algorithm for solving the quay crane scheduling problem , 2012, Expert Syst. Appl..

[28]  Lei Wang,et al.  Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departures , 2006 .

[29]  J. Tongzon,et al.  Port privatization, efficiency and competitiveness: Some empirical evidence from container ports (terminals) , 2005 .

[30]  Lixin Tang,et al.  A Benders decomposition-based framework for solving quay crane scheduling problems , 2019, Eur. J. Oper. Res..

[31]  Lifeng Xi,et al.  A tabu search algorithm for the integrated scheduling problem of container handling systems in a maritime terminal , 2007, Eur. J. Oper. Res..

[32]  Amr B. Eltawil,et al.  Simultaneous assignment of quay cranes and internal trucks in container terminals , 2016 .

[33]  Yongsheng Yang,et al.  An integrated scheduling method for AGV routing in automated container terminals , 2018, Comput. Ind. Eng..

[34]  Jin Xin Cao,et al.  Integrated quay crane and yard truck schedule problem in container terminals , 2010 .

[35]  Gilbert Laporte,et al.  A branch‐and‐cut algorithm for the quay crane scheduling problem in a container terminal , 2006 .

[36]  Nasim Nahavandi,et al.  MEASURING PRODUCTIVITY INDEXES AND EFFICIENCY IN THE CONTAINER TERMINAL AT PORT RAJAEI , 2002 .

[37]  Ali H. Diabat,et al.  The quay crane scheduling problem with non-crossing and safety clearance constraints: An exact solution approach , 2019, Comput. Oper. Res..