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

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.