In the following paper, we were interested in a model related to School Bus Routing Problem (SBRP). Our first objective is to develop a transportation plan to minimize the costs of running across network while meeting a set of constraints such as the capacity of bus and the distance establish by each vehicle. The metaheuristics, namely genetic algorithm are able to solve NP-hard problems. To reach the optimal solution, a new version of genetic algorithm is developed; the set of new operators created in this version offer a great exploitation of the space and then it take can provide a feasible solution. The best solution provided by SBRP allows us to reduce the total transport costs. SBRP would be probably the key to develop the transport company's economies and a major challenge for sustainable development.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Solving School Bus Routing Problem with genetic algorithm


    Beteiligte:


    Erscheinungsdatum :

    01.05.2013


    Format / Umfang :

    1034446 byte




    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    Solving Vehicle Routing Problem with Time Windows by Genetic Algorithm

    Jiang, Dali / Zhang, Mingshan / Wang, Feng | ASCE | 2002


    Solving Vehicle Routing Problem with Time Windows by Genetic Algorithm

    Jiang, D. / Zhang, M. / Wang, F. et al. | British Library Conference Proceedings | 2002



    SOLVING FUZZY DYNAMIC SHIP ROUTING AND SCHEDULING PROBLEM THROUGH MODIFIED GENETIC ALGORITHM

    Das, Madhushree / Roy, Arindam / Maity, Samir et al. | BASE | 2022

    Freier Zugriff