2. Overview ● Introduction
● Traveling Salesman
Problem
● Best Solution
● Heuristic Solution
● Conclusion
3. Introduction
Travelling Salesman problem is in which is to find a shortest possible route that visits
every city exactly once and returns to the starting point.
In this Travelling Salesman problem we are going to find a optimal solution through
various solution obtain in which the best solution will be based on slate space or heuristic
search
4. Traveling Salesman
Problem
The Travelling Salesman Problem(TSP) is the challenge of finding the shortest yet most
efficient route for a person to take given a list of specific destinations. The problem can be
solved by analyzing every round-trip route to determine the shortest one.
5.
6.
7.
8. Best Solution
In this problem the best solution is by finding the route that takes minimum amount of
time with minimum amount of cost.By this we get two possible solution.
9.
10. Heuistic Solution
Heuristic search refers to a search strategy that attempts to optimize a problem by
iteratively improving the solution based on a given heuristic function or a cost measure.
The exact strategy is dependent on the intercity fare structure and values of the cities. The
approach that taken to solve the traveling sales- man problem is to construct a route by
successively including cities into the tour based on their "attractiveness" as measured by a
heuristic cost function.
11. Conclusion
Further traveling salesman problem are considered which are the special case of degree
constrained spanning tree problem. For this problem various functions have been
developed and experimented, and it has been shown that how does it help in decision
making.
