Paper Info
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.
Year
DOI
Venue
2017
10.1007/978-3-319-66158-2_27
PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING (CP 2017)
Field
DocType
Volume
Mathematical optimization,Vehicle routing problem,Compatibility (mechanics),Computer science,Constraint programming,Neighbourhood (mathematics),Solver
Conference
10416
ISSN
Citations 
PageRank 
0302-9743
1
0.36
References 
Authors
15
2
Name
Order
Citations
PageRank
Tommaso Urli1798.66
Philip Kilby21179.89