Differential evolution based meta-heuristic algorithm for dynamic continuous berth allocation problem

Abstract In this study, a new solution method based on differential evolution algorithm is proposed for solving Dynamic Berth Allocation Problem (DBAP). Continuous type of this problem which deals with continuous wharf space is considered. Differential evolution algorithm, a meta-heuristic approach, is a type of evolutionary algorithm that is powerful on continuous space problems. In determining the optimal values for this meta-heuristic approach, a statistical analysis is conducted. The test problems generated randomly are used to evaluate the algorithm and the schedules generated by the algorithm are compared with that obtained by other meta-heuristics initials from literature, and analyzed. The results show that the proposed method solves test problems and achieves optimal solutions.

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

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

[3]  Kay Chen Tan,et al.  Solving the berth allocation problem with service priority via multi-objective optimization , 2009, 2009 IEEE Symposium on Computational Intelligence in Scheduling.

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

[5]  Loo Hay Lee,et al.  A decision model for berth allocation under uncertainty , 2011, Eur. J. Oper. Res..

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

[7]  Mihalis M. Golias,et al.  A lamda-optimal based heuristic for the berth scheduling problem , 2010 .

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

[9]  Jih-Gau Juang,et al.  Disturbance encountered landing system design based on sliding mode control with evolutionary computation and cerebellar model articulation controller , 2015 .

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

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

[12]  Andrew Lim,et al.  A stochastic beam search for the berth allocation problem , 2007, Decis. Support Syst..

[13]  H. Javanshir,et al.  NONLINEAR MATHEMATICAL PROGRAMMING FOR OPTIMAL MANAGEMENT OF CONTAINER TERMINALS , 2009 .

[14]  Xiongwen Quan,et al.  Robust berth scheduling with uncertain vessel delay and handling time , 2012, Ann. Oper. Res..

[15]  Mihalis M. Golias,et al.  An optimization based genetic algorithm heuristic for the berth allocation problem , 2007, 2007 IEEE Congress on Evolutionary Computation.

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

[17]  M. M. Ali,et al.  A penalty function-based differential evolution algorithm for constrained global optimization , 2012, Computational Optimization and Applications.

[18]  J. Jerald,et al.  Scheduling of machines and automated guided vehicles in FMS using differential evolution , 2010 .

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

[20]  Zhi-Hua Hu,et al.  An Integer Linear Programming Model for Continuous Berth Allocation Problem , 2009, 2009 International Conference on Information Management, Innovation Management and Industrial Engineering.

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

[22]  Zhi-Hua Hu,et al.  Optimizing continuous berth allocation by immune algorithm , 2009, 2009 IEEE International Conference on Intelligent Computing and Intelligent Systems.

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

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

[25]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

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

[27]  Mihalis M. Golias,et al.  Berth scheduling by customer service differentiation: A multi-objective approach , 2009 .

[28]  G. K. D. Saharidis,et al.  The berth scheduling problem with customer differentiation: a new methodological approach based on hierarchical optimization , 2010 .

[29]  Rainer Storn,et al.  Differential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous Spaces , 1997, J. Glob. Optim..

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

[31]  Zhen Yang,et al.  Structure control classification and optimization model of hollow carbon nanosphere core polymer particle based on improved differential evolution support vector machine , 2013 .

[32]  Yusin Lee,et al.  An optimization heuristic for the berth scheduling problem , 2009, Eur. J. Oper. Res..

[33]  Vinicius Veloso de Melo,et al.  Investigating Multi-View Differential Evolution for solving constrained engineering design problems , 2013, Expert Syst. Appl..

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