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

Fingerprint

Cranes
Assignment Problem
Container Terminal
Operations research
Model
Constraint Programming
Time Windows
Operations Research
Costs
Vessel
Containers
Resources
Experiment
Experiments

Keywords

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

Cite this

Zampelli, S., Vergados, Y., Van Schaeren, R., Dullaert, W., & Raa, B. (2013). The berth allocation and quay crane assignment problem using a CP approach. In Principles and Practice of Constraint Programming - 19th International Conference, CP 2013, Proceedings (Vol. 8124 LNCS, pp. 880-896). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8124 LNCS). https://doi.org/10.1007/978-3-642-40627-0_64
Zampelli, Stéphane ; Vergados, Yannis ; Van Schaeren, Rowan ; Dullaert, Wout ; Raa, Birger. / The berth allocation and quay crane assignment problem using a CP approach. Principles and Practice of Constraint Programming - 19th International Conference, CP 2013, Proceedings. Vol. 8124 LNCS 2013. pp. 880-896 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{118d6e5b1fdc4fd5b41c9fac1288c3af,
title = "The berth allocation and quay crane assignment problem using a CP approach",
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.",
keywords = "berth allocation, constraint programming, containers, crane assignment, terminal",
author = "St{\'e}phane Zampelli and Yannis Vergados and {Van Schaeren}, Rowan and Wout Dullaert and Birger Raa",
year = "2013",
doi = "10.1007/978-3-642-40627-0_64",
language = "English",
isbn = "9783642406263",
volume = "8124 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "880--896",
booktitle = "Principles and Practice of Constraint Programming - 19th International Conference, CP 2013, Proceedings",

}

Zampelli, S, Vergados, Y, Van Schaeren, R, Dullaert, W & Raa, B 2013, The berth allocation and quay crane assignment problem using a CP approach. in Principles and Practice of Constraint Programming - 19th International Conference, CP 2013, Proceedings. vol. 8124 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 8124 LNCS, pp. 880-896, 19th International Conference on Principles and Practice of Constraint Programming, CP 2013, Uppsala, Sweden, 16/09/13. https://doi.org/10.1007/978-3-642-40627-0_64

The berth allocation and quay crane assignment problem using a CP approach. / Zampelli, Stéphane; Vergados, Yannis; Van Schaeren, Rowan; Dullaert, Wout; Raa, Birger.

Principles and Practice of Constraint Programming - 19th International Conference, CP 2013, Proceedings. Vol. 8124 LNCS 2013. p. 880-896 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8124 LNCS).

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

TY - GEN

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

AU - Zampelli, Stéphane

AU - Vergados, Yannis

AU - Van Schaeren, Rowan

AU - Dullaert, Wout

AU - Raa, Birger

PY - 2013

Y1 - 2013

N2 - 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.

AB - 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.

KW - berth allocation

KW - constraint programming

KW - containers

KW - crane assignment

KW - terminal

UR - http://www.scopus.com/inward/record.url?scp=84885765966&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84885765966&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-40627-0_64

DO - 10.1007/978-3-642-40627-0_64

M3 - Conference contribution

SN - 9783642406263

VL - 8124 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 880

EP - 896

BT - Principles and Practice of Constraint Programming - 19th International Conference, CP 2013, Proceedings

ER -

Zampelli S, Vergados Y, Van Schaeren R, Dullaert W, Raa B. The berth allocation and quay crane assignment problem using a CP approach. In Principles and Practice of Constraint Programming - 19th International Conference, CP 2013, Proceedings. Vol. 8124 LNCS. 2013. p. 880-896. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-40627-0_64