Multiship Crane Sequencing with Yard Congestion Constraints

Authors:
Shawn Choo;Diego Klabjan;David Simchi-Levi
Affiliations:
PSA International Pte Ltd, PSA Singapore Terminals, Singapore;Department of Industrial and Management Sciences, Northwestern University, Evanston, Illinois 60208;Department of Civil and Environmental Engineering, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139
Venue:
Transportation Science
Year:
2010

Citing 5
Cited 3

Branch-And-Price: Column Generation for Solving Huge Integer Programs

Operations Research
An Optimal Routing Algorithm for a Transfer Crane in Port Container Terminals

Transportation Science
Interblock Crane Deployment in Container Terminals

Transportation Science
A decision support system for operations in a container terminal

Decision Support Systems
Selected Topics in Column Generation

Operations Research

Modeling and solving rich quay crane scheduling problems

Computers and Operations Research
A Framework for Integrated Berth Allocation and Crane Operations Planning in Seaport Container Terminals

Transportation Science
An Exact Algorithm for the Integrated Planning of Berth Allocation and Quay Crane Assignment

Transportation Science

Quantified Score

Hi-index	0.00

Visualization

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.