In this paper, we address a collaborative routing problem of the truck-drone delivery system, in which a truck collaborates with multiple drones to perform parcel deliveries. To meet the practical demands of non-emergency deliverirs, each vehicle (i.e., a truck or a drone) is allowed to serve a customer earlier and later than the required time window. We propose a variable neighborhood search metaheuristic incorporated with an acceptable criterion of simulated annealing (HVNS-SA) to solve this problem. Besides, we design a novel solution representation and introduce 6 problem-specific neighborhood structures to construct the hybrid metaheuristic. Finally, extensive experiments are conducted based on a set of benchmark instances to evaluate the performance of HVNS-SA. The comparison studies with simulated annealing (SA), conventional variable neighborhood search (CVNS), and variable neighborhood descent (VND) show the superiority of HVNS-SA.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Hybridization of Variable Neighborhood Search and Simulated Annealing for the Collaborative Truck-Drone Routing Problem


    Additional title:

    Lect. Notes Electrical Eng.


    Contributors:
    Wu, Meiping (editor) / Niu, Yifeng (editor) / Gu, Mancang (editor) / Cheng, Jin (editor) / Luo, Qizhang (author) / Wu, Guohua (author) / Mao, Ni (author) / Shi, Jianmai (author)

    Conference:

    International Conference on Autonomous Unmanned Systems ; 2021 ; Changsha, China September 24, 2021 - September 26, 2021



    Publication date :

    2022-03-18


    Size :

    11 pages





    Type of media :

    Article/Chapter (Book)


    Type of material :

    Electronic Resource


    Language :

    English