Framework branch-and-price algorithm for yard management problem at container terminals

We study a deterministic storage yard management problem which jointly determines storage space allocation and yard crane assignment. The problem is first formulated as an integer program to minimize the total operational cost. To solve large-scaled problems, we then transform it to a set partitioning formulation and provide a framework of branch-and-price algorithm. Computational experiments to explain the performance of the solution approach are to be further conducted.

[1]  Kap Hwan Kim,et al.  Container Terminals and Cargo Systems , 2007 .

[2]  Loo Hay Lee,et al.  An Integrated Model for Berth Template and Yard Template Planning in Transshipment Hubs , 2011, Transp. Sci..

[3]  Shell-Ying Huang,et al.  Dynamic Space and Time Partitioning for Yard Crane Workload Management in Container Terminals , 2012, Transp. Sci..

[4]  Nicos Christofides,et al.  An algorithm for the resource constrained shortest path problem , 1989, Networks.

[5]  Michel Bierlaire,et al.  Container terminal management: integrated models and large-scale optimization algorithms , 2011 .

[6]  Moshe Dror,et al.  Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW , 1994, Oper. Res..

[7]  Der-Horng Lee,et al.  Storage Yard Management in Maritime Container Terminals , 2016, Transp. Sci..

[8]  Hao Hu,et al.  Tactical berth and yard template design at container transshipment terminals: A column generation based approach , 2015 .

[9]  Michel Gendreau,et al.  An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems , 2004, Networks.

[10]  Andrew Lim,et al.  A critical-shaking neighborhood search for the yard allocation problem , 2006, Eur. J. Oper. Res..

[11]  W. Art Chaovalitwongse,et al.  Sequence Assignment Model for the Flight Conflict Resolution Problem , 2014, Transp. Sci..

[12]  Loo Hay Lee,et al.  A container yard storage strategy for improving land utilization and operation efficiency in a transshipment hub port , 2012, Eur. J. Oper. Res..

[13]  Michel Bierlaire,et al.  An Exact Algorithm for the Integrated Planning of Berth Allocation and Quay Crane Assignment , 2013, Transp. Sci..

[14]  Lu Zhen.  Yard template planning in transshipment hubs under uncertain berthing time and position , 2013, J. Oper. Res. Soc..

[15]  Juan José Salazar González,et al.  Solving the Single Vehicle Routing Problem with Variable Capacity , 2016, Transp. Sci..

[16]  Matteo Salani,et al.  Modeling and Solving the Tactical Berth Allocation Problem , 2010 .

[17]  Gilbert Laporte,et al.  Scheduling Twin Yard Cranes in a Container Block , 2015, Transp. Sci..