@inproceedings{ecac6bc4d9434394a4b2ac04e6e83f58,
title = "Constraint-based fleet design optimisation for multi-compartment split-delivery rich vehicle routing",
abstract = "We describe a large neighbourhood search (LNS) solver based on a constraint programming (CP) model for a real-world rich vehicle routing problem with compartments arising in the context of fuel delivery. Our solver supports both single-day and multi-day scenarios and a variety of real-world aspects including time window constraints, compatibility constraints, and split deliveries. It can be used both to plan the daily delivery operations, and to inform decisions on the long-term fleet composition. We show experimentally the viability of our approach.",
author = "Tommaso Urli and Philip Kilby",
note = "Publisher Copyright: {\textcopyright} Springer International Publishing AG 2017.; 23rd International Conference on the Principles and Practice of Constraint Programming, CP 2017 ; Conference date: 28-08-2017 Through 01-09-2017",
year = "2017",
doi = "10.1007/978-3-319-66158-2_27",
language = "English",
isbn = "9783319661575",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "414--430",
editor = "J.Christopher Beck",
booktitle = "Principles and Practice of Constraint Programming - 23rd International Conference CP 2017, Proceedings",
address = "Germany",
}