An optimal rescheduling for online train traffic control in disturbed situations

1 January 1983

conference paper
Published by Institute of Electrical and Electronics Engineers (IEEE)

Vol. 22, 489-494
https://doi.org/10.1109/cdc.1983.269890

Abstract

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 sub-optimal 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.

Keywords

This publication has 5 references indexed in Scilit:

The organization of expert systems, a tutorial
Artificial Intelligence, 1982
A methodology for generation of optimal schedules for an underground railway system
IEEE Transactions on Automatic Control, 1980
A combined simulation of a rapid transit system
SIMULATION, 1978
Branch-and-Bound Methods: A Survey
Operations Research, 1966
An Algorithm for the Solution of Mixed Integer Programming Problems
Management Science, 1966