Improved formulations and an Adaptive Large Neighborhood Search heuristic for the integrated berth allocation and quay crane assignment problem. (September 2017)

• Record Type: Journal Article
• Authors: Iris, Çağatay; Pacino, Dario; Ropke, Stefan
• Is Part Of: Transportation research. Volume 105(2017)
• Page Start: 123
• Page End: 147
• Publication Date: 2017-09
• Subjects: Logistics -- Periodicals; Transportation -- Periodicals; 388.011
• DOI: 10.1016/j.tre.2017.06.013
• Languages: English
• ISSNs: 1366-5545

Abstract

Highlights: Novel valid inequalities, variable fixing methods and properties for the problem. Enhancements which improve a range of formulations and solution methods of the BAP, BACAP, BACASP. An Adaptive Large Neighborhood Search (ALNS) heuristic which outperforms existing state-of-the-art heuristics. New repair operators for ALNS that can be used for many relevant problems. New larger benchmark for the BACAP and extensive tests for instances with different berth and QC utilizations. Abstract: This paper focuses on the integrated berth allocation and quay crane assignment problem in container terminals. We consider the decrease in the marginal productivity of quay cranes and the increase in handling time due to deviation from the desired position. We consider a continuous berth, discretized in small equal-sized sections. A number of enhancements over the state-of-the-art formulation and an Adaptive Large Neighborhood Search (ALNS) heuristic are presented. Computational results reveal that the enhancements improve many of the best-known bounds, and the ALNS outperforms the state-of-the-art heuristics for many instances. We also conduct further analysis on a new larger benchmark.