Revisiting simulated annealing: A component-based analysis

•We show how to collect and classify variants of Simulated Annealing (SA) algorithms.•We use automatic configuration to improve existing Simulated Annealing algorithms.•We show how to automatically design new state-of-the-art SA algorithms.•We study the components needed to design good SA algorithms...

Full description

Saved in:
Bibliographic Details
Published in:Computers & operations research Vol. 104; pp. 191 - 206
Main Authors: Franzin, Alberto, Stützle, Thomas
Format: Journal Article
Language:English
Published: New York Elsevier Ltd 01.04.2019
Pergamon Press Inc
Subjects:
Algorithms
Automatic algorithm design
Combinatorial analysis
Computer simulation
Experimental analysis
Metaheuristics
Operations research
Optimization
Permutations
Simulated annealing
Stochastic local search
Stochastic local search
Metaheuristics
Experimental analysis
Automatic algorithm design
Simulated annealing
ISSN:0305-0548, 1873-765X, 0305-0548
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:•We show how to collect and classify variants of Simulated Annealing (SA) algorithms.•We use automatic configuration to improve existing Simulated Annealing algorithms.•We show how to automatically design new state-of-the-art SA algorithms.•We study the components needed to design good SA algorithms on different scenarios. Simulated Annealing (SA) is one of the oldest metaheuristics and has been adapted to solve many combinatorial optimization problems. Over the years, many authors have proposed both general and problem-specific improvements and variants of SA. We propose to accumulate this knowledge into automatically configurable, algorithmic frameworks so that for new applications that wealth of alternative algorithmic components is directly available for the algorithm designer without further manual intervention. Here, we describe SA as an ensemble of algorithmic components, and describe SA variants from the literature within these components. We show the advantages of our proposal by (i) implementing existing algorithmic components of variants of SA, (ii) studying SA algorithms proposed in the literature, (iii) improving SA performance by automatically designing new state-of-the-art SA implementations and (iv) studying the role and impact of the algorithmic components based on experimental data. Our experiments consider three common combinatorial optimization problems, the quadratic assignment problem and two variants of the permutation flow shop problem.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0305-0548
1873-765X
0305-0548
DOI:10.1016/j.cor.2018.12.015