Models and algorithms for the optimal design of bus routes in public transportation systems
In this thesis we study models and algorithms for the optimal design of bus routes in urban public transportation systems. The problem known as TNDP (Transit Network Design Problem) consists in determining the number and itinerary of public transportation lines and their corresponding frequencies, i...
Salvato in:
| Autore principale: | |
|---|---|
| Natura: | doctoralThesis |
| Lingua: | inglese |
| Pubblicazione: |
2011
|
| Soggetti: | |
| Accesso online: | http://hdl.handle.net/20.500.12008/2969 |
| Tags: |
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| Riassunto: | In this thesis we study models and algorithms for the optimal design of bus routes in urban public transportation systems. The problem known as TNDP (Transit Network Design Problem) consists in determining the number and itinerary of public transportation lines and their corresponding frequencies, in terms of a given infrastructure of streets and stops. The solutions should satisfy a given origin-destination demand and should take into account the interests of users and operators and a given set of physical, policy and budgetary constraints. We propose an explicit mixed integer linear programming formulation which incorporates the waiting time and the existence of multiple lines in the behavior of the passengers.Then, we discuss the impact in the structure of the model of adding transfer, infrastructure and bus capacity constraints. We apply the model (using a standard solver) to very small test cases as well as to a real one, related to a small-sized city comprising 13 bus lines. In order to deal with cases of larger sizes, we propose a greedy constructive algorithm that produces a set of routes that are convenient for both users and operators, taking into account constraints related to transfers. By using a real test case, we show that the proposed algorithm improves results from the state of the art. |
|---|