This study investigates the application of local search methods on the railwayudjunction traffic conflict-resolution problem, with the objective of attaining audquick and reasonable solution. A procedure based on local search relies onudfinding a better solution than the current one by a search in the neighbourhood ofudthe current one. The structure of neighbourhood is therefore very important toudan efficient local search procedure. In this paper, the formulation of theudstructure of the solution, which is the right-of-way sequence assignment, is firstuddescribed. Two new neighbourhood definitions are then proposed and theudperformance of the corresponding local search procedures is evaluated byudsimulation. It has been shown that they provide similar results but they can beudused to handle different traffic conditions and system requirements.
展开▼
