Solving Area Coverage Problem with UAVs: A Vehicle Routing with Time Windows Variation

Abstract In real life, providing security for a set of large areas by covering the areas with Unmanned Aerial Vehicles (UAVs) is a difficult problem that consists of multiple objectives. These difficulties are even greater if the area coverage has to be sustained through a specific time window. We address this by considering a Vehicle Routing Problem with a Time Windows (VRPTW) variation in which the capacity of agents is counted as one and each customer (target area) is to be supplied with more than one vehicle simultaneously and without violating time windows. In this problem, our aim is to find a way to cover all areas with the necessary number of UAVs during the time windows, while minimizing the total distance traveled, and providing a fast solution by satisfying the additional constraint that each agent has limited fuel. We present a novel algorithm that relies on clustering the target areas according to their time windows, and then incrementally generating transportation problems with each cluster and the ready UAVs. We then solve the transportation problems with a simplex algorithm. The performance of the proposed algorithm and other algorithms implemented in order to compare the solution quality is evaluated through example scenarios with practical problem sizes.

[1]  Hans-Peter Kriegel,et al.  A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise , 1996, KDD.

[2]  Mei-Shiang Chang,et al.  The real-time time-dependent vehicle routing problem , 2006 .

[3]  Eric V. Denardo,et al.  Flows in Networks , 2011 .

[4]  Geraldo Robson Mateus,et al.  A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows , 2007, Comput. Oper. Res..

[5]  Gilbert Laporte,et al.  A branch-and-price algorithm for the Vehicle Routing Problem with Deliveries, Selective Pickups and Time Windows , 2009, Eur. J. Oper. Res..

[6]  John Allen,et al.  ENHANCED OIL SPILL SURVEILLANCE, DETECTION AND MONITORING THROUGH THE APPLIED TECHNOLOGY OF UNMANNED AIR SYSTEMS , 2008 .

[7]  Ramasamy Panneerselvam,et al.  A Survey on the Vehicle Routing Problem and Its Variants , 2012 .

[8]  John E. Beasley,et al.  Route first--Cluster second methods for vehicle routing , 1983 .

[9]  Ruhan He,et al.  Balanced K-Means Algorithm for Partitioning Areas in Large-Scale Vehicle Routing Problem , 2009, 2009 Third International Symposium on Intelligent Information Technology Application.

[10]  J. F. Pierce,et al.  ON THE TRUCK DISPATCHING PROBLEM , 1971 .

[11]  Yuval Rabani,et al.  Linear Programming , 2007, Handbook of Approximation Algorithms and Metaheuristics.

[12]  S. P. Lloyd,et al.  Least squares quantization in PCM , 1982, IEEE Trans. Inf. Theory.

[13]  Niklas Kohl,et al.  An Optimization Algorithm for the Vehicle Routing Problem with Time Windows Based on Lagrangian Relaxation , 1997, Oper. Res..

[14]  Adam N. Letchford,et al.  A new branch-and-cut algorithm for the capacitated vehicle routing problem , 2004, Math. Program..

[15]  David Glade,et al.  Unmanned Aerial Vehicles: Implications for Military Operations , 2012 .

[16]  Danna Zhou,et al.  d. , 1934, Microbial pathogenesis.

[17]  Carol J. Friedland,et al.  A SURVEY OF UNMANNED AERIAL VEHICLE ( UAV ) USAGE FOR IMAGERY , 2011 .

[18]  Alain Hertz,et al.  A Tabu Search Algorithm for the Split Delivery Vehicle Routing Problem , 2003, Transp. Sci..

[19]  T. Chou,et al.  DISASTER MONITORING AND MANAGEMENT BY THE UNMANNED AERIAL VEHICLE TECHNOLOGY , 2010 .

[20]  J. K. Lenstra,et al.  Complexity of vehicle routing and scheduling problems , 1981, Networks.

[21]  Mourad Debbabi,et al.  The multi-depot split-delivery vehicle routing problem: Model and solution algorithm , 2014, Knowl. Based Syst..

[22]  Billy E. Gillett,et al.  A Heuristic Algorithm for the Vehicle-Dispatch Problem , 1974, Oper. Res..

[23]  Enrique Alba,et al.  The exploration/exploitation tradeoff in dynamic cellular genetic algorithms , 2005, IEEE Transactions on Evolutionary Computation.

[24]  Éric D. Taillard,et al.  Parallel iterative search methods for vehicle routing problems , 1993, Networks.

[25]  Geraldo Robson Mateus,et al.  A two-phase genetic and set partitioning approach for the vehicle routing problem with time windows , 2004, Fourth International Conference on Hybrid Intelligent Systems (HIS'04).

[26]  Fermín Alfredo Tang Montané,et al.  A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service , 2006, Comput. Oper. Res..

[27]  Therese Skrzypietz,et al.  Unmanned Aircraft Systems for Civilian Missions , 2012 .

[28]  Michel Gendreau,et al.  Production , Manufacturing and Logistics An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles , 2009 .

[29]  Rafael Martinelli,et al.  A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints , 2014, Discret. Optim..

[30]  Sumam Mary Idicula,et al.  A multi-agent vehicle routing system for garbage collection , 2013, 2013 Fifth International Conference on Advanced Computing (ICoAC).

[31]  Marshall L. Fisher,et al.  A generalized assignment heuristic for vehicle routing , 1981, Networks.

[32]  Linet Özdamar,et al.  A hierarchical clustering and routing procedure for large scale disaster relief logistics planning , 2012 .

[33]  Roberto Montemanni,et al.  Ant Colony System for a Dynamic Vehicle Routing Problem , 2005, J. Comb. Optim..

[34]  J. Clausen,et al.  Branch and Bound Algorithms-Principles and Examples , 2003 .

[35]  Mariam Faied,et al.  Vehicle Routing Problem Instances: Application to Multi-UAV Mission Planning , 2010 .

[36]  Yang Liu,et al.  Survey on computational-intelligence-based UAV path planning , 2018, Knowl. Based Syst..

[37]  Hrvoje Gold,et al.  Vehicle Routing Problem , 2008, Encyclopedia of GIS.

[38]  Karl Sammut,et al.  Efficient Path Re-planning for AUVs Operating in Spatiotemporal Currents , 2015, J. Intell. Robotic Syst..

[39]  M. Balinski,et al.  On an Integer Program for a Delivery Problem , 1964 .

[40]  Gilbert Laporte,et al.  The vehicle routing problem: An overview of exact and approximate algorithms , 1992 .

[41]  Fred Glover,et al.  Extensions of the Petal Method for Vehicle Routeing , 1993 .

[42]  Hoong Chuin Lau,et al.  Vehicle routing problem with time windows and a limited number of vehicles , 2003, Eur. J. Oper. Res..

[43]  E. Forgy,et al.  Cluster analysis of multivariate data : efficiency versus interpretability of classifications , 1965 .

[44]  Roxanne Evering,et al.  An ant colony algorithm for the multi-compartment vehicle routing problem , 2014, Appl. Soft Comput..