Name
Title | ||
|---|---|---|
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 yearu0027s worth of demand data, and employs a constraint programming (CP) model and an adaptive large neighbourhood search (LNS) scheme to solve the underlying multiday multi-commodity split delivery capacitated vehicle routing problem. |
Year | DOI | Venue |
|---|---|---|
2016 | https://doi.org/10.1007/s10601-015-9203-0 | Constraints |
Keywords | Field | DocType |
Vehicle routing problem,Fleet size and mix,Large neighbourhood search,Mixed integer programming,Constraint programming,Pre-processing | Vehicle routing problem,Mathematical optimization,Constraint programming,Decision support system,Neighbourhood (mathematics),Integer programming,Solver,Mathematics,Decision maker | Conference |
Volume | Issue | ISSN |
21 | 1 | 1383-7133 |
Citations | PageRank | References |
3 | 0.40 | 10 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Philip Kilby | 1 | 117 | 9.89 |
| Tommaso Urli | 2 | 79 | 8.66 |