A Hybrid GA with Variable Quay Crane Assignment for Solving Berth Allocation Problem and Quay Crane Assignment Problem Simultaneously

Container terminals help countries to sustain their economic development. Improving the operational efficiency in a container terminal is important. In past research, genetic algorithms (GAs) have been widely used to cope with seaside operational problems, including the berth allocation problem (BAP) and quay crane assignment problem (QCAP) individually or simultaneously. However, most GA approaches in past studies were dedicated to generate time-invariant QC assignment that does not adjust QCs assigned to a ship. This may underutilize available QC capacity. In this research, three hybrid GAs (HGAs) have been proposed to deal with the dynamic and discrete BAP (DDBAP) and the dynamic QCAP (DQCAP) simultaneously. The three HGAs supports variable QC assignment in which QCs assigned to a ship can be further adjusted. The three HGAs employ the same crossover operator but a different mutation operator and a two-stage procedure is used. In the first stage, these HGAs can generate a BAP solution and a QCAP solution that is time-invariant. The time-invariant QC assignment solution is then further transformed into a variable one in the second stage. Experiments have been conducted to investigate the effects of the three HGA and the results showed that these HGAs outperformed traditional GAs in terms of fitness value. In particular, the HGA3 with Thoros mutation operator had the best performance.