Routing and scheduling optimization for UAV assisted delivery system: A hybrid approach

• Published in: Applied soft computing Vol. 126; p. 109225
• Main Authors: Sajid, Mohammad, Mittal, Himanshu, Pare, Shreya, Prasad, Mukesh
• Format: Journal Article
• Language: English
• Published: Elsevier B.V 01.09.2022
• Subjects: Genetic algorithm; Route-scheduling; Routing; Simulated annealing; Smart logistics; Unmanned aerial vehicle; Smart logistics; Routing; Unmanned aerial vehicle; Genetic algorithm; Route-scheduling; Simulated annealing
• DOI: 10.1016/j.asoc.2022.109225
• ISSN: 1568-4946

This paper proposes a joint-optimization framework for UAV-routing and UAV-route scheduling problems associated with the UAV-assisted delivery system. The mixed-integer linear programming (MILP) models for UAV-routing and UAV-route scheduling problems are proposed considering the effect of incidental processes and the varying payload on travel time. A hybrid genetic and simulated annealing (HGSA) algorithm is proposed for the UAV-routing problem to minimize travel time. In HGSA, genetic algorithm (GA) employs a novel stochastic crossover operator to search for the optimal global position of customers, whereas simulated annealing (SA) utilizes local search operators to avoid the local optima. A UAV-Oriented MinMin (UO-MinMin) algorithm is also proposed to minimize the makespan of the UAV-route scheduling problem. It employs a UAV-oriented view to generate the route-scheduling order with minimal computational efforts without affecting the quality of the makespan. A Monte Carlo simulation-based sensitivity analysis is conducted to evaluate the impact of the hybridization probability of GA and SA in the proposed HGSA algorithm. To assess the performance of the HGSA algorithm, a set P of 24 benchmark instances is adopted and adjusted to meet the constraints of the UAV-Assisted delivery system. The proposed HGSA outperforms the state-of-the-art algorithms such as genetic algorithm (GA), Particle Swarm Optimization & Simulated Annealing algorithm (PSO-SA), Differential Evolution & Simulated Annealing (DE-SA), and Harris-hawks optimization (HHO). For all 24 instances, the aerial routes generated by HGSA have been used to evaluate the effectiveness of the UO-MinMin algorithm for different numbers of UAVs. The proposed UO-MinMin algorithm outperforms the base algorithms such as minimum completion time (MCT) and opportunistic load balancing (OLB). •The proposed model supports multi-parcel delivery in a UAV-assisted delivery system.•MILP models for routing and route scheduling of UAVs are proposed.•An efficient hybrid approach is proposed for UAV-routing and UAV-route scheduling.•A new dataset is adopted to simulate the UAV-Assisted delivery system.•The hybrid approach performs better for all problem instances.