Integrated Berth Allocation and Quay Crane Assignment Problem: Set partitioning models and computational results. (September 2015)

• Record Type: Journal Article
• Authors: Iris, Çağatay; Pacino, Dario; Ropke, Stefan; Larsen, Allan
• Is Part Of: Transportation research. Volume 81(2015)
• Page Start: 75
• Page End: 97
• Publication Date: 2015-09
• Subjects: Container terminal operations -- Berth allocation problem -- Quay crane assignment -- Integer programming -- Set partitioning -- Column reduction; Logistics -- Periodicals; Transportation -- Periodicals; 388.011
• DOI: 10.1016/j.tre.2015.06.008
• Languages: English
• ISSNs: 1366-5545

Abstract

Highlights: Novel set partitioning formulations for Berth Allocation and Quay Crane Assignment Problem. Various column reduction techniques for GSPP models. Effects of time-variant/invariant quay crane allocation policies. Analysis of different discretization methods for continuous berthing space. Abstract: Most of the operational problems in container terminals are strongly interconnected. In this paper, we study the integrated Berth Allocation and Quay Crane Assignment Problem in seaport container terminals. We will extend the current state-of-the-art by proposing novel set partitioning models. To improve the performance of the set partitioning formulations, a number of variable reduction techniques are proposed. Furthermore, we analyze the effects of different discretization schemes and the impact of using a time-variant/invariant quay crane allocation policy. Computational experiments show that the proposed models significantly improve the benchmark solutions of the current state-of-art optimal approaches.