Principles and Practice of Constraint Programming

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

Research output: Book / ReportBookAcademicpeer-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. © 2013 Springer-Verlag.
Original languageEnglish
PublisherSpringer LNCS
Number of pages17
Volume8124
ISBN (Print)978-3-642-40626-3
DOIs
Publication statusPublished - 2013

Fingerprint

Cranes
Operations research
Containers
Costs
Experiments

Cite this

Zampelli, S., Vergados, Y., Van Schaeren, R., Dullaert, W., & Raa, B. (2013). Principles and Practice of Constraint Programming. Springer LNCS. https://doi.org/10.1007/978-3-642-40627-0
Zampelli, Stéphane ; Vergados, Yannis ; Van Schaeren, Rowan ; Dullaert, Wout ; Raa, Birger. / Principles and Practice of Constraint Programming. Springer LNCS, 2013. 17 p.
@book{53abb4f25bf846488b909b2a5bf87f28,
title = "Principles and Practice of Constraint Programming",
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. {\circledC} 2013 Springer-Verlag.",
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",
language = "English",
isbn = "978-3-642-40626-3",
volume = "8124",
publisher = "Springer LNCS",

}

Zampelli, S, Vergados, Y, Van Schaeren, R, Dullaert, W & Raa, B 2013, Principles and Practice of Constraint Programming. vol. 8124, Springer LNCS. https://doi.org/10.1007/978-3-642-40627-0

Principles and Practice of Constraint Programming. / Zampelli, Stéphane; Vergados, Yannis; Van Schaeren, Rowan; Dullaert, Wout; Raa, Birger.

Springer LNCS, 2013. 17 p.

Research output: Book / ReportBookAcademicpeer-review

TY - BOOK

T1 - Principles and Practice of Constraint Programming

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. © 2013 Springer-Verlag.

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. © 2013 Springer-Verlag.

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

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

M3 - Book

SN - 978-3-642-40626-3

VL - 8124

BT - Principles and Practice of Constraint Programming

PB - Springer LNCS

ER -

Zampelli S, Vergados Y, Van Schaeren R, Dullaert W, Raa B. Principles and Practice of Constraint Programming. Springer LNCS, 2013. 17 p. https://doi.org/10.1007/978-3-642-40627-0