Name
Abstract | ||
|---|---|---|
A variant of the simulated annealing algorithm, based on the generalized method of Bohachevsky et al., is proposed for continuous optimization problems. The algorithm automatically adjusts the step sizes to reflect the local slopes and function values, and it controls the random directions to point favorably toward potential improvements. Computational results on some well known functions show substantial improvements both in solution quality and efficiency. |
Year | DOI | Venue |
|---|---|---|
1996 | 10.1007/BF00248009 | Comp. Opt. and Appl. |
Keywords | Field | DocType |
algorithm,global optimization,hyper-spherical coordinates,random,variable step size | Simulated annealing,Continuous optimization,Hill climbing,Mathematical optimization,Global optimization,Adaptive simulated annealing,Random optimization,Mathematics | Journal |
Volume | Issue | Citations |
6 | 1 | 8 |
PageRank | References | Authors |
1.27 | 1 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| P. Patrick Wang | 1 | 41 | 4.75 |
| Der-san Chen | 2 | 12 | 2.08 |