PRESENTATION ON

“TRAVELLING SALESMAN PROBLEM”

Bachelor of Technology
In
Information Technology

By
Shreya Chamalwar (9)
Pranoti Sahare (24)
Pratiksha Lanjewar (26)
Aditi Garade (46)
Priyanka Bains (50)

DEPT OF INFORMATION TECHNOLOGY ENGINEERING

JD COLLEGE OF ENGINEERING AND MANAGEMENT
NAGPUR
2019-20
Prof. Ashish Nanotkar Prof. Madhuri Pal
(Subject Incharge) (HOD IT-CSE)
THE TRAVELLING SALESMAN
PROBLEM
 CONTENTS

 Introduction
 Problem Statement
 Algorithm
 Example
 Application
 Advantages
 Disadvantages
 Conclusion
 References
 INTRODUCTION
 The Traveling Salesman Problem (often called TSP) is a classic algorithmic problem
in the field of computer science and operations research.

 It is focused on optimization. In this context, better solution often means a solution

that is cheaper, shorter, or faster.

 TSP is a mathematical problem. It is most easily expressed as a graph describing the

locations of a set of nodes.
 PROBLEM STATEMENT
 If there are n cities and cost of travelling from any city to any other city is given.

 Then we have to obtain the cheapest round-trip such that each city is visited
exactly ones returning to starting city, completes the tour.

 Typically travelling salesman problem is represent by weighted graph.

 ALGORITHM

C ({1}, 1) = 0
for s = 2 to n do
for all subsets S ∈ {1, 2, 3, …, n} of size s and containing 1
C (S, 1) = ∞
for all j ∈ S and j ≠ 1
C (S, j) = min (C (S – {j}, i) + d(i, j) for i∈ S and i≠ j }
Return minj C ({1, 2, 3, .., n}, j) + d(j, i)
 EXAMPLE
 Consider the following sets of cities :

Fig. A graph with weights on its edges

 The problem lies in finding a minimal path passing from all vertices once. For
example the path Path1 {A, B, C, D, E, A} and the path Path2 {A, B, C, E, D, A}
pass all the vertices but Path1 has a total length of 24 and Path2 has a total length
of 31.
 APPLICATIONS

 Printing press scheduling problem.

 School bus routing problem.
 Computing DNA sequences.
 Interview scheduling problem.
 Mission planning problem.
 Hot rolling scheduling problem.
 ADVANTAGES AND DISADVANTAGES
 For TSPs (Travelling Salesman Problem), relatively efficient.
 for a small number of nodes, TSPs can be solved by exhaustive search.
 for a large number of nodes, TSPs are very computationally difficult to solve
exponential time to convergence.
 Performs better against other global optimization techniques such as neutral net,
genetic algorithm, simulated annealing.
 Can be used in dynamic applications (adapts to changes such as new distances,
etc.)
 Convergence is guaranteed, but time to convergence uncertain.
 CONCLUSION
 The Traveling Salesman Problem has a long history and a strong tradition in
academics.

 The continued study of this problem coupled with novel and creative approaches
may some day yield a method that will lead to a polynomial-time solution for all
NP-complete problems.

 In the meantime, the study of this problem has yielded solutions that are “good
enough” for practical application – so good that often the search for an optimal
solution is not even worth the effort.
 REFERENCES
http://www.wikipedia.org

http://www.cs.duke.edu/

http://scef.unime.it/plebe/pubs/ICANN2002.ps.gz