Matheuristic approach for an integrated quay crane, yard truck and yard crane scheduling problems

Abstract

A highly significant issue at container terminals, the integrated Quay Crane, Yard Truck, and Yard Crane scheduling problem deals with optimizing and synchronizing all substantial activities and scheduling port equipment. This thesis will consider the integrated container unloading process and Tan Cang - Cat Lai Terminal case study to address the corresponding scheduling problem and reduce the maximum completion time. MIP Python is used to formulate the problem and benchmark it in small-sized challenges. In addition, the discrete version of the algorithm serves as the foundation for Matheuristics. The case study data sets will be utilized to execute the coding under the Matheuristics methodology using MIP Python. The results will be benchmarked against the earlier method to gauge how well they work. The findings show that both approaches successfully solve the issue while retaining their benefits. Since MIP Python can manage issues with such accuracy in selected small-size examples, the Matheuristics technique may be used successfully for big-sized problems.