Name
Abstract | ||
|---|---|---|
What is the minimum tour visiting all lines in a subway network? In this paper we study the problem of constructing the shortest tour visiting all lines of a city railway system. This combinatorial optimization problem has links with the classic graph circuit problems and operations research. A broad set of fast algorithms is proposed and evaluated on simulated networks and example cities of the world. We analyze the trade-off between algorithm runtime and solution quality. Time evolution of the trade-off is also captured. Then, the algorithms are tested on a range of instances with diverse features. On the basis of the algorithm performance, measured with various quality indicators, we draw conclusions on the nature of the above combinatorial problem and the tacit assumptions made while designing the algorithms. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1007/s10732-014-9252-3 | Journal of Heuristics |
Keywords | Field | DocType |
Graph cycles,Urban railway,One-pass heuristics,Metaheuristics,Evaluation of heuristics | Graph,Mathematical optimization,Heuristic,Combinatorial optimization problem,Railway system,Artificial intelligence,Mathematics,Metaheuristic | Journal |
Volume | Issue | ISSN |
20 | 5 | 1381-1231 |
Citations | PageRank | References |
0 | 0.34 | 13 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Maciej Drozdowski | 1 | 26 | 2.46 |
| D. Kowalski | 2 | 0 | 0.34 |
| J. Mizgajski | 3 | 8 | 2.28 |
| D. Mokwa | 4 | 5 | 1.19 |
| Grzegorz Pawlak | 5 | 18 | 3.17 |