Skip to search formSkip to main contentSkip to account menu

Travelling salesman problem

Known as: Salesperson Problem, Traveling salesmen problem, Metric tsp 
The travelling salesman problem (TSP) asks the following question: "Given a list of cities and the distances between each pair of cities, what is the… 
Wikipedia (opens in a new tab)

Related topics

Related topics

49 relations
3-optAPXAlgorithmic efficiencyAnt colony optimization algorithms

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2014
Highly Cited
2014
Discrete cuckoo search algorithm for the travelling salesman problem
In this paper, we present an improved and discrete version of the Cuckoo Search (CS) algorithm to solve the famous traveling… 
Highly Cited
2013
Highly Cited
2013
Computation of the travelling salesman problem by a shrinking blob
The travelling salesman problem (TSP) is a well known and challenging combinatorial optimisation problem. Its computational… 
Highly Cited
2013
Highly Cited
2013
On the Nearest Neighbor Algorithms for the Traveling Salesman Problem
In this study, a modification of the nearest neighbor algorithm (NND) for the traveling salesman problem (TSP) is researched. NN… 
Highly Cited
2011
Highly Cited
2011
New Variations of Order Crossover for Travelling Salesman Problem
Davis presented the order crossover operator for solving the travelling salesman problem (TSP) using genetic algorithm and has… 
Highly Cited
2010
Highly Cited
2010
Today's Traveling Salesman Problem
Heterogeneous unmanned aerial vehicles (UAVs) are being developed for several civil and military applications. These vehicles can… 
Highly Cited
2008
Highly Cited
2008
Advances in Meter Reading: Heuristic Solution of the Close Enough Traveling Salesman Problem over a Street Network
The use of automated meter reading (AMR) with radio frequency identification (RFID) technology allows utility companies to read… 
Highly Cited
1991
Highly Cited
1991
An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
This paper presents the development of new elimination tests which greatly enhance the performance of a relatively well… 
Highly Cited
1988
Highly Cited
1988
A Priori Solution of a Traveling Salesman Problem in Which a Random Subset of the Customers Are Visited
Consider a problem of routing through a set of n points. On any given instance of the problem, only a subset consisting of k out… 
Highly Cited
1985
Highly Cited
1985
Configuration space analysis of travelling salesman problems
The travelling salesman problem (TSP) and the Ising model of a spin glass are archetypes, respectively, of the combinatorial… 
Highly Cited
1979
Highly Cited
1979
On the symmetric travelling salesman problem I: Inequalities
We investigate several classes of inequalities for the symmetric travelling salesman problem with respect to their facet-defining… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)