1988
DOI: 10.1007/bf01022991
|View full text |Cite
|
Sign up to set email alerts
|

A quantitative analysis of the simulated annealing algorithm: A case study for the traveling salesman problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
41
0

Year Published

1990
1990
2014
2014

Publication Types

Select...
3
2
2

Relationship

0
7

Authors

Journals

citations
Cited by 102 publications
(41 citation statements)
references
References 10 publications
0
41
0
Order By: Relevance
“…at least one pair of algorithms (9) As results of solution quality in Table 11 -Table 12, it was found that for all algorithms, there is significant difference (p-value < 0.05) among those algorithms. ACS outperforms GA on all four TTP problems (BN, CT, NT and NET), TS on three TTP problems (CT, NT and NET) and CS on one TTP problem (NET).…”
Section: Resultsmentioning
confidence: 94%
See 1 more Smart Citation
“…at least one pair of algorithms (9) As results of solution quality in Table 11 -Table 12, it was found that for all algorithms, there is significant difference (p-value < 0.05) among those algorithms. ACS outperforms GA on all four TTP problems (BN, CT, NT and NET), TS on three TTP problems (CT, NT and NET) and CS on one TTP problem (NET).…”
Section: Resultsmentioning
confidence: 94%
“…However, the optimum solution could not be guaranteed. Up to date, the metaheuristic optimization techniques have been applied to solve the TPS and TTP problems, for example simulated annealing (SA) [9], artificial neural network (ANN) [10], tabu search (TS) [11], genetic algorithms (GA) [12], scatter search [13], particle swarm optimization [14], ant colony optimization [15] and adaptive tabu search (ATS) [16].…”
Section: Introductionmentioning
confidence: 99%
“…The value of the constant used in Eq. 9 for scaling AE affects the acceptance probability for transitions involving uphill excursions of E. Tests were performed with the Aarts et al [12] schedule with an initial temperature set to T = 2 to determine an appropriate constant.…”
Section: Methodsmentioning
confidence: 99%
“…Simulated annealing is a general technique that can be used to minimize any problem in a discrete space. It has been successfully applied to: the travelling salesman problem (TSP) [11,12], the placement of standard cells in circuit design [13], the minimization of the Hamiltonian for flips of spins in spin glasses [11,14], the quadratic assignment problem [15,16], the football pools [17] and crystallographic refinement of proteins [18,19]. A considerable number of algorithms exist for simulated annealing and they differ in important respects; the principal differences are how they handle the temperature decrement, the length of the Markov chains and the stop criterion.…”
Section: Simulated Annealingmentioning
confidence: 99%
See 1 more Smart Citation