A matheuristic for a multimodal long haul routing problem

Autor(en)
David Wolfinger, Fabien Tricoire, Karl F. Dörner
Abstrakt

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(en)
Institut für Business Decisions and Analytics, Forschungsverbund Data Science
Externe Organisation(en)
Johannes Kepler Universität Linz
Journal
EURO Journal on Transportation and Logistics
Band
8
Seiten
397–433
Anzahl der Seiten
37
ISSN
2192-4376
DOI
https://doi.org/10.1007/s13676-018-0131-1
Publikationsdatum
08-2018
Peer-reviewed
Ja
ÖFOS 2012
502017 Logistik
Schlagwörter
ASJC Scopus Sachgebiete
Transportation, Modelling and Simulation, Management Science and Operations Research
Link zum Portal
https://ucris.univie.ac.at/portal/de/publications/a-matheuristic-for-a-multimodal-long-haul-routing-problem(eb8bd7c4-5160-4d8a-a33e-bde37917bb88).html