Geoscience Reference
In-Depth Information
Jaramillo 2009 ), genetic algorithms (Wang and Lin 2010 ) and simulated annealing
(Kemanshani et al. 2010 ). Line configuration with assignment of passengers is
studied in Guan et al. ( 2006 ). Finally, a recent line of research deals with network
robustness aspects. Several ways of treating robustness have been studied: through
the application of game theory (Laporte et al. 2010 ), by providing alternative routes
to be used in case of a disruption (Laporte et al. 2011 ), through the concept of
recoverable robustness (Cadarso and Marín 2012 ), and by the application of a
GRASP to infrastructure railway network design problem (García-Archilla et al.
2013 ).
22.4
Location of Stations
The problem of locating stations is different in the case of locating a network from
scratch than in the case of extending an already existing network. In the first case,
several locations attract large volume of passengers and are obvious candidates for
stations. The remaining stations must then be located with the help of analytical
tools. Assuming that the alignments of the network are given, the problem of
efficiently locating the stations arises. The first objective for the community and
one of the most important ones for the operating company is to attract as many
travelers as possible. To this end, in technical projects the population living in a
circle centered at each station is used as an approximation. However, since walking
distances are not Euclidean, this is a rough measure for the station attractiveness.
In their paper, Laporte et al. ( 2002 ) use census tracts coupled with information
on population density to estimate the actual walking distances. Different levels of
attraction are applied in order to obtain a better estimation of the population covered
(see Fig. 22.3 ). For each given location of the stations in a corridor, line coverage is
subsequently defined. In that paper, given a discrete set of potential sites for stations,
optimal locations are obtained by maximizing the line coverage with the help of an
ad hoc defined acyclic graph and a longest-path algorithm.
census tract
alignment
Fig. 22.3 Concentric
catchment areas around a
station intersecting with a
census tract
Search WWH ::




Custom Search