Everything about Travelling salesman problem

🧭 Start here: a 6-step reading path

1. Read the overview: Travelling salesman problemA 5-minute orientation
2. Skim a recent paper: A review of metaheuristic algorithms for solving TSP-based scheduling optimization problemsInfluential work since 2022
3. Pick up a classic book: Times Series Processor, version 4.3The most-reprinted book on the subject
4. Read the landmark paper: Bioaccessibility and health risk of arsenic and heavy metals (Cd, Co, Cr, Cu, Ni, Pb, Zn and Mn) in TSP and PM2.5 in Nanjing, ChinaCited 529 times
5. Go sideways: Bottleneck traveling salesman problemA closely related topic
6. Go sideways: Christofides algorithmA closely related topic

🏆 Landmark papers (most cited)

• Bioaccessibility and health risk of arsenic and heavy metals (Cd, Co, Cr, Cu, Ni, Pb, Zn and Mn) in TSP and PM2.5 in Nanjing, China

  Xin Hu, Yun Zhang, Zhuhong Ding · 2012 · Atmospheric Environment · 529 citations

• Analysis Of Htlv-I Proviral Load In 202 Ham/Tsp Patients And 243 Asymptomatic Htlv-I Carriers: High Proviral Load Strongly Predisposes To Ham/Tsp

  Masahiro Nagai, Koichiro Usuku, Wataru Matsumoto · 1998 · Journal of Neurovirology · 518 citations

• The ion chemistry, seasonal cycle, and sources of PM2.5 and TSP aerosol in Shanghai

  Ying Wang, Guoshun Zhuang, Xingying Zhang · 2006 · Atmospheric Environment · 468 citations

• Saharan dust contributions to PM10 and TSP levels in Southern and Eastern Spain

  S. Rodrı́guez, X. Querol, A. Alastuey · 2001 · Atmospheric Environment · 444 citations

• Particle swarm optimization-based algorithms for TSP and generalized TSP

  X.H. Shi, Y.C. Liang, H.P. Lee · 2007 · Information Processing Letters · 346 citations

• General k-opt submoves for the Lin–Kernighan TSP heuristic

  Keld Helsgaun · 2009 · Mathematical Programming Computation · 343 citations

• Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k -MST, and Related Problems

  Joseph S. B. Mitchell · 1999 · SIAM Journal on Computing · 306 citations

• Ionic composition of TSP and PM2.5 during dust storms and air pollution episodes at Xi'an, China

  Zhenxing Shen, Junji Cao, Richard Arimoto · 2009 · Atmospheric Environment · 303 citations

🆕 Influential since 2022

• A review of metaheuristic algorithms for solving TSP-based scheduling optimization problems

  Bladimir Toaza, Domokos Esztergár-Kiss · 2023 · Applied Soft Computing · 145 citations

• Improving Ant Colony Optimization efficiency for solving large TSP instances

  Rafał Skinderowicz · 2022 · Applied Soft Computing · 113 citations

• An Integrated Geometric Obstacle Avoidance and Genetic Algorithm TSP Model for UAV Path Planning

  Dipraj Debnath, Fernando Vanegas, Sebastien Boiteau · 2024 · Drones · 64 citations

• Sestrin2 remedies podocyte injury via orchestrating TSP-1/TGF-β1/Smad3 axis in diabetic kidney disease

  Shan Song, Chonglin Shi, Yawei Bian · 2022 · Cell Death & Disease · 57 citations

• Learning to Solve Multiple-TSP With Time Window and Rejections via Deep Reinforcement Learning

  Rongkai Zhang, Cong Zhang, Zhiguang Cao · 2023 · IEEE Transactions on Intelligent Transportation Systems · 56 citations

📚 Books worth reading

• 📕Times Series Processor, version 4.3Bronwyn H. Hall · 1995
• Econometric analysis with MicroTSP student softwareJames L. Doti, Esmael Adibi · 1988

Ranked by number of editions on Open Library, a rough measure of how lasting a book is.

🔗 Related topics

• Bottleneck traveling salesman problem The Bottleneck traveling salesman problem (bottleneck TSP) is a problem in discrete or combinatorial optimization. The problem is to find the Hamiltonian…
• Christofides algorithm The Christofides algorithm or Christofides–Serdyukov algorithm is an algorithm for finding approximate solutions to the travelling salesman problem, on…
• Approximation algorithm In computer science and operations research, approximation algorithms are efficient algorithms that find approximate solutions to optimization problems…
• Metric k-center In graph theory, the metric k-center problem or vertex k-center problem is a classical combinatorial optimization problem studied in theoretical computer…
• Greedy algorithm A greedy algorithm is an algorithm which, at each step, makes the choice that is locally optimal, and subsequently does not reconsider past choices. Greedy…
• Bitonic tour In computational geometry, a bitonic tour of a set of point sites in the Euclidean plane is a closed polygonal chain that has each site as one of its vertices…
• Vehicle routing problem The vehicle routing problem (VRP) is a combinatorial optimization and integer programming problem which asks "What is the optimal set of routes for a fleet…
• Combinatorial optimization Combinatorial optimization is a subfield of mathematical optimization that consists of finding an optimal object from a finite set of objects, where the…