The Capacitated Vehicle Routing Problem (CVRP), is a capacity constrained type of vehicle routing problem, which is widely studied with many real-world applications. Based on this problem there are many researches and proposed papers depend on different types of algorithms. However, genetic algorithm based methods are scarcely proposed in the literature. In this paper, genetic algorithms are examined to routing unmanned aerial vehicles as adapting to capacitated vehicle routing problems. Researches based on this problem with genetic algorithms are discussed and simulation results for CVRP with genetic algorithms are implemented. It is also presented and discussed with the experimental results and compared our method with the some well-known benchmark algorithms.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Routing unmanned aerial vehicles as adapting to capacitated vehicle routing problem with genetic algorithms


    Contributors:
    Zorlu, Ozan (author)


    Publication date :

    2015-06-01


    Size :

    277768 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Improved Genetic Algorithm for Capacitated Vehicle Routing Problem

    Ren, C.Y. | British Library Conference Proceedings | 2013


    Improved Genetic Algorithm for Capacitated Vehicle Routing Problem

    Ren, C.Y. | British Library Conference Proceedings | 2013



    Visibility-constrained routing of unmanned aerial vehicles

    Buck, Keith R. / Gassner, Richard R. / Poore, Aubrey B. et al. | SPIE | 1999


    Routing inspection unmanned aerial vehicle

    GONG CHENG / CHEN HUI | European Patent Office | 2021

    Free access