Railway junction conflict resolution by genetic algorithm
Ho, T.K. & Yeung, T.H. (2000) Railway junction conflict resolution by genetic algorithm. Electronics Letters, 36(8), pp. 771-772.
In general, simple and traditional methods are applied to resolve traffic conflicts at railway junctions. They are, however, either inefficient or computationally demanding. A simple genetic algorithm is presented to enable a search for a near optimal resolution to be carried out while meeting the constraints on generation evolution and minimising the search time.
Impact and interest:
Citation counts are sourced monthly from and citation databases.
Citations counts from theindexing service can be viewed at the linked Google Scholar™ search.
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.
|Item Type:||Journal Article|
|Keywords:||Railway engineering, Traffic control, Genetic algorithms|
|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) > Neural Evolutionary and Fuzzy Computation (080108)
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
Past > Schools > School of Engineering Systems
|Copyright Owner:||Copyright 2000 The Institution of Engineering and Technology|
|Deposited On:||27 Oct 2010 23:44|
|Last Modified:||10 Aug 2011 18:31|
Repository Staff Only: item control page