A practical method for generating optimal schedules for online train traffic control in disturbed situations is proposed. This scheduling problem is formulated to a 0-1 mixed integer programming problem. The method of solution proposed here is mainly divided into two parts: the first part generates a suboptimal solution by a heuristic method based upon 'Production System', and the second produces an optimal one by the branch-and-bound method using the above suboptimal value for the initial bound. It is shown that each subproblem generated in the second part, which is a linear programming problem can be easily calculated without using the ordinary simplex method. Some examples show that the proposed method has enough efficiency for practical use in both computational time and storage.
An optimal rescheduling for online train traffic control in disturbed situations
Ein optimales Rescheduling fuer Online-Zugverkehrsregelung in verteilten Situationen
Proc. of the 22nd IEEE Conf. on Decision and Control ; 1 ; 489-494
1983
6 Seiten, 8 Bilder, 2 Tabellen, 6 Quellen
Conference paper
English
A Hybrid Train Traffic Rescheduling Simulator
Online Contents | 1995
|A Hybrid Train Traffic Rescheduling Simulator
British Library Online Contents | 1995
|A Hybrid Train Traffic Rescheduling Simulator
IuD Bahn | 1995
|An Algorithm for Freight Train Driver Rescheduling in Disruption Situations
Online Contents | 2010
|An Algorithm for Freight Train Driver Rescheduling in Disruption Situations
British Library Online Contents | 2010
|