Exact and Heuristic Algorithms for the Carrier–Vehicle Traveling Salesman Problem

References

• Agatz NAH, Bouman P, Schmidt M (2018) Optimization approaches for the traveling salesman problem with drone. Transportation Sci. 52(4):965–981.Link, 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
• Battarra M, Erdoğan G, Laporte G, Vigo D (2010) The traveling salesman problem with pickups, deliveries, and handling costs. Transportation Sci. 44(3):383–399.Link, Google Scholar
• Bodlaender HL, Feremans C, Grigoriev Al, Penninkx E, Sitters R, Wolle T (2009) On the minimum corridor connection problem and other generalized geometric problems. Comput. Geometry 42(9):939–951.Crossref, Google Scholar
• Bouman P, Agatz NAH, Schmidt M (2018) Dynamic programming approaches for the traveling salesman problem with drone. Networks 72(4):528–542.Crossref, Google Scholar
• Chan THH, Jiang SHC (2016) Reducing curse of dimensionality: Improved PTAS for TSP (with neighborhoods) in doubling metrics. Krauthgamer R, ed. Proc. 27th Annual ACM–SIAM Sympos. Discrete Algorithms (Society for Industrial and Applied Mathematics, Philadelphia), 754–765.Google Scholar
• Coutinho WP, do Nascimento RQ, Pessoa AA, 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
• de Berg M, Gudmundsson J, Katz MJ, Levcopoulos C, Overmars MH, van der Stappen AF (2005) TSP with neighborhoods of varying size. J. Algorithms 57(1):22–36.Crossref, Google Scholar
• Dumitrescu A, Mitchell JSB (2003) Approximation algorithms for TSP with neighborhoods in the plane. J. Algorithms 48(1):135–159.Crossref, Google Scholar
• Gambella C, Lodi A, Vigo D (2018) Exact solutions for the carrier–vehicle traveling salesman problem. Transportation Sci. 52(2):320–330.Link, Google Scholar
• Garone E, Determe JF, Naldi R (2014) Generalized traveling salesman problem for carrier-vehicle systems. J. Guidance Control Dynam. 37(3):776–774.Crossref, Google Scholar
• Garone E, Naldi R, Casavola A (2011) Traveling salesman problem for a class of carrier-vehicle systems. J. Guidance Control Dynam. 34(4):766–774.Crossref, Google Scholar
• Garone E, Naldi R, Casavola A, Frazzoli E (2008) Cooperative path planning for a class of carrier-vehicle systems. Proc. 47th IEEE Conf. Decision Control (Institute of Electrical and Electronics Engineers, Piscataway, NJ), 2456–2462.Google Scholar
• Garone E, Naldi R, Casavola A, Frazzoli E (2010a) Planning algorithms for a class of heterogeneous multi-vehicle systems. Proc. 8th IFAC Sympos. Nonlinear Control Systems (Elsevier, Netherlands), 969–974.Google Scholar
• Garone E, Naldi R, Casavola A, Frazzoli E (2010b) Cooperative mission planning for a class of carrier-vehicle systems. Proc. 49th IEEE Conf. Decision Control (Institute of Electrical and Electronics Engineers, Piscataway, NJ), 1354–1359.Google Scholar
• Groër C, Golden B, Wasil E (2010) A library of local search heuristics for the vehicle routing problem. Math. Programming Comput. 2(2):79–101.Crossref, Google Scholar
• Gulczynski DJ, Heath JW, Price CC (2006) The close enough traveling salesman problem: A discussion of several heuristics. Alt FB, Fu MC, Golden BL, eds. Perspectives in Operations Research: Papers in Honor of Saul Gass’ 80th Birthday (Springer, Boston), 271–283.Crossref, Google Scholar
• Ha QM, Deville Y, Pham QD, Ha MH (2018) On the min-cost traveling salesman problem with drone. Transportation Res. Part C: Emerging Tech. 86(January):597–621.Crossref, Google Scholar
• Klaučo M, Blažek S, Kvasnica M, Fikar M (2014) Mixed-integer SOCP formulation of the path planning problem for heterogeneous multi-vehicle systems. Eur. Control Conf. (Institute of Electrical and Electronics Engineers, Piscataway, NJ), 1474–1479.Google Scholar
• Mitchell JSB (2007) A PTAS for TSP with neighborhoods among fat regions in the plane. Proc. 18th Annual ACM–SIAM Sympos. Discrete Algorithms (Society for Industrial and Applied Mathematics, Philadelphia), 11–18.Google Scholar
• Murray CC, Chu AG (2015) The flying sidekick traveling salesman problem: Optimization of drone-assisted parcel delivery. Transportation Res. Part C: Emerging Tech. 54(May):86–109.Crossref, Google Scholar
• Murray CC, Raj R (2020) The multiple flying sidekicks traveling salesman problem: Parcel delivery with multiple drones. Transportation Res. Part C: Emerging Tech. 110(January):368–398.Crossref, Google Scholar
• Murray RM (2007) Recent research in cooperative control of multivehicle systems. J. Dynamic Systems Measurement Control 129(5):571–583.Crossref, Google Scholar
• Poikonen S, Golden B (2020) The mothership and drone routing problem. INFORMS J. Comput. 32(2):249–262Link, Google Scholar
• Poikonen S, Golden BL, Wasil EA (2019) A branch-and-bound approach to the traveling salesman problem with a drone. INFORMS J. Comput. 31(2):335–346.Link, Google Scholar
• Safra S, Schwartz O (2006) On the complexity of approximating TSP with neighborhoods and related problems. Comput. Complexity 14(4):281–307.Crossref, Google Scholar
• Saleu RGM, Deroussi L, Feillet D, Grangeon N, Quilliot A (2018) An iterative two-step heuristic for the parallel drone scheduling traveling salesman problem. Networks 72(4):459–474.Crossref, Google Scholar
• Subramanian A, Uchoa E, Ochi LS (2013) A hybrid algorithm for a class of vehicle routing problems. Comput. Oper. Res. 40(10):2519–2531.Crossref, Google Scholar
• United Nations Environment Programme (2005) After the tsunami: Rapid environmental assessment. Accessed April 17, 2020, http://wedocs.unep.org/bitstream/handle/20.500.11822/8372/-After%20the%20Tsunami_%20Rapid%20Environmental%20Assessment-20053636.pdf?sequence=3&isAllowed=y.Google Scholar