Abstract
This paper is an attempt to explore optimal routes and aborting strategies of trucks and drones under random attacks. Time windows of targets, aborting strategies of trucks and random attacks are considered in the truck-drone routes, which not only fixes the shortcomings of drones, such as its small load and short working hours, but also conducts a preliminary survey to gain disaster or enemy information in the field of emergency management or military. It is assumed that drones and trucks may be attacked in the route and the truck may abort its task according to the number of tasks finished and the number of attacks suffered. In addition, based on a constraint programming model, this paper proposes a hybrid algorithm named ALNS-SP algorithm combined with the adaptive large neighborhood search and the short-path algorithm to solve the vehicle routing problem with trucks and drones considering random attacks problem (VRP-TDA). A test set based on Solomon datasets is designed and comparative numerical experiments are presented to illustrate the performance of the ALNS-SP algorithm.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
