Computational geometry in C
Solving continuous location-districting problems with Voronoi diagrams
Computers and Operations Research
Location of infrastructure in urban railway networks
Computers and Operations Research
An integrated methodology for the rapid transit network design problem
ATMOS'04 Proceedings of the 4th international Dagstuhl, ATMOS conference on Algorithmic approaches for transportation modeling, optimization, and systems
Optimal Location of Railway Stations: The Lisbon-Porto High-Speed Rail Line
Transportation Science
Rapid transit network design for optimal cost and origin-destination demand capture
Computers and Operations Research
| Hi-index | 0.01 |
When the alignment of a new line or section of a line of a rapid transit system has already been designed, the problem of locating stations arises. One of the measures used to predict the future utilization of the line is the coverage provided by the stations. In this paper the problem of locating a prefixed number of stations so that the weighted coverage will be maximized is considered. To evaluate the coverage of each station an estimation of the street network metric and the triangulations of the census tracts are used. Finally, a longest path type algorithm over an acyclic graph is devised in order to maximize the objective function, in which it was necessary to approximately determine the catchment area for each station.