The multiple traveling salesman problem: an overview of formulations and solution procedures

By Tolga Bektas. 2006

1,191 citations recorded by the source corpus.

Subfields: Automotive Engineering, Industrial and Manufacturing Engineering, Transportation

View Paper: https://www.semanticscholar.org/paper/9c9ef28845ec5c86c593bd08e099c0100bdbbdae

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Automotive Engineering

In Industrial and Manufacturing Engineering

In Transportation

Citations in the corpus

Traveling Salesman Problem: an Overview of Applications, Formulations, and Solution Approaches (2010, background): “However, when there is a single salesman, then the mTSP reduces to the TSP (Bektas, 2006).”
An Extension of the Lin-Kernighan-Helsgaun TSP Solver for Constrained Traveling Salesman and Vehicle Routing Problems: Technical report (2017, methodology): “Res., 28(3):628–32 (1980) [7] Jonker, R., Volgenant, T.: Technical Note -”
Cooperative Minimum Time Surveillance With Multiple Ground Vehicles (2010, methodology): “In particular the so called art gallery problems [13], [23], [24], multiple traveling salesman problems [47] and [48] and the information graph [43], [48] will be discussed below.”
Multi-robot Task Allocation: A Review of the State-of-the-Art (2015, background): “The mTSP can be formulated as follows [23]:”
A Comprehensive Survey on the Multiple Travelling Salesman Problem: Applications, Approaches and Taxonomy (2021, methodology): “Generally speaking, the MRTA consists of allocating a set of tasks to each robot while optimizing some given metrics [9, 34, 35, 36, 37, 38].”
The Social Engineering Optimizer (SEO) (2018, neutral): “…variable neighborhood search and also bat algorithm are reported to solve this problem (Osman, 1993; Gendreau et al., 1994; Rego and Roucairol, 1996; Barbarosoglu and Ozgur, 1999; Hiquebran et al., 1994; Bullnheimer et al., 1999; Baker and Ayechew, 2003; Sarasola et al., 2016; Zhou et al., 2016).”
A comprehensive taxonomy for multi-robot task allocation (2013, background): “These include the generalized assignment problem (Shmoys and Tardos, 1993; Savelsbergh, 1997), several machine scheduling problems (Brucker, 2001), the m-TSP (Bektas, 2006) and several forms of the vehicle routing problem (VRP) (Toth and Vigo, 2001).”
AoI-Minimal Trajectory Planning and Data Collection in UAV-Assisted Wireless Powered IoT Networks (2020, background): “As is known, the traveling salesman problem (TSP) is an NP-hard problem [42], which aims to ﬁnd the shortest loop to visit each city once and return to the end while 9: end for 10: Add V ( 0 ) = V ( M + 1 ) = S 0 to the paths and ﬁnd the minimum average AoI ¯ (cid:6) ; 11: Trace back to ﬁnd the…”