An Adaptive Heuristic Approach to Compute Upper and Lower Bounds for the Close-Enough Traveling Salesman Problem

References

• Andersen ED, Roos C, Terlaky T (2003) On implementing a primal-dual interior-point method for conic quadratic optimization. Math. Programming 95(2):249–277.Crossref, Google Scholar
• Arkin EM, Hassin R (1994) Approximation algorithms for the geometric covering salesman problem. Discrete Appl. Math. 55(3):197–218.Crossref, Google Scholar
• Behdani B, Smith J (2014) An integer-programming-based approach to the close-enough traveling salesman problem. INFORMS J. Comput. 26(3):415–432.Link, Google Scholar
• Carrabs F, Cerrone C, Cerulli R, D’Ambrosio C (2017a) Improved upper and lower bounds for the close enough traveling salesman problem. Au MHA, Castiglione A, Choo KKR, Palmieri F, Li KC, eds. Green, Pervasive, and Cloud Computing (Springer, Cham, Switzerland), 165–177.Google Scholar
• Carrabs F, Cerrone C, Cerulli R, Gaudioso M (2017b) A novel discretization scheme for the close enough traveling salesman problem. Comput. Oper. Res. 78:163–171.Crossref, Google Scholar
• Cerrone C, Cerulli R, Golden B (2017) Carousel greedy: A generalized greedy algorithm with applications in optimization. Comput. Oper. Res. 85:97–112.Crossref, Google Scholar
• Coutinho W, Do Nascimento R, Pessoa A, Subramanian A (2016) A branch-and-bound algorithm for the close-enough traveling salesman problem. INFORMS J. Comput. 28(4):752–765.Link, Google Scholar
• Current JR (1981) Multiobjective design of transportation networks. Unpublished doctoral dissertation, Department of Geography and Environmental Engineering, Johns Hopkins University, Baltimore.Google Scholar
• Current JR, Schilling DA (1989) The covering salesman problem. Transportation Sci. 23(3):208–213.Link, Google Scholar
• Dong J, Yang N, Chen M (2007) Heuristic approaches for a TSP variant: The automatic meter reading shortest tour problem. Oper. Res./Comput. Sci. Interfaces Ser. 37:145–163.Google Scholar
• Dumitrescu A, Mitchell J (2003) Approximation algorithms for TSP with neighborhoods in the plane. J. Algorithms 48(1):135–159.Crossref, Google Scholar
• Faigl J (2018) GSOA: Growing self-organizing array - unsupervised learning for the close-enough traveling salesman problem and other routing problems. Neurocomput. 312:120–134.Crossref, Google Scholar
• Faigl J, Váňa P, Deckerová J (2019) Fast heuristics for the 3-d multi-goal path planning based on the generalized traveling salesman problem with neighborhoods. IEEE Robotics Automation Lett. 4(3):2439–2446.Crossref, Google Scholar
• Gendreau M, Laporte G, Semet F (1997) The covering tour problem. Oper. Res. 45(4):568–576.Link, Google Scholar
• Gulczynski D, Heath J, Price C (2006) Close enough traveling salesman problem: A discussion of several heuristics. Alt FB, Fu MC, Golden BL, eds. Perspectives in Operations Research (Springer, New York), 271–283.Google Scholar
• Mata CS, Mitchell JSB (1995) Approximation algorithms for geometric tour and network design problems (extended abstract). Proc. 11th Annual Sympos. Comput. Geometry, 360–369.Google Scholar
• Mennell W (2009) Heuristics for solving three routing problems: Close-enough traveling salesman problem, close-enough vehicle routing problem, sequence-dependent team orienteering problem. Unpublished doctoral dissertation, Robert H. Smith School of Business, University of Maryland, College Park.Google Scholar
• Mennell W, Golden B, Wasil E (2011) A Steiner-zone heuristic for solving the close-enough traveling salesman problem. Wood RK, Dell RF, eds. Operations Research, Computing, and Homeland Defense (INFORMS, Catonsville, MD), 162–183.Google Scholar
• Poikonen S, Wang X, Golden B (2017) The vehicle routing problem with drones: Extended models and connections. Networks 70(1):34–43.Crossref, Google Scholar
• Shuttleworth R, Golden B, Smith S, Wasil E (2008) Advances in meter reading: Heuristic solution of the close enough traveling salesman problem over a street network. Oper. Res./Comput. Sci. Interfaces Ser. 43:487–501.Google Scholar
• Silberholz J, Golden B (2007) The generalized traveling salesman problem: a new genetic algorithm approach. Baker EK, Joseph A, Mehrotra A, Trick MA, eds. Extending the Horizons: Advances in Computing, Optimization, and Decision Technologies (Springer, Boston), 165–181.Google Scholar
• Wang X, Golden B, Wasil E (2019) A Steiner zone variable neighborhood search heuristic for the close-enough traveling salesman problem. Comput. Oper. Res. 101(1):200–219.Crossref, Google Scholar
• Yang Z, Xiao MQ, Ge YW, Feng DL, Zhang L, Song HF, Tang XL (2018) A double-loop hybrid algorithm for the traveling salesman problem with arbitrary neighbourhoods. Eur. J. Oper. Res. 265(1):65–80.Crossref, Google Scholar
• Yuan B, Orlowska M, Sadiq S (2007) On the optimal robot routing problem in wireless sensor networks. IEEE Trans. Knowledge Data Engrg. 19(9):1252–1261.Crossref, Google Scholar