Downloads: 2 | Views: 200 | Weekly Hits: ⮙1 | Monthly Hits: ⮙1

Experimental Result Paper | Computer Science & Engineering | India | Volume 11 Issue 11, November 2022 | Popularity: 5.1 / 10

Rate This Article!      

Exploring a Minimum Cost Solution for Traveling Salesman Problem using Parallel Simulated Annealing

Geerisha Jain, Dr. Anto S, Dewang Mehta

Abstract: In this paper, we extend the traditional Simulated Annealing (SA) algorithm to provide a modified version with incorporated parallel processing. The algorithm is used to solve the NP-hard Traveling Salesman problem in which there is a specified map of cities, and the algorithm aims to discover the shortest and the most optimized route that begins at one point, travels once through all the cities, and then returns to the initial point. The main objective is to discover the likelihood of having a zero-cost path with n cities and p processors specifically where they run in parallel. To achieve this analysis, simulation was performed, and the results obtained proved that the proposed method showed promising results in terms of finding a zero-cost path in lesser execution time when running for a large number of processes on parallel processors.

Keywords: Travelling Salesman Problem, TSP, Simulated Annealing, minimum cost solution, optimization, Parallel Computing

Edition: Volume 11 Issue 11, November 2022

Pages: 667 - 674

DOI: https://www.doi.org/10.21275/SR221030104342

Make Sure to Disable the Pop-Up Blocker of Web Browser

Click to Cite this Article