Ransberger, Martin and Morgenstern, Ingo and Schneider, Johannes J. (2011) Influence of rounding errors on the quality of heuristic optimization algorithms. PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 390 (13). pp. 2571-2581. ISSN 0378-4371, 1873-2119
Full text not available from this repository. (Request a copy)Abstract
Search space smoothing and related heuristic optimization algorithms provide an alternative approach to simulated annealing and its variants: while simulated annealing traverses barriers in the energy landscape at finite temperatures, search space smoothing intends to remove these barriers, so that a greedy algorithm is sufficient to find the global minimum. Several formulas for smoothing the energy landscape have already been applied, one of them making use of the finite numerical precision on a computer. In this paper, we thoroughly investigate the effect of finite numerical accuracy on the quality of results achieved with heuristic optimization algorithms. We present computational results for the traveling salesman problem. (C) 2011 Elsevier B.V. All rights reserved.
| Item Type: | Article |
|---|---|
| Uncontrolled Keywords: | TRAVELING-SALESMAN PROBLEM; COMBINATORIAL OPTIMIZATION; PARALLEL ALGORITHM; LOCAL SEARCH; BACKBONES; Rounding error; Optimization; TSP; Simulated annealing; Search space smoothing |
| Subjects: | 500 Science > 530 Physics |
| Divisions: | Physics > Institute of Theroretical Physics Physics > Institute of Theroretical Physics > Alumni or Retired Professors > Professor Morgenstern Physics > Institute of Theroretical Physics > Alumni or Retired Professors |
| Depositing User: | Dr. Gernot Deinzer |
| Date Deposited: | 09 Jun 2020 06:21 |
| Last Modified: | 09 Jun 2020 06:21 |
| URI: | https://pred.uni-regensburg.de/id/eprint/20637 |
Actions (login required)
 |
View Item |
