Optimal fleet size distribution and scheduling with transfer consideration for a transit system is a difficult optimization problem. A traditional formulation of the problem leads to a large non‐linear mixed integer programming problem. Past experience has shown that traditional optimization methods are unable to give optimal solutions to even simpler versions of the problem (like the optimal scheduling problem with known fleet size distribution). In this paper, a simple binary coded genetic algorithm (GA) based approach to the optimization problem is presented. The use of GA allows a more efficient formulation of the problem and the GA based approach gives optimal/near‐optimal results with limited computation effort.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Optimal fleet size distribution and scheduling of transit systems using genetic algorithms


    Contributors:

    Published in:

    Publication date :

    2001-02-01




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    Unknown





    Optimal Scheduling of Urban Transit Systems Using Genetic Algorithms

    Chakroborty, P. / Deb, K. / Subrahmanyam, P. S. | British Library Online Contents | 1995



    Improved Lower-Bound Fleet Size for Transit Schedules

    Ceder, Avishai | Springer Verlag | 2008