Multiobjective hybrid genetic algorithm for quay crane scheduling in berth allocation planning

摘要

With the development of the global business and logistics under the internet environment a Container Terminal (CT) system becomes more and more busy. Therefore, the available resources in the seaport 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 (BAP) problem and formulate a multiobjective mathematical model considering each berth for container ship with different number of Quay Cranes (QCs) and balance of QC's workload. In order to solve this QC scheduling in BAP problem, we propose a multiobjective hybrid Genetic Algorithm (mohGA) approach with a priority-based encoding method. To demonstrate the effectiveness of proposed mohGA approach, numerical experiment is carried out and the best solution to the problem is obtained.