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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Solving School Bus Routing Problem with genetic algorithm


    Contributors:


    Publication date :

    2013-05-01


    Size :

    1034446 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    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

    Free access

    Solving the School Bus Routing Problem by Maximizing Trip Compatibility

    Shafahi, Ali / Wang, Zhongxiang / Haghani, Ali | Transportation Research Record | 2017



    Genetic Algorithm for Vehicle Routing Problem with Backhauls

    WA, W.Nurfahizul Ifwah. / Shaiful, M. / Shamsunarnie, M.Z et al. | BASE | 2012

    Free access