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: | I Iryanto, Putu Harry Gunawan |
---|---|
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 |
Similar Items
-
APPLICATION OF GENETIC ALGORITHMS TO THE TRAVELING SALESMAN PROBLEM
by: Tomasz SIKORA, et al.
Published: (2023-06-01) -
Complexity indices for the traveling salesman problem continued
by: Cvetković Dragoš, et al.
Published: (2021-01-01) -
Solving the Flying Sidekick Traveling Salesman Problem by a Simulated Annealing Heuristic
by: Vincent F. Yu, et al.
Published: (2023-10-01) -
Traveling Salesman Problem with Transportation
by: Valeriu Ungureanu
Published: (2006-09-01) -
A greedy randomized adaptive search procedure application to solve the travelling salesman problem
by: Alvaro Neuenfeldt Júnior, et al.
Published: (2019-12-01)