Eş zamanlı rıhtım atama ve vinç atama problemi

Effective container terminal management is becoming more important since sea transportation constitutes over 80% of all global freight transportation by volume. Berth allocation and quay crane assignment constitute two important operations whose enhancements lead to improved service levels at container terminals. In this thesis, we address the problem of reducing the service time of vessels and improving quay crane assignments. We develop a bi-objective integer linear programming model to solve berth allocation (BAP) and quay crane assignment (QCAP) problems simultaneously. We assume a discrete berth structure and dynamic vessel arrivals. The first objective of our model is to minimize the total service time of vessels (waiting plus handling times). The second objective is to minimize the number of quay crane setups. We conduct computational experiments to evaluate the effectiveness of the model by using real data obtained from the Port of Izmir Container Terminal. For both objectives, the solutions obtained from our model are considerably better than the solutions implemented at the terminal. We obtain Pareto optimal solution sets in an attempt to examine the interplay between the two objective functions.