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.


    Access

    Access via TIB

    Check availability in my library


    Export, share and cite



    Title :

    An optimal rescheduling for online train traffic control in disturbed situations


    Additional title:

    Ein optimales Rescheduling fuer Online-Zugverkehrsregelung in verteilten Situationen


    Contributors:
    Araya, S. (author) / Abe, K. (author) / Fukumori, K. (author)


    Publication date :

    1983


    Size :

    6 Seiten, 8 Bilder, 2 Tabellen, 6 Quellen


    Type of media :

    Conference paper


    Type of material :

    Print


    Language :

    English




    A Hybrid Train Traffic Rescheduling Simulator

    Tomii, N. | Online Contents | 1995


    A Hybrid Train Traffic Rescheduling Simulator

    Tomii, N. / Ikeda, H. | British Library Online Contents | 1995


    A Hybrid Train Traffic Rescheduling Simulator

    Tomii, Notio / Ikeda, Hiroshi | IuD Bahn | 1995



    An Algorithm for Freight Train Driver Rescheduling in Disruption Situations

    Sato, K. / Fukumura, N. | British Library Online Contents | 2010