Railway junction conflict resolution by local search method


Autoria(s): Yeung, T.H.; Ho, T.K.
Data(s)

2000

Resumo

This study investigates the application of local search methods on the railway junction traffic conflict-resolution problem, with the objective of attaining a quick and reasonable solution. A procedure based on local search relies on finding a better solution than the current one by a search in the neighbourhood of the current one. The structure of neighbourhood is therefore very important to an efficient local search procedure. In this paper, the formulation of the structure of the solution, which is the right-of-way sequence assignment, is first described. Two new neighbourhood definitions are then proposed and the performance of the corresponding local search procedures is evaluated by simulation. It has been shown that they provide similar results but they can be used to handle different traffic conditions and system requirements.

Formato

application/pdf

Identificador

http://eprints.qut.edu.au/38625/

Relação

http://eprints.qut.edu.au/38625/1/c38625.pdf

Yeung, T.H. & Ho, T.K. (2000) Railway junction conflict resolution by local search method. In Proceedings of 7th International Conference on Computer Aided Design, Manufacture and Operation in Railway and other Advanced Mass Transit Systems, Bologna, Italy.

Direitos

Copyright 2000 [please consult the authors]

Fonte

Faculty of Built Environment and Engineering; School of Engineering Systems

Palavras-Chave #010206 Operations Research #080105 Expert Systems #090507 Transport Engineering #Conflict resolution #Railway traffic control #Local search
Tipo

Conference Paper