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 multiday multi-commodity split delivery capacitated vehicle routing problem.
| Original language | English |
|---|---|
| Pages (from-to) | 4185-4189 |
| Number of pages | 5 |
| Journal | IJCAI International Joint Conference on Artificial Intelligence |
| Volume | 2016-January |
| Publication status | Published - 2016 |
| Event | 25th International Joint Conference on Artificial Intelligence, IJCAI 2016 - New York, United States Duration: 9 Jul 2016 → 15 Jul 2016 |