Volume 45, Number 4, October-December 2011
|Page(s)||315 - 338|
|Published online||19 January 2012|
On designing connected rapid transit networks reducing the number of transfers
Departamento de Estadística e Investigación Operativa, Universidad
Rey Juan Carlos, 28933
Móstoles ( Madrid), Spain
2 Corresponding author. Departamento de Estadística e Investigación Operativa, Facultad de Ciencias Matemáticas, Universidad Complutense de Madrid, 28040 Madrid, Spain
Accepted: 1 December 2011
In this paper we introduce some improvements on an approach that we described elsewhere for solving a modification of the well-known extended rapid transit network design problem. Firstly, we propose an integer programming model for selecting the stations to be constructed and the links between them, in such a way that a connected rapid transit network is obtained. Secondly, we consider a linear 0-1 programming model for determining a route of minimum length in the rapid transit network between certain pairs of locations, and present a greedy heuristic procedure which attempts to minimize an estimation of the total number of transfers that should be made by the users to arrive at their destinations. We also report several computational experiments that show that this procedure can significantly reduce the estimated total number of transfers required for the solutions obtained using our previous approach.
Mathematics Subject Classification: 90B06 / 90B80 / 90C10 / 90C35
Key words: Station and link location / line designing / degree of a node / transfer / greedy heuristic procedure
© EDP Sciences, ROADEF, SMAI, 2012
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.