Integrated quay crane and yard truck scheduling problem at port of Tripoli-Lebanon

The scheduling problem is one of the most important operation in maritime ports. In this study we solved the scheduling problem for a single quay crane and multiple yard trucks in port of Tripoli-Lebanon. In a previous study we proposed two exact methods for this problem but we faced a problem for large instances in CPU time. For this reason, in this paper we developed a heuristic method (genetic algorithm) to obtain near optimal solution with an acceptable CPU time. The main objective of this paper is to minimize the completion time of all containers from the container vessel to its storage location and to have good results compared with real results in the port of Tripoli-Lebanon.