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

Şahin C., Kuvvetli Y.

APPLIED MATHEMATICAL MODELLING, cilt.40, ss.10679-10688, 2016 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 40
  • Basım Tarihi: 2016
  • Doi Numarası: 10.1016/j.apm.2016.08.017
  • Dergi Adı: APPLIED MATHEMATICAL MODELLING
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.10679-10688
  • Anahtar Kelimeler: Dynamic berth allocation problem, Continuous wharf, Differential evolution algorithm, SCHEDULING PROBLEM, CONTAINER PORT, OPTIMIZATION, SEARCH, MODELS
  • Çukurova Üniversitesi Adresli: Evet

Özet

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. (C) 2016 Elsevier Inc. All rights reserved.