The berth allocation and quay crane assignment problem using a CP approach

Stéphane Zampelli, Yannis Vergados, Rowan Van Schaeren, Wout Dullaert, Birger Raa

Research output: Chapter in Book / Report / Conference proceedingConference contributionAcademicpeer-review

Abstract

This paper considers the combination of berth and crane allocation problems in container terminals. We propose a novel approach based on constraint programming which is able to model many realistic operational constraints. The costs for berth allocation, crane allocation, time windows, breaks and transition times during gang movements are optimized simultaneously. The model is based on a resource view where gangs are consumed by vessel activities. Side constraints are added independently around this core model. The model is richer than the state of the art in the operations research community. Experiments show that the model produces solutions with a cost gap of 1/10 (7,8%) to 1/5 (18,8%) compared to an ideal operational setting where operational constraints are ignored.

Original languageEnglish
Title of host publicationPrinciples and Practice of Constraint Programming - 19th International Conference, CP 2013, Proceedings
Pages880-896
Number of pages17
Volume8124 LNCS
DOIs
Publication statusPublished - 2013
Event19th International Conference on Principles and Practice of Constraint Programming, CP 2013 - Uppsala, Sweden
Duration: 16 Sep 201320 Sep 2013

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8124 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Conference

Conference19th International Conference on Principles and Practice of Constraint Programming, CP 2013
CountrySweden
CityUppsala
Period16/09/1320/09/13

Keywords

  • berth allocation
  • constraint programming
  • containers
  • crane assignment
  • terminal

Fingerprint Dive into the research topics of 'The berth allocation and quay crane assignment problem using a CP approach'. Together they form a unique fingerprint.

Cite this