Tuned annealing for optimization

Mir M. Atiqullah, Singiresu S Rao

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

Abstract

The utility and capability of simulated annealing algorithm for generalpurpose engineering optimization is well established since introduced by Kirkpatrick et. al1. Numerous augmentations are proposed to make the algorithm effective in solving specific problems or classes of problems. Some proposed modifications were intended to enhance the performance of the algorithm in certain situations. Some specific research has been devoted to augment the convergence and related behavior of annealing algorithms by modifying its parameters, otherwise known as cooling schedule. Here we introduce an approach to tune the simulated annealing algorithm by combining algorithmic and parametric augmentations. Such tuned algorithm harnesses the benefits inherent in both types of augmentations resulting in a robust optimizer. The concept of ‘reheat’ in SA, is also used as another tune up strategy for the annealing algorithm. The beneficial effects of ‘reheat’ for escaping local optima are demonstrated by the solution of a multimodal optimization problem. Specific augmentations include handling of constraints, fast recovery from infeasible design space, immunization against premature convergence, and a simple but effective cooling schedule. Several representative optimization problems are solved to demonstrate effectiveness of tuning annealing algorithms.

Original languageEnglish (US)
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer Verlag
Pages669-679
Number of pages11
Volume2074
ISBN (Print)3540422331, 9783540422334
DOIs
StatePublished - 2001
EventInternational Conference on Computational Science, ICCS 2001 - San Francisco, United States
Duration: May 28 2001May 30 2001

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2074
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

OtherInternational Conference on Computational Science, ICCS 2001
CountryUnited States
CitySan Francisco
Period5/28/015/30/01

Fingerprint

Annealing
Augmentation
Optimization
Simulated Annealing Algorithm
Cooling
Schedule
Simulated annealing
Optimization Problem
Multimodal Optimization
Immunization
Premature Convergence
Tuning
Recovery
Engineering
Demonstrate

Keywords

  • Constrained optimization
  • Cooling schedule
  • Design optimization
  • Simulated annealing
  • Tuned annealing

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Atiqullah, M. M., & Rao, S. S. (2001). Tuned annealing for optimization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2074, pp. 669-679). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2074). Springer Verlag. https://doi.org/10.1007/3-540-45718-6_72

Tuned annealing for optimization. / Atiqullah, Mir M.; Rao, Singiresu S.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 2074 Springer Verlag, 2001. p. 669-679 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2074).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Atiqullah, MM & Rao, SS 2001, Tuned annealing for optimization. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 2074, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2074, Springer Verlag, pp. 669-679, International Conference on Computational Science, ICCS 2001, San Francisco, United States, 5/28/01. https://doi.org/10.1007/3-540-45718-6_72
Atiqullah MM, Rao SS. Tuned annealing for optimization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 2074. Springer Verlag. 2001. p. 669-679. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/3-540-45718-6_72
Atiqullah, Mir M. ; Rao, Singiresu S. / Tuned annealing for optimization. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 2074 Springer Verlag, 2001. pp. 669-679 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{4166e4a2833045a48a4559a2f77f52a1,
title = "Tuned annealing for optimization",
abstract = "The utility and capability of simulated annealing algorithm for generalpurpose engineering optimization is well established since introduced by Kirkpatrick et. al1. Numerous augmentations are proposed to make the algorithm effective in solving specific problems or classes of problems. Some proposed modifications were intended to enhance the performance of the algorithm in certain situations. Some specific research has been devoted to augment the convergence and related behavior of annealing algorithms by modifying its parameters, otherwise known as cooling schedule. Here we introduce an approach to tune the simulated annealing algorithm by combining algorithmic and parametric augmentations. Such tuned algorithm harnesses the benefits inherent in both types of augmentations resulting in a robust optimizer. The concept of ‘reheat’ in SA, is also used as another tune up strategy for the annealing algorithm. The beneficial effects of ‘reheat’ for escaping local optima are demonstrated by the solution of a multimodal optimization problem. Specific augmentations include handling of constraints, fast recovery from infeasible design space, immunization against premature convergence, and a simple but effective cooling schedule. Several representative optimization problems are solved to demonstrate effectiveness of tuning annealing algorithms.",
keywords = "Constrained optimization, Cooling schedule, Design optimization, Simulated annealing, Tuned annealing",
author = "Atiqullah, {Mir M.} and Rao, {Singiresu S}",
year = "2001",
doi = "10.1007/3-540-45718-6_72",
language = "English (US)",
isbn = "3540422331",
volume = "2074",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "669--679",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Tuned annealing for optimization

AU - Atiqullah, Mir M.

AU - Rao, Singiresu S

PY - 2001

Y1 - 2001

N2 - The utility and capability of simulated annealing algorithm for generalpurpose engineering optimization is well established since introduced by Kirkpatrick et. al1. Numerous augmentations are proposed to make the algorithm effective in solving specific problems or classes of problems. Some proposed modifications were intended to enhance the performance of the algorithm in certain situations. Some specific research has been devoted to augment the convergence and related behavior of annealing algorithms by modifying its parameters, otherwise known as cooling schedule. Here we introduce an approach to tune the simulated annealing algorithm by combining algorithmic and parametric augmentations. Such tuned algorithm harnesses the benefits inherent in both types of augmentations resulting in a robust optimizer. The concept of ‘reheat’ in SA, is also used as another tune up strategy for the annealing algorithm. The beneficial effects of ‘reheat’ for escaping local optima are demonstrated by the solution of a multimodal optimization problem. Specific augmentations include handling of constraints, fast recovery from infeasible design space, immunization against premature convergence, and a simple but effective cooling schedule. Several representative optimization problems are solved to demonstrate effectiveness of tuning annealing algorithms.

AB - The utility and capability of simulated annealing algorithm for generalpurpose engineering optimization is well established since introduced by Kirkpatrick et. al1. Numerous augmentations are proposed to make the algorithm effective in solving specific problems or classes of problems. Some proposed modifications were intended to enhance the performance of the algorithm in certain situations. Some specific research has been devoted to augment the convergence and related behavior of annealing algorithms by modifying its parameters, otherwise known as cooling schedule. Here we introduce an approach to tune the simulated annealing algorithm by combining algorithmic and parametric augmentations. Such tuned algorithm harnesses the benefits inherent in both types of augmentations resulting in a robust optimizer. The concept of ‘reheat’ in SA, is also used as another tune up strategy for the annealing algorithm. The beneficial effects of ‘reheat’ for escaping local optima are demonstrated by the solution of a multimodal optimization problem. Specific augmentations include handling of constraints, fast recovery from infeasible design space, immunization against premature convergence, and a simple but effective cooling schedule. Several representative optimization problems are solved to demonstrate effectiveness of tuning annealing algorithms.

KW - Constrained optimization

KW - Cooling schedule

KW - Design optimization

KW - Simulated annealing

KW - Tuned annealing

UR - http://www.scopus.com/inward/record.url?scp=48849095463&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=48849095463&partnerID=8YFLogxK

U2 - 10.1007/3-540-45718-6_72

DO - 10.1007/3-540-45718-6_72

M3 - Conference contribution

SN - 3540422331

SN - 9783540422334

VL - 2074

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 669

EP - 679

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

PB - Springer Verlag

ER -