Numerical Approach of Symmetric Traveling Salesman Problem Using Simulated Annealing
The aim of this paper is to elaborate the performance of Simulated Annealing (SA) algorithm for solving traveling salesmen problems. In this paper, SA algorithm is modified by using the interaction between outer and inner loop of algorithm. This algorithm produces low standard deviation and fast com...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Ikatan Ahli Informatika Indonesia
2021-12-01
|
| Series: | Jurnal RESTI (Rekayasa Sistem dan Teknologi Informasi) |
| Subjects: | |
| Online Access: | http://jurnal.iaii.or.id/index.php/RESTI/article/view/3549 |
| _version_ | 1797331507061194752 |
|---|---|
| author | I Iryanto Putu Harry Gunawan |
| author_facet | I Iryanto Putu Harry Gunawan |
| author_sort | I Iryanto |
| collection | DOAJ |
| description | The aim of this paper is to elaborate the performance of Simulated Annealing (SA) algorithm for solving traveling salesmen problems. In this paper, SA algorithm is modified by using the interaction between outer and inner loop of algorithm. This algorithm produces low standard deviation and fast computational time compared with benchmark algorithms from several research papers. Here SA uses a certain probability as indicator for finding the best and worse solution. Moreover, the strategy of SA as cooling to temperature ratio is still given. Thirteen benchmark cases and thirteen square grid symmetric TSP are used to see the performance of the SA algorithm. It is shown that the SA algorithm has promising results in finding the best solution of the benchmark cases and the squared grid TSP with relative error 0 - 7.06% and 0 – 3.31%, respectively. Further, the SA algorithm also has good performance compared with the well-known metaheuristic algorithms in references. |
| first_indexed | 2024-03-08T07:35:34Z |
| format | Article |
| id | doaj.art-c9f7415b7c0441e8ad70a2e93d343e59 |
| institution | Directory Open Access Journal |
| issn | 2580-0760 |
| language | English |
| last_indexed | 2024-03-08T07:35:34Z |
| publishDate | 2021-12-01 |
| publisher | Ikatan Ahli Informatika Indonesia |
| record_format | Article |
| series | Jurnal RESTI (Rekayasa Sistem dan Teknologi Informasi) |
| spelling | doaj.art-c9f7415b7c0441e8ad70a2e93d343e592024-02-02T19:04:44ZengIkatan Ahli Informatika IndonesiaJurnal RESTI (Rekayasa Sistem dan Teknologi Informasi)2580-07602021-12-01561090109810.29207/resti.v5i6.35493549Numerical Approach of Symmetric Traveling Salesman Problem Using Simulated AnnealingI Iryanto0Putu Harry GunawanPoliteknik Negeri IndramayuThe aim of this paper is to elaborate the performance of Simulated Annealing (SA) algorithm for solving traveling salesmen problems. In this paper, SA algorithm is modified by using the interaction between outer and inner loop of algorithm. This algorithm produces low standard deviation and fast computational time compared with benchmark algorithms from several research papers. Here SA uses a certain probability as indicator for finding the best and worse solution. Moreover, the strategy of SA as cooling to temperature ratio is still given. Thirteen benchmark cases and thirteen square grid symmetric TSP are used to see the performance of the SA algorithm. It is shown that the SA algorithm has promising results in finding the best solution of the benchmark cases and the squared grid TSP with relative error 0 - 7.06% and 0 – 3.31%, respectively. Further, the SA algorithm also has good performance compared with the well-known metaheuristic algorithms in references.http://jurnal.iaii.or.id/index.php/RESTI/article/view/3549simulated annealing, traveling salesman problem, symmetric tsp, square grid tsp |
| spellingShingle | I Iryanto Putu Harry Gunawan Numerical Approach of Symmetric Traveling Salesman Problem Using Simulated Annealing Jurnal RESTI (Rekayasa Sistem dan Teknologi Informasi) simulated annealing, traveling salesman problem, symmetric tsp, square grid tsp |
| title | Numerical Approach of Symmetric Traveling Salesman Problem Using Simulated Annealing |
| title_full | Numerical Approach of Symmetric Traveling Salesman Problem Using Simulated Annealing |
| title_fullStr | Numerical Approach of Symmetric Traveling Salesman Problem Using Simulated Annealing |
| title_full_unstemmed | Numerical Approach of Symmetric Traveling Salesman Problem Using Simulated Annealing |
| title_short | Numerical Approach of Symmetric Traveling Salesman Problem Using Simulated Annealing |
| title_sort | numerical approach of symmetric traveling salesman problem using simulated annealing |
| topic | simulated annealing, traveling salesman problem, symmetric tsp, square grid tsp |
| url | http://jurnal.iaii.or.id/index.php/RESTI/article/view/3549 |
| work_keys_str_mv | AT iiryanto numericalapproachofsymmetrictravelingsalesmanproblemusingsimulatedannealing AT putuharrygunawan numericalapproachofsymmetrictravelingsalesmanproblemusingsimulatedannealing |