Research on quay crane scheduling problem by hybrid genetic algorithm

With the development of the global business and logisticspsila a container terminal (CT) system becomes more and more busy. Therefore, the available resources in the sea port get scarcer than before. In order to increase the operating efficiency of CT system, the resources planning problem has become a critical issue in the fields of operations research and logistics. In this paper, we introduce the berth allocation planning problem and formulate a mathematical model considered each berth for container ship with different number of quay cranes (QCs). In order to solve this quay crane scheduling in berth allocation planning problem, we also propose a hybrid genetic algorithm (HGA) approach with the priority-based encoding method. To demonstrate the effectiveness of proposed HGA approach, numerical experiment is carried out, and the best solution to the problem is obtained.