A landscape-based analysis of fixed temperature and simulated annealing

•We extensively compare two variants of simulated annealing on different problems.•We automatically generate optimized versions of each algorithm for various scenarios.•We propose new features to study the behaviour of stochastic local search algorithms.•The behaviour of an optimal algorithm is rela...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:European journal of operational research Jg. 304; H. 2; S. 395 - 410
Hauptverfasser: Franzin, Alberto, Stützle, Thomas
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Elsevier B.V 16.01.2023
Schlagworte:
Automatic algorithm configuration
Exploratory landscape analysis
Metaheuristics
Simulated annealing
Stochastic local search
Automatic algorithm configuration
Exploratory landscape analysis
Stochastic local search
Metaheuristics
Simulated annealing
ISSN:0377-2217, 1872-6860
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:•We extensively compare two variants of simulated annealing on different problems.•We automatically generate optimized versions of each algorithm for various scenarios.•We propose new features to study the behaviour of stochastic local search algorithms.•The behaviour of an optimal algorithm is related to the landscape it encounters. Since the introduction of Simulated Annealing (SA), researchers have considered variants that keep the same temperature value throughout the whole search and tried to determine whether this strategy can be more effective than the original cooling scheme. Several studied have tried to answer this question without a conclusive answer and without providing indications that could be useful for a practical implementation. In this work, we address this question following an experimental approach, relating the characteristics of the algorithms with the characteristics of the landscapes they encounter. We use problem-independent landscape features to study the algorithmic behaviour across different problems. We consider three different objective functions and various instance classes and determine the conditions under which the fixed-temperature variant of SA can outperform its original counterpart and when SA is instead a better choice.
ISSN:0377-2217
1872-6860
DOI:10.1016/j.ejor.2022.04.014