Abstract
AbstractThis article presents a multi-start heuristic approach to a design problem motivated by a real-world application in the Italian transport system. Specifically, it focuses on the problem of designing optimal lots in the public transport organization. In defining lots (in terms of number, size, and boundaries) both cost and service level have to be considered. Under certain assumptions, we model the problem as a graph partitioning problem and consider the same performance measure indicated by the relevant decree-law enacted by the Italian Ministry of Transport. The multi-start algorithm proposed for individuating high-quality solutions for the problem uses adaptive large neighbourhood search. The results of a computational study based on real data from a region in Southern Italy are reported.
Funder
Università della Calabria
Publisher
Springer Science and Business Media LLC
Subject
Management Science and Operations Research,Mechanical Engineering,Transportation,Information Systems
Reference28 articles.
1. Bakkehaug R, Rakke JG, Fagerholt K, Laporte G (2016) An adaptive large neighborhood search heuristic for fleet deployment problems with voyage separation requirements. Transp Res Part C Emerg Technol 70:129–141
2. Bichot C-E, Siarry P (eds) (2011) Graph partitioning. ISTE Ltd, London
3. Cambini C, Filippini M (2003) Competitive tendering and optimal size in the regional bus transportation industry: an example from Italy. Ann Public Coop Econ 74(1):163–182
4. Casado-Díaz JM, Coombes M (2011) The delineation of 21st century local labour market areas: a critical review and a research agenda. Bol Asoc Geogr Esp 57:7–32
5. De Maio A, Laganà D, Musmanno R, Vocaturo F (2021) Arc routing under uncertainty: introduction and literature review. Comput Oper Res 135:105442