Dynamic Programming Treatment of the Travelling Salesman Problem

@article{Bellman1962DynamicPT,
  title={Dynamic Programming Treatment of the Travelling Salesman Problem},
  author={Richard Bellman},
  journal={J. ACM},
  year={1962},
  volume={9},
  pages={61-63}
}
The well-known travelling salesman problem is the following: " A salesman is required ~,o visit once and only once each of n different cities starting from a base city, and returning to this city. [...] Key Result Results of this nature were independently obtained by M. Held and R. M. Karp, who are in the process of publishing some extensions and computat ional results.Expand
Environmental inspection routes and the constrained travelling system salesman problem
TLDR
The constrained version of the classical travelling salesman problem (TSP) is seen to be a generic model for a wide variety of problems, but some potential applications are in the areas of resource management, energy conservation and transportation.
The Traveling Salesman Problem: Deceptivley Easy to State; Notoriously Hard to Solve
The purpose of this thesis is to give an overview of the history of the Traveling Salesman Problem and to show how it has been an integral part of the development of the fields of Integer
A Binary Programming Solution to the Multiple-Depot, Multiple Traveling Salesman Problem with Constant Profits
TLDR
Results are presented that show the ability of the proposed solution to solve problems with various levels of city benets and compare these results to other MTSP variants.
Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization
  • Y. Salii
  • Computer Science
    Eur. J. Oper. Res.
  • 2019
TLDR
Through the restricted DP heuristic, the state-of-the-art upper bounds for all yet unsolved TSPLIB-based TD-SOP instances, including those with more than 100 cities are improved, and worst-case complexity estimates for DP in TSP-PC are improved.
A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem
Abstract Dynamic programming (DP) algorithms for the traveling salesman problem (TSP) can easily incorporate time dependent travel times, time windows, and precedence relationships which present
Parameterized Algorithms for the Traveling Purchaser Problem with Additional Constraints
TLDR
This work shows that TPP and some variants are fixed-parameter tractable by taking the number k of products or the number m of suppliers as the parameter, and W[2]-hard byTaking the number q of visited suppliers as a parameter.
Parameterized algorithms and complexity for the traveling purchaser problem and its variants
TLDR
This work shows that TPP and some variants are fixed-parameter tractable by taking the number k of products or the number m of suppliers as the parameter, and W[2]-hard byTaking the number q of visited suppliers as a parameter.
Improving variable neighborhood search to solve the traveling salesman problem
TLDR
A new algorithm for solving the TSP that uses the variable neighborhood search (VNS) algorithm coupled with a stochastic approach for finding the optimal solution is proposed.
Schema Analysis of the Traveling Salesman Problem Using Genetic Algorithms
TLDR
This paper provides a substantial proof GAs work for the traveling salesman problem (TSP) and suggests that the performance of probabilisti c search algorithms (such as GAs) is highly dependent on representation and t he choice of neighborhood operators.
Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane
  • R. Karp
  • Mathematics, Computer Science
    Math. Oper. Res.
  • 1977
TLDR
This work considers partitioning algorithms for the approximate solution of large instances of the traveling-salesman problem in the plane, in which partitioning is used in conjunction with existing heuristic algorithms.
...
1
2
3
4
5
...

References

SHOWING 1-3 OF 3 REFERENCES
Integer Programming Formulation of Traveling Salesman Problems
TLDR
The present paper provides yet another example of the versatility of integer programming as a mathematical modeling device by representing a generalization of the well-known “Travelling Salesman Problem” in integer programming terms.
On a Linear-Programming, Combinatorial Approach to the Traveling-Salesman Problem
This paper elaborates a method of attack on traveling-salesman problems, proposed by the authors in an earlier paper, in which linear programming is used to reduce the combinatorial magnitude of such
AND ZE~LIN, it. A. Integer programming formulation and travelling salesman problems
  • J. ACM
  • 1960