International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
Volume 186 - Issue 14 |
Published: March 2024 |
Authors: Kalyan Kumar Mallick, Md. Fazle Rabbi Sweet, Tapan Kumar Biswas, Ramani Ranjan Sikder, Mahmudul Kabir, Md. Tareq Hasan |
![]() |
Kalyan Kumar Mallick, Md. Fazle Rabbi Sweet, Tapan Kumar Biswas, Ramani Ranjan Sikder, Mahmudul Kabir, Md. Tareq Hasan . A New Approach to Solve the Classical Symmetric Traveling Salesman Problem by Highest Suffix Method. International Journal of Computer Applications. 186, 14 (March 2024), 36-40. DOI=10.5120/ijca2024923498
@article{ 10.5120/ijca2024923498, author = { Kalyan Kumar Mallick,Md. Fazle Rabbi Sweet,Tapan Kumar Biswas,Ramani Ranjan Sikder,Mahmudul Kabir,Md. Tareq Hasan }, title = { A New Approach to Solve the Classical Symmetric Traveling Salesman Problem by Highest Suffix Method }, journal = { International Journal of Computer Applications }, year = { 2024 }, volume = { 186 }, number = { 14 }, pages = { 36-40 }, doi = { 10.5120/ijca2024923498 }, publisher = { Foundation of Computer Science (FCS), NY, USA } }
%0 Journal Article %D 2024 %A Kalyan Kumar Mallick %A Md. Fazle Rabbi Sweet %A Tapan Kumar Biswas %A Ramani Ranjan Sikder %A Mahmudul Kabir %A Md. Tareq Hasan %T A New Approach to Solve the Classical Symmetric Traveling Salesman Problem by Highest Suffix Method%T %J International Journal of Computer Applications %V 186 %N 14 %P 36-40 %R 10.5120/ijca2024923498 %I Foundation of Computer Science (FCS), NY, USA
This paper presents Highest Suffix method for solving the classical symmetric traveling salesman problem. This concept is an alternative method for solving Traveling Salesman problem (TSP). It is possible to further improve a TSP tour that cannot be improved by other local search methods. To test the performance of the proposed method, two examples are solved here. This is a new approach to solve the classical symmetric travelling salesman problem by highest suffix method. So, this paper shows that the proposed algorithm is efficient for solving the Traveling Salesman problem (TSP).