Efficient algorithms for the multi-period line planning problem in public transportation

Şahin, Güvenç and Ahmadi Digehsara, Amin and Borndörfer, Ralf (2021) Efficient algorithms for the multi-period line planning problem in public transportation. In: 21st Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2021, Virtual, Lisbon

Full text not available from this repository. (Request a copy)


In order to plan and schedule a demand-responsive public transportation system, both temporal and spatial changes in demand should be taken into account even at the line planning stage. We study the multi-period line planning problem with integrated decisions regarding dynamic allocation of vehicles among the lines. Given the NP-hard nature of the line planning problem, the multi-period version is clearly difficult to solve for large public transit networks even with advanced solvers. It becomes necessary to develop algorithms that are capable of solving even the very-large instances in reasonable time. For instances which belong to real public transit networks, we present results of a heuristic local branching algorithm and an exact approach based on constraint propagation.
Item Type: Papers in Conference Proceedings
Uncontrolled Keywords: Constraint propagation; Line planning; Local branching; Multi-period planning; Public transportation
Divisions: Faculty of Engineering and Natural Sciences
Depositing User: Güvenç Şahin
Date Deposited: 27 Aug 2022 23:14
Last Modified: 27 Aug 2022 23:14
URI: https://research.sabanciuniv.edu/id/eprint/43836

Actions (login required)

View Item
View Item