A new simulated annealing approach for travelling salesman problem (Q1649249)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6898846
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new simulated annealing approach for travelling salesman problem |
scientific article; zbMATH DE number 6898846 |
Statements
A new simulated annealing approach for travelling salesman problem (English)
0 references
5 July 2018
0 references
Summary: The aim of this study is to improve searching capability of simulated annealing (SA) heuristic through integration of two new neighborhood mechanisms. Due to its ease of formulation, difficulty to solve and various real life applications several Travelling Salesman Problems (TSP) were selected from the literature for the testing of the proposed methods. The proposed methods were also compared to conventional SA with swap neighborhood. The results have shown that the proposed techniques are more effective than conventional SA, both in terms of solution quality and time.
0 references
simulated annealing
0 references
travelling salesman problem
0 references
roulette wheel selection
0 references
meta-heuristics
0 references
0.8042588829994202
0 references
0.7981446981430054
0 references
0.779007077217102
0 references
0.7788681983947754
0 references
