Titel
A matheuristic for a multimodal long haul routing problem
Autor*in
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.
Stichwort
Multimodal transportationColumn generationIterated local search
Objekt-Typ
Sprache
Englisch [eng]
Persistent identifier
Erschienen in
Titel
EURO Journal on Transportation and Logistics
Publication
Springer Nature
Erscheinungsdatum
2018
Zugänglichkeit
Rechte
Rechteangabe
© The Author(s) 2018
Universität Wien | Universitätsring 1 | 1010 Wien | T
+43-1-4277-0