Sciweavers

Share
CONSTRAINTS
2016

Fleet design optimisation from historical data using constraint programming and large neighbourhood search

4 years 4 months ago
Fleet design optimisation from historical data using constraint programming and large neighbourhood search
Abstract We present an original approach to compute efficient mid-term fleet configurations, at the request of a Queensland-based long-haul trucking carrier. Our approach considers one year’s worth of demand data, and employs a constraint programming (CP) model and an adaptive large neighbourhood search (LNS) scheme to solve the underlying multi-day multi-commodity split delivery capacitated vehicle routing problem. Our solver is able to provide the decision maker with a set of Pareto-equivalent fleet setups trading off fleet efficiency against the likelihood of requiring on-hire vehicles and drivers. Moreover, the same solver can be used to solve the daily loading and routing problem. We carry out an extensive experimental analysis, comparing our approach with an equivalent mixed integer programming (MIP) formulation, and we show that our approach is a sound methodology to provide decision support for the mid- and short-term decisions of a long-haul carrier. Keywords Vehicle Ro...
Philip Kilby, Tommaso Urli
Added 31 Mar 2016
Updated 31 Mar 2016
Type Journal
Year 2016
Where CONSTRAINTS
Authors Philip Kilby, Tommaso Urli
Comments (0)
books