Scribd
Upload
15 views9 pages

Slide

Uploaded by

Ayomide Kola-ogunlade
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
15 views9 pages

Slide

Uploaded by

Ayomide Kola-ogunlade
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 9

Title: Traveling

Salesman Problem
Algorithm
Subtitle: Solving Optimization Problems in Graph Theory
Group Member
1. ALAO GLORY SOLAPE DU0634
2. OLADINI DIVINE.O DU0370
3. JOHN DAVID UKOABASI DU0309
4. DANIYAN VICTOR DU0917
Introduction to the Traveling
Salesman Problem
What is the Traveling Salesman Problem (TSP)?
• A problem in which a salesman must visit a set of cities, each exactly
once, and return to the starting city, minimizing the total travel
distance.
Importance of TSP
• Practical applications in logistics, planning, and manufacturing.
Problem Statement and Examples
Problem Statement
• Given a list of cities and the distances between each pair of cities, find
the shortest possible route that visits each city exactly once and
returns to the origin city.
Example Visualization
• A diagram showing a simple TSP instance with 4-5 cities and possible
routes.
Categories and Applications
Category
• Falls under Combinatorial Optimization and Graph Theory.

Applications
• Logistics (route planning for delivery trucks)
• Manufacturing (optimal path for robotic arms)
• DNA sequencing (aligning sequences)
Algorithms to Solve TSP
1. The brute-force approach
The brute-force approach, also known as the naive approach, calculates
and compares all possible permutations of routes or paths to
determine the shortest unique solution.
2. The nearest neighbor method
To implement the nearest neighbor algorithm, we begin at a randomly
selected starting point. From there, we find the closest unvisited node
and add it to the sequencing.
Traveling Salesman Problem
Algorithm Implementation
Example Algorithm: Nearest
Neighbor
Description
• Start from an arbitrary city, repeatedly visit the nearest unvisited city
until all cities are visited.
• Steps and Pseudocode
• Step-by-step explanation with pseudocode
Advantages and Disadvantages
• Simple and fast but may not yield the optimal solution.
Case Study or Simulation
Real-World Example
• A specific case study where TSP was applied (e.g., optimizing delivery
routes for a logistics company).
Simulation Results
• Graphs or charts showing the efficiency and performance of different
TSP algorithms.
Conclusion and Q&A
Summary
• The Travelling Salesman Problem (TSP) is a classic algorithmic problem
in the field of computer science and operations research, focusing on
optimization. It seeks the shortest possible route that visits every
point in a set of locations just once.
• Open the floor for questions and discussion.

You might also like