Optimization and public transport tendering: a case study in Southern Italy.
Adaptive large neighbourhood search
Bus service
Districting
Graph partitioning
Mathematical programming
Transport cost
Journal
Public transport (Heidelberg, Germany)
ISSN: 1613-7159
Titre abrégé: Public Transp
Pays: Germany
ID NLM: 9918769385806676
Informations de publication
Date de publication:
11 Apr 2023
11 Apr 2023
Historique:
accepted:
02
02
2023
medline:
16
4
2024
pubmed:
16
4
2024
entrez:
16
4
2024
Statut:
aheadofprint
Résumé
This 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.
Identifiants
pubmed: 38625197
doi: 10.1007/s12469-023-00324-9
pii: 324
pmc: PMC10107591
doi:
Types de publication
Journal Article
Langues
eng
Pagination
1-23Informations de copyright
© The Author(s) 2023.