Abstract
An important phase in the strategic planning process of a public transportation system is the line planning problem. It consists in determining a set of lines together with their frequencies such that a given transportation demand is satisfied. In this work an integer programming model for the integrated line planning and passenger routing problem is proposed. The model aims to improve the benefit and comfort of the passengers, namely maximising direct connection trips, and it also proposes to minimise the total cost for the operator. Restricted to linear transportation networks that are relevant for the Quito public transportation system, NP-hardness results and polynomial algorithms for special cases are presented. Performance of heuristic procedures for solving the integrated problem is evaluated over real-world and simulated instances.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call