Scribd
Upload
31 views7 pages

TSP Repport

Uploaded by

shams FCAI
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
31 views7 pages

TSP Repport

Uploaded by

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

‫‪Traveling Salesman problem‬‬

‫الرقم الجامعي‬ ‫أالسم‬

‫‪431005576‬‬ ‫رغد سليمان العطوي‬

‫‪431001631‬‬ ‫رغد خالد العنزي‬

‫‪431002669‬‬ ‫اماني رجاء العنزي‬

‫‪441009205‬‬ ‫امينة خالد المهري‬


 Introduction
The Traveling Salesman Problem (TSP) is a classic conundrum in
combinatorial optimization, aiming to find the shortest route that visits each
city exactly once and returns to the starting point. Initially formulated by
W.R. Hamilton in 1859 as the "Hamiltonian cycle problem," it has garnered
significant attention in the 20th century due to its relevance in various fields.

 Relevance in Various Fields


- Logistics and transportation: TSP plays a critical role in optimizing
delivery routes, reducing fuel consumption, and enhancing efficiency in
transportation networks.
- Manufacturing: It aids in planning efficient paths for assembly line
processes, optimizing tool paths, and minimizing production costs.
- Telecommunications: Essential for routing data packets, optimizing
communication networks, and minimizing latency in wireless
communication systems.

 Problem Statement
Objective: To determine the shortest possible route that visits each city
exactly once and returns to the original city.
Mathematical Formulation: Given a set of cities and the distances between
them, the goal is to find a Hamiltonian cycle, which is a closed loop that
visits each city exactly once and minimizes the total distance traveled.

 Constraints
1. Visit Each City Exactly Once: The solution must include every city in
the given set exactly once to satisfy the requirement of visiting each city.
2. Return to the Starting Point: The route must form a closed loop,
meaning the salesman must return to the original city after visiting all other
cities.
3. Minimize Total Distance: The objective is to minimize the total distance
traveled along the route, ensuring that it is the shortest path possible.

 Complexity
- Classification: TSP is classified as an NP-hard problem, indicating that it
is among the most challenging problems in the realm of optimization.
- No Polynomial-Time Solution: There is no known polynomial-time
algorithm to solve TSP optimally for large instances, contributing to its
complexity.
- Exponential Growth in Solutions: The number of possible solutions
grows exponentially with the number of cities, with (N-1)! possible routes
for N cities, excluding the starting city.
- Computational Overhead: Efficiently solving TSP requires considering
all possible combinations of cities, resulting in high computational overhead,
especially for large problem instances.

 Solution Approaches
 Exact Algorithms:
- Dynamic Programming: Guarantees an optimal solution by breaking down
the problem into smaller subproblems and solving them recursively.
However, it involves computing the shortest path by considering all possible
combinations of cities, leading to high computational complexity.

 Heuristic and Approximation Algorithms:


1. Nearest Neighbor:
- Overview: Starts with a random starting city and selects the nearest unvisited city at
each step until all cities are visited, then returns to the starting city to complete the tour.
- Advantages: Simple and easy to implement.
- Limitations: May not always produce optimal solutions.

2. Genetic Algorithm:
- Overview: Mimics natural selection to evolve a population of candidate solutions over
several generations.
- Advantages: Can handle large problem instances and explore a wide solution space
efficiently.
- Limitations: Requires parameter tuning and may not always converge to the optimal
solution.

3. Simulated Annealing:
- Overview: Starts with an initial solution and iteratively generates new candidate
solutions by making random changes and accepting them probabilistically based on a
decreasing temperature parameter.
- Advantages: Can escape local optima and explore diverse solution space.
- Limitations: Requires careful tuning of parameters and may converge slowly.

 EXAMPLE
▪ Problem Statement:
A tourist wants to visit a set of famous landmarks in a city during a day trip.
The tourist starts from a hotel located in the city center and plans to visit
each landmark exactly once before returning to the hotel. The objective is to
find the shortest route that allows the tourist to cover all landmarks while
minimizing the total distance traveled.

#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
using namespace std;
 Conclusion
The Traveling Salesman Problem (TSP) is a classic optimization problem that involves
finding the shortest possible route that visits a set of cities exactly once and returns to the
starting point. It's renowned for its NP-hard complexity, meaning that finding optimal
solutions becomes increasingly difficult as the number of cities grows.

▪ Solving TSP:
Exact algorithms like Branch and Bound guarantee optimality but become impractical for
large instances due to their computational complexity. Heuristic algorithms, such as
Nearest Neighbor, Genetic Algorithm, and Simulated Annealing, offer efficient solutions,
although they may not always produce the optimal result.

▪ Importance of TSP:
TSP plays a pivotal role in various domains such as logistics, transportation, and
manufacturing. By optimizing routes and sequences, TSP algorithms drive cost savings,
resource optimization, and operational efficiency, benefiting industries and consumers
alike.

▪ Critical Problem-Solving Tool:


TSP algorithms serve as indispensable tools for addressing complex optimization
challenges across industries. They enable businesses to meet customer demands
efficiently and competitively, contributing to overall business success and customer
satisfaction.

▪ Continued Relevance and Impact:


TSP algorithms remain actively employed in day-to-day operations, driving innovation
and practical implementation in diverse sectors. Their continued use contributes to
advancements in optimization techniques, enhancing efficiency and competitiveness in
modern industries.
 Resources
1. "Computational Complexity" by Christos H. Papadimitriou

2. "Approximation Algorithms" by Vijay V. Vazirani

3. "The Traveling Salesman Problem: A Computational Study" by


David L. Applegate, Robert E. Bixby, Vasek Chvátal, and William
J. Cook

4. "Simulated Annealing: Theory and Applications" by Earl D.


Davis and William W. Lam

You might also like