Heuristics for Routing Heterogeneous Unmanned Vehicles with Fuel Constraints

This paper addresses a multiple depot, multiple unmanned vehicle routing problem with fuel constraints. The objective of the problem is to find a tour for each vehicle such that all the specified targets are visited at least once by some vehicle, the tours satisfy the fuel constraints, and the total travel cost of the vehicles is a minimum. We consider a scenario where the vehicles are allowed to refuel by visiting any of the depots or fuel stations. This is a difficult optimization problem that involves partitioning the targets among the vehicles and finding a feasible tour for each vehicle. The focus of this paper is on developing fast variable neighborhood descent (VND) and variable neighborhood search (VNS) heuristics for finding good feasible solutions for large instances of the vehicle routing problem. Simulation results are presented to corroborate the performance of the proposed heuristics on a set of 23 large instances obtained from a standard library. These results show that the proposed VND heuristic, on an average, performed better than the proposed VNS heuristic for the tested instances.

[1]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[2]  Shen Lin.  Computer solutions of the traveling salesman problem , 1965 .

[3]  Donald C Slack,et al.  Irrigation Scheduling Using Crop Canopy-Air Temperature Difference , 1980 .

[4]  S. Idso,et al.  Canopy temperature as a crop water stress indicator , 1981 .

[5]  Josef Stoer,et al.  Numerische Mathematik 1 , 1989 .

[6]  Martin W. P. Savelsbergh,et al.  The Vehicle Routing Problem with Time Windows: Minimizing Route Duration , 1992, INFORMS J. Comput..

[7]  Robert F. Dell,et al.  The Multiple Vehicle TSP with Time Windows and Equity Constraints over a Multiple Day Horizon , 1996, Transp. Sci..

[8]  Pierre Hansen,et al.  Variable neighborhood search: Principles and applications , 1998, Eur. J. Oper. Res..

[9]  G. Holland,et al.  Applications of Aerosondes in the Arctic , 2004 .

[10]  Roberto Musmanno,et al.  Tabu Search Heuristics for the Arc Routing Problem with Intermediate Facilities under Capacity and Length Restrictions , 2004, J. Math. Model. Algorithms.

[11]  M. V. Ramana,et al.  Capturing vertical profiles of aerosols and black carbon over the Indian Ocean using autonomous unmanned aerial vehicles , 2007 .

[12]  Richard F. Hartl,et al.  A variable neighborhood search for the capacitated arc routing problem with intermediate facilities , 2008, J. Heuristics.

[13]  Swaroop Darbha,et al.  Heterogeneous, Multiple Depot, Multiple UAV Routing Problem , 2010 .

[14]  Swaroop Darbha,et al.  Today's Traveling Salesman Problem , 2010, IEEE Robotics & Automation Magazine.

[15]  Mario Innocenti,et al.  Cooperative path planning and task assignment for unmanned air vehicles , 2010 .

[16]  Antonios Tsourdos,et al.  Dubins Path Planning of Multiple Unmanned Airborne Vehicles for Communication Relay , 2011 .

[17]  Swaroop Darbha,et al.  Approximation algorithms and heuristics for a 2‐depot, heterogeneous Hamiltonian path problem , 2011 .

[18]  Samir Khuller,et al.  To fill or not to fill: The gas station problem , 2007, TALG.

[19]  Kaarthik Sundar,et al.  Route planning algorithms for unmanned aerial vehicles with refueling constraints , 2012, 2012 American Control Conference (ACC).

[20]  Swaroop Darbha,et al.  3-Approximation algorithm for a two depot, heterogeneous traveling salesman problem , 2012, Optim. Lett..

[21]  Seid H. Pourtakdoust,et al.  Integrated motion planning and trajectory control system for unmanned air vehicles , 2013 .

[22]  Jungyun Bae.  Algorithms for multiple vehicle routing problems , 2014 .

[23]  Kaarthik Sundar,et al.  Algorithms for Routing an Unmanned Aerial Vehicle in the Presence of Refueling Depots , 2013, IEEE Transactions on Automation Science and Engineering.