Simulated annealing based simulation optimization method for solving integrated berth allocation and quay crane scheduling problems
| dc.contributor.author | Tasoglu, G | |
| dc.contributor.author | Yildiz, G | |
| dc.date.accessioned | 2025-04-10T10:31:30Z | |
| dc.date.available | 2025-04-10T10:31:30Z | |
| dc.description.abstract | 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. | |
| dc.identifier.e-issn | 1878-1462 | |
| dc.identifier.issn | 1569-190X | |
| dc.identifier.uri | http://hdl.handle.net/20.500.14701/37977 | |
| dc.language.iso | English | |
| dc.title | Simulated annealing based simulation optimization method for solving integrated berth allocation and quay crane scheduling problems | |
| dc.type | Article |