Evolving local search heuristics for the integrated berth allocation and quay crane assignment problem

摘要

Water Transportation is the cheapest transportation mode, which allows the transfer of very large volumes of cargo between continents. One of the most important types of ships used to transfer goods are the Container Ships, therefore, containerized trade volume is rapidly increasing. This has opened a number of challenging combinatorial optimization problems in container terminals. This paper focuses on the integrated problem Berth Allocation and Quay Crane Assignment Problem (BQ-CAP), which occur while planning incoming vessels in container terminals. We provide a Genetic Programming (GP) approach to evolve effective and robust composite dispatching rules (CDRs) to solve the problem and present a comparative study with the current state-of-art optimal approaches. The Computational results disclose the effectiveness of the presented approach.