The conflict resolution in connected railway junctions

Tsang, C.W. & Ho, T.K. (2003) The conflict resolution in connected railway junctions. In Computational Methods in Engineering and Science : Proceedings of the 9th International Conference EPMESC IX, Taylor & Francis, University of Macau, China.

View at publisher


Purpose of study: Traffic conflicts occur when trains on different routes approach a converging junction in a railway network at the same time. To prevent collisions, a right-of-way assignment is needed to control the order in which the trains should pass the junction. Such control action inevitably requires the braking and/or stopping of trains, which lengthens their travelling times and leads to delays. Train delays cause a loss of punctuality and hence directly affect the quality of service. It is therefore important to minimise the delays by devising a suitable right-of-way assignment. One of the major difficulties in attaining the optimal right-of-way assignment is that the number of feasible assignments increases dramatically with the number of trains. Connected-junctions further complicate the problem. Exhaustive search for the optimal solution is time-consuming and infeasible for area control (multi-junction). Even with the more intelligent deterministic optimisation method revealed in [1], the computation demand is still considerable, which hinders real-time control. In practice, as suggested in [2], the optimality may be traded off by shorter computation time, and heuristic searches provide alternatives for this optimisation problem.

Impact and interest:

3 citations in Web of Science®
Search Google Scholar™

Citation counts are sourced monthly from Scopus and Web of Science® citation databases.

These databases contain citations from different subsets of available publications and different time periods and thus the citation count from each is usually different. Some works are not in either database and no count is displayed. Scopus includes citations from articles published in 1996 onwards, and Web of Science® generally from 1980 onwards.

Citations counts from the Google Scholar™ indexing service can be viewed at the linked Google Scholar™ search.

Full-text downloads:

70 since deposited on 09 Nov 2010
14 in the past twelve months

Full-text downloads displays the total number of times this work’s files (e.g., a PDF) have been downloaded from QUT ePrints as well as the number of downloads in the previous 365 days. The count includes downloads for all files if a work has more than one.

ID Code: 38388
Item Type: Conference Paper
Refereed: Yes
Additional URLs:
Keywords: Railway transportation, Junction traffic, Conflict resolution, Genetic algorithm
ISBN: 9789058095671
Subjects: Australian and New Zealand Standard Research Classification > MATHEMATICAL SCIENCES (010000) > APPLIED MATHEMATICS (010200) > Operations Research (010206)
Australian and New Zealand Standard Research Classification > INFORMATION AND COMPUTING SCIENCES (080000) > ARTIFICIAL INTELLIGENCE AND IMAGE PROCESSING (080100) > Expert Systems (080105)
Australian and New Zealand Standard Research Classification > ENGINEERING (090000) > CIVIL ENGINEERING (090500) > Transport Engineering (090507)
Divisions: Past > QUT Faculties & Divisions > Faculty of Built Environment and Engineering
Copyright Owner: Copyright 2003 Swets & Zeitlinger
Deposited On: 09 Nov 2010 05:47
Last Modified: 13 Jul 2017 05:20

Export: EndNote | Dublin Core | BibTeX

Repository Staff Only: item control page