Dinamik rıhtım atama ve rıhtım vinci çizelgeleme probleminin benzetim optimizasyonu yoluyla eş zamanlı çözümü

This dissertation proposes a simulation optimization-based solution approach for the integrated Berth Allocation and Quay Crane Scheduling Problems (BAP&QCSP) with multi-quay hybrid berth layout, dynamic arrivals of vessels, stochastic handling times and non-crossing constraints of quay cranes. This solution approach integrates the Simulated Annealing (SA) based search procedure with the simulation model of a real-world inspired container terminal. The development of this solution approach consists of four phases; In the first phase, a conflict free quay crane scheduling algorithm for stochastic handling times is proposed. In the second phase, a general parametric simulation model which represents the seaside operations of a typical container terminal is built by including most of the realistic features of a port. Then, in the third phase, a simulated annealing-based simulation optimization procedure is proposed to minimize the completion time for handling operations of the last vessel in a container terminal (i.e., makespan). In order to validate the proposed simulation optimization procedure, in the fourth phase, randomly generated ten small-sized deterministic problems are solved by both mathematical programming model and the proposed simulation optimization procedure. After validating our approach, the proposed simulation optimization procedure is applied to three different real-world inspired sample container terminals. 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.