Multiship Crane Sequencing with Yard Congestion Constraints
Name
Simchi-Levi_Multiship crane.pdf
Size
370.15 KB
Format
Adobe PDF
Checksum (MD5)
eafaae7386e0cdc424516f985e9c7004
Author(s)
Choo, Shawn
Klabjan, Diego
Simchi-Levi, David
Date Issued
December 2009
Journal
Transportation Science
Publisher
Institute for Operations Research and the Management Sciences (INFORMS)
Citation
Choo, S., D. Klabjan, and D. Simchi-Levi. “Multiship Crane Sequencing with Yard Congestion Constraints.” Transportation Science 44.1 (2009): 98–115.
Version
Author's final manuscript
Abstract
Crane sequencing in container terminals determines the order of ship discharging and loading jobs that quay cranes (QCs) perform, so that the duration of a vessel's stay is minimized. The ship's load profile, berthing time, number of available bays, and QCs are considered. More important, clearance and yard congestion constraints need to be included, which, respectively, ensure that a minimum distance between adjacent QCs is observed and yard storage blocks are not overly accessed at any point in time. In sequencing for a single ship, a mixed-integer programming (MIP) model is proposed, and a heuristic approach based on the model is developed that produces good solutions. The model is then reformulated as a generalized set covering problem and solved exactly by branch and price (B&P). For multiship sequencing, the yard congestion constraints are relaxed in the spirit of Lagrangian relaxation, so that the problem decomposes by vessel into smaller subproblems solved by B&P. An efficient primal heuristic is also designed. Computational experiments reveal that large-scale problems can be solved in a reasonable computational time.
MIT Department
Massachusetts Institute of Technology. Department of Civil and Environmental Engineering
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike 3.0
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1287/trsc.1090.0296
