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.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Vehicle routing problem using genetic algorithms based on adjacency relations


    Beteiligte:
    Uchimura, K. (Autor:in) / Sakaguchi, H. (Autor:in)


    Erscheinungsdatum :

    01.01.1995


    Format / Umfang :

    297813 byte




    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    Vehicle routing problem using genetic algorithms based on adjacency relations

    Uchimura,K. / Sakaguchi,H. / Kumamoto Univ.,Dep.of Electrical Engng.and Computer Science,JP | Kraftfahrwesen | 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

    Freier Zugriff

    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