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.
|Journal||Transportation Research. Part E: Logistics and Transportation Review|
|Publication status||Published - 2017|
- Business and International Management
- Management Science and Operations Research
Iris, C., Pacino, D., & Røpke, S. (2017). Improved formulations and an Adaptive Large Neighborhood Search heuristic for the integrated berth allocation and quay crane assignment problem. Transportation Research. Part E: Logistics and Transportation Review, 105, 123-147. https://doi.org/10.1016/j.tre.2017.06.013