Efficient Tabu Search Algorithm for the Cyclic Inspection Problem

[1]  Bruce L. Golden,et al.  Optimization approaches for civil applications of unmanned aerial vehicles (UAVs) or aerial drones: A survey , 2018, Networks.

[2]  Lei Zhang,et al.  A double-loop hybrid algorithm for the traveling salesman problem with arbitrary neighbourhoods , 2018, Eur. J. Oper. Res..

[3]  Raffaele Cerulli,et al.  A novel discretization scheme for the close enough traveling salesman problem , 2017, Comput. Oper. Res..

[4]  Anand Subramanian,et al.  A Branch-and-Bound Algorithm for the Close-Enough Traveling Salesman Problem , 2016, INFORMS J. Comput..

[5]  Jonathan Cole Smith,et al.  An Integer-Programming-Based Approach to the Close-Enough Traveling Salesman Problem , 2014, INFORMS J. Comput..

[6]  Bruce L. Golden,et al.  A Steiner-Zone Heuristic for Solving the Close-Enough Traveling Salesman Problem , 2011, ICS 2011.

[7]  Andreas Terzis,et al.  Using mobile robots to harvest data from sensor fields , 2009, IEEE Wireless Communications.

[8]  Maria E. Orlowska,et al.  On the Optimal Robot Routing Problem in Wireless Sensor Networks , 2007, IEEE Transactions on Knowledge and Data Engineering.

[9]  Joseph S. B. Mitchell,et al.  Approximation algorithms for TSP with neighborhoods in the plane , 2001, SODA '01.

[10]  Joseph S. B. Mitchell,et al.  Approximation algorithms for geometric tour and network design problems (extended abstract) , 1995, SCG '95.

[11]  Esther M. Arkin,et al.  Approximation Algorithms for the Geometric Covering Salesman Problem , 1994, Discret. Appl. Math..

[12]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[13]  Fred W. Glover,et al.  Future paths for integer programming and links to artificial intelligence , 1986, Comput. Oper. Res..

[14]  Fred W. Glover,et al.  Tabu Search - Part I , 1989, INFORMS J. Comput..

[15]  M. J. D. Powell,et al.  An efficient method for finding the minimum of a function of several variables without calculating derivatives , 1964, Comput. J..