Integrated discrete berth allocation and quay crane scheduling in port container terminals

Abstract

The integrated discrete berth allocation and quay crane scheduling problem studied in this article considers the relationship between them. This article provides a mixed integer programming model for the studied problem that is NP-complete in nature. A genetic algorithm is proposed to obtain near optimal solutions. Computational experiments are conducted to examine the proposed solution algorithm. The computational results show that the proposed genetic algorithm is effective and efficient in solving the studied problem. © 2010 Taylor & Francis.