Simulated annealing based simulation optimization method for solving integrated berth allocation and quay crane scheduling problems

Tasoglu G., Yıldız G.

SIMULATION MODELLING PRACTICE AND THEORY, cilt.97, 2019 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 97
  • Basım Tarihi: 2019
  • Doi Numarası: 10.1016/j.simpat.2019.101948
  • Dergi Adı: SIMULATION MODELLING PRACTICE AND THEORY
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Anahtar Kelimeler: Berth allocation problem, Quay crane scheduling problem, Simulation optimization, Simulated annealing, KEY GENETIC ALGORITHM, ASSIGNMENT, OPERATIONS, TRANSSHIPMENT, HEURISTICS
  • Dokuz Eylül Üniversitesi Adresli: Evet

Özet

This paper proposes a simulation optimization based solution approach for the integrated Berth Allocation and Quay Crane Scheduling Problems (BAP and QCSP) considering simultaneously, for the first time, multi-quay hybrid berth layout, dynamic arrivals of vessels, stochastic handling times and non-crossing constraints of quay cranes. Initially, a Conflict-Free Quay Crane Scheduling Algorithm is proposed considering stochastic handling times. Then, a general parametric simulation model which represents the seaside operations of a typical container terminal is built. Finally, a Simulated Annealing based optimization procedure is integrated with this parametric simulation model to minimize the latest vessel departure time (i.e., makespan). The proposed simulation optimization procedure is applied to a real world inspired case problem. The results revealed that the proposed simulation optimization procedure can be used to solve large-sized real-port BAPs and QCSPs for the objective of minimizing makespan. Furthermore, the output of this simulation optimization procedure gives the decision maker the estimated berthing/unberthing times, berthing locations and quay crane schedules for each vessel for the most probable scenario.