WIT Press

Railway Junction Conflict Resolution By Local Search Method

Price

Free (open access)

Paper DOI

10.2495/CR000741

Volume

50

Pages

10

Published

2000

Size

1,214 kb

Author(s)

T.H. Yeung & T.K. Ho

Abstract

Railway junction conflict resolution by local search method T.H. Yeung & T.K. Ho Department of Electrical Engineering Hong Kong Polytechnic University Hung Horn, Kowloon, Hong Kong Abstract 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

Keywords