This paper considers a fleet of electric vehicles and drones that deliver goods collaboratively. To determine the optimal routes of this electric vehicle-drone routing problem, the problem is formulated as a mixed-integer linear program to minimize the total operational costs. To solve the model, we develop an adaptive memetic algorithm that employs a multi-operator concept with a Q-learning-based selection mechanism and a set of local search operators for exploring the complex search space of the problem. Using extensive numerical experiments, we prove the effectiveness of our proposal and reveal some interesting managerial insights.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    An Adaptive Memetic Algorithm for a Cost-Optimal Electric Vehicle-Drone Routing Problem


    Contributors:

    Published in:

    Publication date :

    2024-12-01


    Size :

    17938063 byte




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English



    Electric Vehicle-Drone Routing Problem with Optional Drone Availability

    Windras Mara, Setyo Tri / Sarker, Ruhul / Essam, Daryl et al. | IEEE | 2023


    Memetic algorithm with adaptive local search for Capacitated Arc Routing Problem

    Yao, Tingting / Yao, Xin / Han, Shuangshuang et al. | IEEE | 2017


    [257] A MEMETIC ALGORITHM FOR THE VEHICLE ROUTING PROBLEM WITH STOCHASTIC DEMANDS

    Gutierrez, Andres / Dieulle, Laurence / Labadie, Nacima et al. | TIBKAT | 2016


    A REVIEW OF MEMETIC ALGORITHM FOR CAPACITATED VEHICLE ROUTING PROBLEM WITH TIME WINDOWS

    Pandey, Digesh / Srivastava, Namita | BASE | 2018

    Free access

    A memetic algorithm for the open capacitated arc routing problem

    Fung, Richard Y.K. | Online Contents | 2013