An integrated container terminal scheduling problem with different-berth sizes via multiobjective hydrologic cycle optimization

Integrated berth and quay crane allocation problem (BQCAP) are two essential seaside operational problems in container terminal scheduling. Most existing works consider only one objective on operation and partition of quay into berths of the same lengths. In this study, BQCAP is modeled in a multiobjective setting that aims to minimize total equipment used and overall operational time and the quay is partitioned into berths of different lengths, to make the model practical in the real-world and complex quay layout setting. To solve the new BQCAP efficiently, a multiobjective hydrologic cycle optimization algorithm is devised considering problem characteristics and historical Pareto-optimal solutions. Specifically, the quay crane of the large vessel in all Pareto-optimal solutions is rearranged to increase the chance of finding a good solution. Besides, worse solutions are probabilistic retained to maintain diversity. The proposed algorithm is applied to a real-world terminal scheduling problem with different sizes from a container terminal company. Experimental results show that our algorithm generally outperforms the other well-known peer algorithms and its variants on solving BQCAP, especially in finding the Pareto-optimal solutions range.

Automated summary

This study investigates the integrated berth and quay crane allocation problem (BQCAP) and proposes a multiobjective model to solve these problems. The proposed algorithm is applied to a real-world case and outperforms other existing algorithms in solving BQCAP.