VRP is widely described as the process where the distribution vehicles deliver goods in a depot to the clients found in geographically dispersed locations and then return to the depot on the optimum route. The VRP, first introduced by Dantzig and Ramser in 1959, aims to minimize the total distance to be covered during the routing of the vehicles in a centrally-located depot (Dantzig & Ramser, 1959). The routing process is operated by taking the vehicle capacities into consideration so as to ensure that each client located on the routing plan is visited only once. The depot, vehicle, and goods concepts mentioned in the general description of VRP can be re-adapted as school, student and bus stop, based on different sectors that the problem applies to. Figure 1 shows a scheme indicating the VRP solution applied to a distribution system, where the clientele network is dispersed over three different zones. ; https://www.edusoft.ro/brain/index.php/brain/article/view/803/909


    Access

    Download


    Export, share and cite



    Title :

    Using the Genetic Algorithm for the Optimization of Dynamic School Bus Routing Problem-Figure 1. Example of a VRP solution


    Contributors:

    Publication date :

    2018-05-01


    Remarks:

    BRAIN. Broad Research in Artificial Intelligence and Neuroscience 9(2) 6-21



    Type of media :

    Miscellaneous


    Type of material :

    Electronic Resource


    Language :

    English



    Classification :

    DDC:    629





    Solving School Bus Routing Problem with genetic algorithm

    Ben Sghaier, Sayda / Ben Guedria, Najeh / Mraihi, Rafaa | IEEE | 2013



    School bus routing problem based on ant colony optimization algorithm

    Lingmei Huo / Guifeng Yan / Bowen Fan et al. | IEEE | 2014


    SOLUTION TO VEHICLE ROUTING PROBLEM USING GENETIC ALGORITHMS

    Murthy, Vishnu / Arun Kumar, Manda V / Jaswanth, Kongara et al. | BASE | 2014

    Free access