Schneider, Johannes and Dankesreiter, Markus and Fettes, Werner and Morgenstern, Ingo and Schmid, Martin and Singer, Johannes Maria (1997) Search-space smoothing for combinatorial optimization problems. PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 243 (1-2). pp. 77-112. ISSN 0378-4371, 1873-2119
Full text not available from this repository.Abstract
Commonly there are two types of local search approaches known to treat combinatorial optimization problems with very complex search-space structure: One is to introduce very complicated types of local move classes, allowing a bypass of high energetic barriers separating different minima. The second is introducing a control-parameter (i.e. temperature in physics terminology) dependent state space walker, which is - depending on this control parameter - more or less easily able to climb over barriers. A third, less well-known, but very obvious approach is to smooth the search space, i.e. to eliminate barriers between low-energy configurations and therefore to allow a fast and easy approach to the global optimum. This procedure will be discussed in depth in the following work.
| Item Type: | Article |
|---|---|
| Uncontrolled Keywords: | TRAVELING SALESMAN PROBLEMS; ALGORITHM; optimization; Monte Carlo; traveling salesman; great deluge; smoothing; local search |
| Subjects: | 500 Science > 530 Physics |
| Divisions: | Physics > Institute of Theroretical Physics > Professor Morgenstern > Group Ingo Morgenstern |
| Depositing User: | Dr. Gernot Deinzer |
| Date Deposited: | 30 Mar 2023 07:44 |
| Last Modified: | 30 Mar 2023 07:44 |
| URI: | https://pred.uni-regensburg.de/id/eprint/50628 |
Actions (login required)
 |
View Item |
