The Traveling Salesman Problem (TSP) is a challenging
computational problem in combinatorial optimization
that aims to visit all cities exactly once and return to the first
city. Despite numerous theoretical solutions proposed, finding the
exact optimal solution remains computationally infeasible due
to the NP-hard nature of the problem. To address this, many
heuristic and optimization approaches have been developed to
generate probabilistic results that are often approximations. This
paper presents a comparison between four popular algorithms:
steepest ascent hill climbing, simulated annealing, a genetic
algorithm with partially matched crossover, and Particle Swarm
Optimization (PSO). The study examines how these algorithms
can solve problems and avoid local minimum values while achieving
a balance between research exploration and exploitation for
an optimal solution. For a relatively large number of cities, the
simulated annealing algorithm and genetic algorithm produced
very goo

Conference Title

First International Conference & Expo on Innovation and Sustainability in Engineering & Technology

Conference Country

Palestine

Conference Date

June 14, 2023 - June 15, 2023

Conference Sponsor

An-Najah National University

Additional Info

Conference Website