Abstract | ||
---|---|---|
Given a railway network together with information on the population and their use of the railway infrastructure, we are considering the effects of introducing new train stops in the existing railway network. One effect concerns the accessibility of the railway infrastructure to the population, measured in how far people live from their nearest train stop. The second effect we study is the change in travel time for the railway customers that is induced by new train stops. Based on these two models, we introduce two combinatorial optimization problems and give NP-hardness results for them. We suggest an algorithmic approach for the model based on travel time and present a real-world application with its first experimental results. |
Year | DOI | Venue |
---|---|---|
2001 | 10.1016/S1571-0661(04)00162-8 | Electronic Notes in Theoretical Computer Science |
Field | DocType | Volume |
Population,Combinatorial optimization problem,Simulation,Computer science,Operations research,Theoretical computer science,Travel time | Journal | 50 |
Issue | ISSN | Citations |
1 | 1571-0661 | 26 |
PageRank | References | Authors |
2.68 | 0 | 5 |
Name | Order | Citations | PageRank |
---|---|---|---|
Horst W. Hamacher | 1 | 562 | 57.39 |
Annegret Liebers | 2 | 85 | 8.18 |
Anita Schöbel | 3 | 791 | 72.30 |
Dorothea Wagner | 4 | 2362 | 221.67 |
Frank Wagner | 5 | 27 | 3.13 |