Highlights We introduce the Multimodal Hub Network Design Problem with Flexible Routes. The routes are flexible in the sense that they may or may not contain hubs on them. Different transport technologies are chosen to operate the routes. Scale economies stem from the transport technology chosen to operate the routes. Benchmark instances are solved by a MIP and two ALNS based metaheuristics.
Abstract This paper introduces a multimodal hub network design problem with flexible routes. Routes are flexible in the sense that they may contain a mix of hub and non-hub nodes. Nonetheless, commodity transfers can only occur at hubs, while transportation costs are flow-dependent, i.e., scale economies stem from the transport technology chosen to operate the routes. We propose a mixed integer mathematical program, and two metaheuristics based on the adaptive large neighborhood search paradigm to solve the problem. Extensive computational experiments show the performance of the formulation and of the devised algorithms in solving benchmark instances with up to 50 nodes.
Multimodal hub network design with flexible routes
2020-11-29
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
Discovering multimodal routes using connection patterns
IEEE | 2016
|Park-and-Ride Choice Behavior in a Multimodal Network with Overlapping Routes
Transportation Research Record | 2020
|METHODOLOGY FOR EXPERT EVALUATION OF MULTIMODAL CARGO TRANSPORTATION ROUTES
DOAJ | 2021
|Multimodal network design problems
British Library Conference Proceedings | 2000
|