Simulated annealing with probabilistic analysis for solving traveling salesman problems

Simulated Annealing (SA) is a widely used meta-heuristic that was inspired from the annealing process of recrystallization of metals.Therefore, the efficiency of SA is highly affected by the annealing schedule. As a result, in this paper, we presented an empirical work to provide a comparable anneal...

Full description

Bibliographic Details
Main Authors: Hong, Pei Yee, Lim, Yai Fung, Ramli, Razamin, Khalid, Ruzelan
Format: Conference or Workshop Item
Published: 2013
Subjects:
_version_ 1825803071410667520
author Hong, Pei Yee
Lim, Yai Fung
Ramli, Razamin
Khalid, Ruzelan
author_facet Hong, Pei Yee
Lim, Yai Fung
Ramli, Razamin
Khalid, Ruzelan
author_sort Hong, Pei Yee
collection UUM
description Simulated Annealing (SA) is a widely used meta-heuristic that was inspired from the annealing process of recrystallization of metals.Therefore, the efficiency of SA is highly affected by the annealing schedule. As a result, in this paper, we presented an empirical work to provide a comparable annealing schedule to solve symmetric traveling salesman problems (TSP).Randomized complete block design is also used in this study. The results show that different parameters do affect the efficiency of SA and thus, we propose the best found annealing schedule based on the Post Hoc test.SA was tested on seven selected benchmarked problems of symmetric TSP with the proposed annealing schedule. The performance of SA was evaluated empirically alongside with benchmark solutions and simple analysis to validate the quality of solutions.Computational results show that the proposed annealing schedule provides a good quality of solution.
first_indexed 2024-07-04T05:50:54Z
format Conference or Workshop Item
id uum-12814
institution Universiti Utara Malaysia
last_indexed 2024-07-04T05:50:54Z
publishDate 2013
record_format eprints
spelling uum-128142014-12-09T09:59:18Z https://repo.uum.edu.my/id/eprint/12814/ Simulated annealing with probabilistic analysis for solving traveling salesman problems Hong, Pei Yee Lim, Yai Fung Ramli, Razamin Khalid, Ruzelan QA76 Computer software Simulated Annealing (SA) is a widely used meta-heuristic that was inspired from the annealing process of recrystallization of metals.Therefore, the efficiency of SA is highly affected by the annealing schedule. As a result, in this paper, we presented an empirical work to provide a comparable annealing schedule to solve symmetric traveling salesman problems (TSP).Randomized complete block design is also used in this study. The results show that different parameters do affect the efficiency of SA and thus, we propose the best found annealing schedule based on the Post Hoc test.SA was tested on seven selected benchmarked problems of symmetric TSP with the proposed annealing schedule. The performance of SA was evaluated empirically alongside with benchmark solutions and simple analysis to validate the quality of solutions.Computational results show that the proposed annealing schedule provides a good quality of solution. 2013 Conference or Workshop Item PeerReviewed Hong, Pei Yee and Lim, Yai Fung and Ramli, Razamin and Khalid, Ruzelan (2013) Simulated annealing with probabilistic analysis for solving traveling salesman problems. In: Proceedings of the International Conference on Mathematical Sciences and Statistics (ICMSS2013), 5–7 February 2013, Kuala Lumpur, Malaysia. http://dx.doi.org/10.1063/1.4823968 doi:10.1063/1.4823968 doi:10.1063/1.4823968
spellingShingle QA76 Computer software
Hong, Pei Yee
Lim, Yai Fung
Ramli, Razamin
Khalid, Ruzelan
Simulated annealing with probabilistic analysis for solving traveling salesman problems
title Simulated annealing with probabilistic analysis for solving traveling salesman problems
title_full Simulated annealing with probabilistic analysis for solving traveling salesman problems
title_fullStr Simulated annealing with probabilistic analysis for solving traveling salesman problems
title_full_unstemmed Simulated annealing with probabilistic analysis for solving traveling salesman problems
title_short Simulated annealing with probabilistic analysis for solving traveling salesman problems
title_sort simulated annealing with probabilistic analysis for solving traveling salesman problems
topic QA76 Computer software
work_keys_str_mv AT hongpeiyee simulatedannealingwithprobabilisticanalysisforsolvingtravelingsalesmanproblems
AT limyaifung simulatedannealingwithprobabilisticanalysisforsolvingtravelingsalesmanproblems
AT ramlirazamin simulatedannealingwithprobabilisticanalysisforsolvingtravelingsalesmanproblems
AT khalidruzelan simulatedannealingwithprobabilisticanalysisforsolvingtravelingsalesmanproblems