Improving customer proximity to railway stations
We consider problems of (new) station placement along (existing) railway tracks, so as to increase the number of users. We prove that, in spite of the NP-hardness for the general version, some interesting cases can be solved exactly by a suitable dynamic programming approach. For variants in which we also take into account existing connections between cities and railway tracks (streets, buses, etc.) we instead show some hardness results.
|Organisation||School of Computer Science|
Kranakis, E, Penna, P. (Paolo), Schlude, K. (Konrad), Taylor, D.S. (David Scot), & Widmayer, P. (Peter). (2003). Improving customer proximity to railway stations.