A hybrid dynamic berth allocation planning problem with fuel costs considerations for container terminal port using chemical reaction optimization approach

This paper investigates the dynamic ship berth allocation problem for a container handling port, focusing on vessel waiting time at the anchorage due to the unavailability of the berth and quay cranes. A mixed integer linear programming model considering the fuel cost associated with waiting time and operational time of the docked vessel is developed. The hiring of the quay cranes to load/unload the containers from the ship and arrangement of the vessels in different berths is taken into account. Fuel consumed by the vessels while performing their respective port operations is incorporated in the model for addressing the sustainability aspects in berth allocation problem. A chemical reaction optimization algorithm is proposed to solve the problem in a large-scale realistic environment and compared with the results with block-based genetic algorithm, genetic algorithm and particle swarm optimization. The computational experiment illustrates and validates the proposed model on a real case scenario of the port located in India. The case shows that the developed model achieves better utilization of port resources and available berths.

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

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

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

[4]  Tung Khac Truong,et al.  Chemical reaction optimization with greedy strategy for the 0-1 knapsack problem , 2013, Appl. Soft Comput..

[5]  Lu Zhen,et al.  Tactical berth allocation under uncertainty , 2015, Eur. J. Oper. Res..

[6]  Arijit De,et al.  Multiobjective Approach for Sustainable Ship Routing and Scheduling With Draft Restrictions , 2019, IEEE Transactions on Engineering Management.

[7]  Akio Imai,et al.  Berth allocation planning in the public berth system by genetic algorithms , 2001, Eur. J. Oper. Res..

[8]  Jian Guan,et al.  Hybridizing variable neighborhood search with ant colony optimization for solving the single row facility layout problem , 2016, Eur. J. Oper. Res..

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

[10]  Quan-Ke Pan,et al.  A hybrid variable neighborhood search for solving the hybrid flow shop scheduling problem , 2014, Appl. Soft Comput..

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

[12]  Albert W. Veenstra,et al.  A quantitative analysis of container vessel arrival planning strategies , 2010, OR Spectr..

[13]  Provas Kumar Roy,et al.  Solution of economic load dispatch using hybrid chemical reaction optimization approach , 2014, Appl. Soft Comput..

[14]  Jan Tijmen Udding,et al.  Simultaneous berth allocation and yard planning at tactical level , 2013, OR Spectr..

[15]  Belén Melián-Batista,et al.  Biased random key genetic algorithm for the Tactical Berth Allocation Problem , 2014, Appl. Soft Comput..

[16]  Weimin Ma,et al.  Quay crane scheduling with draft and trim constraints , 2017 .

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

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

[19]  Kay Chen Tan,et al.  A Multi-Objective Multi-Colony Ant Algorithm for Solving the Berth Allocation Problem , 2008, Advances of Computational Intelligence in Industrial Systems.

[20]  Luiz Antonio Nogueira Lorena,et al.  Clustering Search for the Berth Allocation Problem , 2012, Expert Syst. Appl..

[21]  Glaydston Mattos Ribeiro,et al.  An adaptive large neighborhood search for the discrete and continuous Berth allocation problem , 2016, Comput. Oper. Res..

[22]  Aniruddha Bhattacharya,et al.  Real coded chemical reaction based optimization for short-term hydrothermal scheduling , 2014, Appl. Soft Comput..

[23]  Manoj Kumar Tiwari,et al.  Composite particle algorithm for sustainable integrated dynamic ship routing and scheduling optimization , 2016, Comput. Ind. Eng..

[24]  Chung Yee Lee,et al.  Joint planning of berth and yard allocation in transshipment terminals using multi-cluster stacking strategy , 2015 .

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

[26]  Belén Melián-Batista,et al.  A Set-Partitioning-based model for the Berth Allocation Problem under Time-Dependent Limitations , 2016, Eur. J. Oper. Res..

[27]  Manoj Kumar Tiwari,et al.  The robust quay crane allocation for a discrete bulk material handling port , 2015, 2015 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM).

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

[29]  Manoj Kumar Tiwari,et al.  Minimizing delay of ships in bulk terminals by simultaneous ship scheduling, stockyard planning and train scheduling , 2015 .

[30]  Ching-Jung Ting,et al.  Particle swarm optimization algorithm for the berth allocation problem , 2014, Expert Syst. Appl..

[31]  Angappa Gunasekaran,et al.  Sustainable maritime inventory routing problem with time window constraints , 2017, Eng. Appl. Artif. Intell..

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

[33]  Victor O. K. Li,et al.  Real-Coded Chemical Reaction Optimization , 2012, IEEE Transactions on Evolutionary Computation.

[34]  Georgios K. D. Saharidis,et al.  The berth allocation problem: Optimizing vessel arrival time , 2009 .

[35]  Zhiyong Li,et al.  hybrid algorithm based on particle swarm and chemical reaction ptimization for multi-object problems , 2015 .

[36]  Manoj Kumar Tiwari,et al.  A block-based evolutionary algorithm for flow-shop scheduling problem , 2013, Appl. Soft Comput..

[37]  Manoj Kumar Tiwari,et al.  Decision Support System for Discrete Robust Berth Allocation , 2015, IFAC-PapersOnLine.

[38]  Pierre Hansen,et al.  Variable neighborhood search for minimum cost berth allocation , 2003, Eur. J. Oper. Res..

[39]  Glaydston Mattos Ribeiro,et al.  Berth allocation in an ore terminal with demurrage, despatch and maintenance , 2016, Comput. Ind. Eng..

[40]  Der-Horng Lee,et al.  The continuous Berth Allocation Problem: A Greedy Randomized Adaptive Search Solution , 2010 .

[41]  Quan-Ke Pan,et al.  Chemical-reaction optimization for flexible job-shop scheduling problems with maintenance activity , 2012, Appl. Soft Comput..

[42]  Zhi-Hua Hu,et al.  Berth and quay-crane allocation problem considering fuel consumption and emissions from vessels , 2014, Comput. Ind. Eng..

[43]  Manoj Kumar Tiwari,et al.  Robust Formulation for Optimizing Sustainable Ship Routing and Scheduling Problem , 2015 .

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

[45]  Allan Larsen,et al.  Integrated Berth Allocation and Quay Crane Assignment Problem: Set partitioning models and computational results , 2015 .