Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/20288
Title: Railway junction traffic control by heuristic methods
Authors: Ho, TK
Yeung, TH
Issue Date: 2001
Publisher: The Institution of Engineering and Technology
Source: IEE proceedings. Electric power applications, 2001, v. 148, no. 1, p. 77-84 How to cite?
Journal: IEE proceedings. Electric power applications 
Abstract: 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, minimizing 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 minimizing 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.
URI: http://hdl.handle.net/10397/20288
ISSN: 1350-2352
DOI: 10.1049/ip-epa:20010028
Appears in Collections:Conference Paper

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

17
Last Week
0
Last month
0
Citations as of Apr 16, 2017

WEB OF SCIENCETM
Citations

13
Last Week
0
Last month
0
Citations as of Apr 18, 2017

Page view(s)

20
Last Week
0
Last month
Checked on Apr 16, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.