Search-space smoothing for combinatorial optimization problems

DOI to cite this document:: 10.5283/epub.16113

Schneider, Johannes ; Dankesreiter, Markus ; Fettes, Werner ; Morgenstern, Ingo ; Schmid, Martin ; Singer, Johannes Maria

PDF
(1MB) - Repository staff only

Date of publication of this fulltext: 09 Aug 2010 12:25

Alternative links to fulltext:DOI

Details

Export bibliographical data

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 ...