A matheuristic for a multimodal long haul routing problem
- Author(s)
- David Wolfinger, Fabien Tricoire, Karl F. Dörner
- Abstract
We address a planning problem faced by logistics service providers who transport freight over long distances. Given a set of transportation requests, where the origin and the destination of each request are located far apart from each other, a logistics service provider must find feasible vehicle routes to fulfil those requests at minimum cost. When transporting freight over long distances, multimodal transportation provides a viable alternative to traditional unimodal road transportation. We introduce this new problem, which we call the multimodal long haul routing problem (MMLHRP), and present a mathematical formulation for it. Furthermore, we propose a matheuristic, using iterated local search within a column generation framework, for solving the MMLHRP. Results show that large cost savings can be achieved through multimodal transportation compared to unimodal road transportation.
- Organisation(s)
- Department of Business Decisions and Analytics, Research Network Data Science
- External organisation(s)
- Johannes Kepler Universität Linz
- Journal
- EURO Journal on Transportation and Logistics
- Volume
- 8
- Pages
- 397–433
- No. of pages
- 37
- ISSN
- 2192-4376
- DOI
- https://doi.org/10.1007/s13676-018-0131-1
- Publication date
- 08-2018
- Peer reviewed
- Yes
- Austrian Fields of Science 2012
- 502017 Logistics
- Keywords
- ASJC Scopus subject areas
- Transportation, Modelling and Simulation, Management Science and Operations Research
- Portal url
- https://ucris.univie.ac.at/portal/en/publications/a-matheuristic-for-a-multimodal-long-haul-routing-problem(eb8bd7c4-5160-4d8a-a33e-bde37917bb88).html