Traffic conflicts at railway junctions are very common, particularly on congested rail lines. While safe passage through the junction is well maintained by the signalling and interlocking systems, minimising the delays imposed on the trains by assigning the right-of-way sequence sensibly is a bonus to the quality of service. A deterministic method has been adopted to resolve the conflict, with the objective of minimising the total weighted delay. However, the computational demand remains significant. The applications of different heuristic methods to tackle this problem are reviewed and explored, elaborating their feasibility in various aspects and comparing their relative merits for further studies. As most heuristic methods do not guarantee a global optimum, this study focuses on the trade-off between computation time and optimality of the resolution.
Railway junction traffic control by heuristic methods
2001-01-01
8 pages
Article (Journal)
English
signalling , total weighted delay minimisation , congested rail lines , heuristic methods , railways , tabu search , interlocking systems , search problems , right-of-way sequence , simulated annealing , computational demand , quality of service , railway junction traffic control , genetic algorithms , deterministic method , traffic control , rail traffic
Railway junction traffic control by heuristic methods
Tema Archive | 2001
|Engineering Index Backfile | 1948
|Chinese railway traffic control
IuD Bahn | 2002
|European Patent Office | 2020
|Heuristic Algorithm for Priority Traffic Signal Control
Online Contents | 2011
|