S. Muñoz López
Given the station locations of a rapid transit network and the links between them, in this work we tackle the problem of designing the set of lines for the network, in such a way that the number of lines that go to each station location is as small as possible. We propose a heuristic method that attempts to maximize an estimation of the total number of trips through the rapid transit network. For this aim, we consider an expanded network that will make it possible to take into account the times for the transfers that should be made by the users to arrive at their destinations. We also report some computational experience on randomly generated instances.
Palabras clave: Line designing, rapid transit network, transfer, heuristic method
Programado
X04 Pausa Café. Sesión Posters. Reunión TEST - Edificio 1
7 de septiembre de 2016 11:40
Edificio 1