In the vehicle routing problem, the traditional crossover operators for genetic algorithms (GAs) could fail to produce legal tours. We propose a new crossover operator considering adjacency relations, and compare the new GA with the GA using the partially matched crossover or a branch-and-bound method. Some experiments are performed on digital road maps. The proposed GA finds optimum solutions effectively.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Vehicle routing problem using genetic algorithms based on adjacency relations


    Contributors:


    Publication date :

    1995-01-01


    Size :

    297813 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Vehicle routing problem using genetic algorithms based on adjacency relations

    Uchimura,K. / Sakaguchi,H. / Kumamoto Univ.,Dep.of Electrical Engng.and Computer Science,JP | Automotive engineering | 1995


    Vehicle Routing Problem Using Genetic Algorithms Based on Adjacency Relations

    Uchimura, K. / Sakaguchi, H. / IEEE et al. | British Library Conference Proceedings | 1995


    SOLUTION TO VEHICLE ROUTING PROBLEM USING GENETIC ALGORITHMS

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

    Free access

    Genetic algorithms for vehicle routing problem in delivery system

    Uchimura, K. / Sakaguchi, H. / Nakashima, T. | IEEE | 1994


    Genetic Algorithms for Vehicle Routing Problem in Deliver System

    Uchimura, K. / Sakaguchi, H. / Nakashima, T. et al. | British Library Conference Proceedings | 1994