Line planning and passenger routing problem with application to the Quito transportation system (Q2073473)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Line planning and passenger routing problem with application to the Quito transportation system |
scientific article; zbMATH DE number 7468382
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Line planning and passenger routing problem with application to the Quito transportation system |
scientific article; zbMATH DE number 7468382 |
Statements
Line planning and passenger routing problem with application to the Quito transportation system (English)
0 references
2 February 2022
0 references
Summary: 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.
0 references
public transport optimisation
0 references
line planning problem
0 references
LPP passenger routing
0 references
computational complexity
0 references
0.8855491280555725
0 references
0.8709964752197266
0 references
0.8363568186759949
0 references
0.836293637752533
0 references