Optimizing the Modified Lam Annealing Schedule

Cicirello, Vincent (2021) Optimizing the Modified Lam Annealing Schedule. EAI Endorsed Transactions on Industrial Networks and Intelligent Systems, 7 (25). p. 167653. ISSN 2410-0218

[img]
Preview
Text
eai.16-12-2020.167653.pdf
Available under License Creative Commons Attribution No Derivatives.

Download (2MB) | Preview

Abstract

Simulated annealing is a metaheuristic commonly used for combinatorial optimization in many industrial applications. Its runtime behavior is controlled by an algorithmic component known as the annealing schedule. The classic annealing schedules have control parameters that must be set or tuned ahead of time. Adaptive annealing schedules, such as the Modified Lam, are parameter-free and self-adapt during runtime. However, they are also more complex than the classic alternatives, leading to more time per iteration. In this paper, we present an optimized variant of Modified Lam annealing, and experimentally demonstrate the potential significant impact on runtime performance of carefully optimizing the annealing schedule.

Item Type: Article
Uncontrolled Keywords: simulated annealing, modified Lam, self-adaptive, parameter-free, combinatorial optimization
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
QA75 Electronic computers. Computer science
Depositing User: EAI Editor II.
Date Deposited: 21 Jan 2021 06:55
Last Modified: 21 Jan 2021 06:55
URI: https://eprints.eudl.eu/id/eprint/823

Actions (login required)

View Item View Item