A branch-and-price algorithm to solve the integrated berth allocation and yard assignment problem in bulk ports

In this research, two crucial optimization problems of berth allocation and yard assignment in the context of bulk ports are studied. We discuss how these problems are interrelated and can be combined and solved as a single large scale optimization problem. More importantly we emphasize the differences in operations between bulk ports and container terminals which emphasizes the need to devise specific solutions for bulk ports. The objective is to minimize the total service time of vessels berthing at the port. We propose an exact solution algorithm based on branch and price framework to solve the integrated problem. In the proposed model, the master problem is formulated as a set-partitioning problem, and subproblems to identify columns with negative reduced costs are solved using mixed integer programming. The proposed algorithm is tested and validated through numerical experiments based on instances inspired from real bulk port data. The results indicate that the algorithm can be successfully used to solve instances containing up to 40 vessels within reasonable computational time.

[1]  Akio Imai,et al.  BERTH ALLOCATION IN A CONTAINER PORT: USING A CONTINUOUS LOCATION SPACE APPROACH , 2005 .

[2]  Guy Desaulniers,et al.  Bi-dynamic constraint aggregation and subproblem reduction , 2008, Comput. Oper. Res..

[3]  Chung-lun Li,et al.  Scheduling with multiple-job-on-one-processor pattern , 1998 .

[4]  Chung-Lun Li,et al.  Interblock Crane Deployment in Container Terminals , 2002, Transp. Sci..

[5]  西村 悦子,et al.  Berth Allocation Planning in the Public Berth System by Genetic Algorithms , 2000 .

[6]  Guy Desaulniers,et al.  Dynamic Aggregation of Set-Partitioning Constraints in Column Generation , 2003, Oper. Res..

[7]  Chung-Piaw Teo,et al.  Berth Allocation Planning Optimization in Container Terminals , 2008 .

[8]  Kap Hwan Kim,et al.  Load scheduling for multiple quay cranes in port container terminals , 2006, J. Intell. Manuf..

[9]  Zuhua Jiang,et al.  A berth allocation strategy using heuristics algorithm and simulation optimisation , 2008, Int. J. Comput. Appl. Technol..

[10]  Hark Hwang,et al.  Sequencing delivery and receiving operations for yard cranes in port container terminals , 2003 .

[11]  Marcus Poggi de Aragão,et al.  Stabilized branch-and-cut-and-price for the generalized assignment problem , 2005, Electron. Notes Discret. Math..

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

[13]  Richard J. Linn,et al.  Dynamic crane deployment in container storage yards , 2002 .

[14]  Der-Horng Lee,et al.  Feeder vessel management at container transshipment terminals , 2013 .

[15]  Martin W. P. Savelsbergh,et al.  Minimum Vehicle Fleet Size Under Time-Window Constraints at a Container Terminal , 2005, Transp. Sci..

[16]  Marshall Conley,et al.  Canadian shipping policies and the United Nations Conference on Trade and Development: an analysis of UNCTAD V , 1982 .

[17]  Maria Flavia Monaco,et al.  The Berth Allocation Problem: A Strong Formulation Solved by a Lagrangean Approach , 2007, Transp. Sci..

[18]  Martin W. P. Savelsbergh,et al.  Branch-and-Price: Column Generation for Solving Huge Integer Programs , 1998, Oper. Res..

[19]  Andrew Lim,et al.  Ant Colony Optimization for the Ship Berthing Problem , 1999, ASIAN.

[20]  Frederick S. Hillier,et al.  Introduction of Operations Research , 1967 .

[21]  Christian Bierwirth,et al.  Integration of Berth Allocation and Crane Assignment to Improve the Resource Utilization at a Seaport Container Terminal , 2005, OR.

[22]  Chung-Lun Li,et al.  Analysis of a new vehicle scheduling and location problem , 2001 .

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

[24]  Loo Hay Lee,et al.  An optimization model for storage yard management in transshipment hubs , 2006, OR Spectr..

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

[26]  Kap Hwan Kim,et al.  Berth scheduling by simulated annealing , 2003 .

[27]  Stefan Voß,et al.  Container terminal operation and operations research - a classification and literature review , 2004, OR Spectr..

[28]  Filipe Pereira e Alvelos,et al.  Branch-and-price and multicommodity flows , 2005 .

[29]  Henry Y. K. Lau,et al.  Integrated scheduling of handling equipment at automated container terminals , 2008, Ann. Oper. Res..

[30]  Akio Imai,et al.  Container storage and transshipment marine terminals , 2009 .

[31]  Petros A. Ioannou,et al.  AUTOMATED GUIDED VEHICLE SYSTEM FOR TWO CONTAINER YARD LAYOUTS , 2004 .

[32]  Chung-Lun Li,et al.  A multiprocessor task scheduling model for berth allocation: heuristic and worst-case analysis , 2002, Oper. Res. Lett..

[33]  Chung-Piaw Teo,et al.  Dispatching Automated Guided Vehicles in a Container Terminal , 2005 .

[34]  Kap Hwan Kim,et al.  Berth scheduling for container terminals by using a sub-gradient optimization technique , 2002, J. Oper. Res. Soc..

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

[36]  Michel Bierlaire,et al.  Exact and heuristic methods to solve the berth allocation problem in bulk ports , 2013 .

[37]  Gilbert Laporte,et al.  The service allocation problem at the Gioia Tauro Maritime Terminal , 2007, Eur. J. Oper. Res..

[38]  Erhan Kozan,et al.  Mathematical modelling of container transfers and storage locations at seaport terminals , 2006, OR Spectr..

[39]  L. Lei,et al.  Container vessel scheduling with bi-directional flows , 2007, Oper. Res. Lett..

[40]  Gilbert Laporte,et al.  Models and Tabu Search Heuristics for the Berth-Allocation Problem , 2005, Transp. Sci..

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

[42]  K. L. Mak,et al.  Yard crane scheduling in port container terminals , 2005 .

[43]  Kay Chen Tan,et al.  Multi-objective and prioritized berth allocation in container ports , 2010, Ann. Oper. Res..

[44]  Chung-Piaw Teo,et al.  Berth management in container terminal: the template design problem , 2006, OR Spectr..

[45]  Christian Bierwirth,et al.  Heuristics for the integration of crane productivity in the berth allocation problem , 2009 .

[46]  Kap Hwan Kim,et al.  A scheduling method for Berth and Quay cranes , 2003, OR Spectr..

[47]  W. C. Ng,et al.  Crane scheduling in container yards with inter-crane interference , 2005, Eur. J. Oper. Res..

[48]  Akio Imai,et al.  Berth allocation with service priority , 2003 .

[49]  Dominique Feillet,et al.  A tutorial on column generation and branch-and-price for vehicle routing problems , 2010, 4OR.

[50]  Andrew Lim,et al.  The berth planning problem , 1998, Oper. Res. Lett..

[51]  Hai-gui Kang,et al.  Study on berth and quay-crane allocation under stochastic environments in container terminal , 2008 .

[52]  Yongpei Guan,et al.  The berth allocation problem: models and solution methods , 2004, OR Spectr..

[53]  Yongpei Guan,et al.  The berth allocation problem: models and solution methods , 2004 .

[54]  Akio Imai,et al.  Berth allocation at indented berths for mega-containerships , 2007, Eur. J. Oper. Res..

[55]  Alexandre César Muniz de Oliveira,et al.  A Hybrid Column Generation Approach for the Berth Allocation Problem , 2008, EvoCOP.

[56]  Akio Imai,et al.  Berthing ships at a multi-user container terminal with a limited quay capacity , 2008 .

[57]  Akio Imai,et al.  The Dynamic Berth Allocation Problem for a Container Port , 2001 .

[58]  R. Faure,et al.  Introduction to operations research , 1968 .

[59]  Monique Guignard-Spielberg,et al.  An algorithm for the generalized quadratic assignment problem , 2008, Comput. Optim. Appl..

[60]  Kap Hwan Kim,et al.  Routing straddle carriers for the loading operation of containers using a beam search algorithm , 1999 .

[61]  Stefan Voß,et al.  Operations research at container terminals: a literature update , 2007, OR Spectr..

[62]  Li-feng Xi,et al.  A proactive approach for simultaneous berth and quay crane scheduling problem with stochastic arrival and handling time , 2010, Eur. J. Oper. Res..

[63]  Gilbert Laporte,et al.  A Memetic Heuristic for the Generalized Quadratic Assignment Problem , 2006, INFORMS J. Comput..

[64]  Jesper Larsen,et al.  Models for the discrete berth allocation problem: A computational comparison , 2011 .

[65]  Akio Imai,et al.  The simultaneous berth and quay crane allocation problem , 2008 .

[66]  Akio Imai,et al.  Efficient planning of berth allocation for container terminals in Asia , 1997 .