Simulated annealing with opposite neighbors

Mario Ventresca, Hamid R. Tizhoosh

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

Abstract

This paper presents an improvement to the vanilla version of the simulated annealing algorithm by using opposite neighbors. This new technique, is based on the recently proposed idea of opposition based learning, as such our proposed algorithm is termed opposition-based simulated annealing (OSA). In this paper we provide a theoretical basis for the algorithm as well as its practical implementation. In order to examine the efficacy of the approach we compare the new algorithm to SA on six common real optimization problems. Our findings confirm the theoretical predictions as well as show a significant improvement in accuracy and convergence rate over traditional SA. We also provide experimental evidence for the use of opposite neighbors over purely random ones.

Original languageEnglish (US)
Title of host publicationProceedings of the 2007 IEEE Symposium on Foundations of Computational Intelligence, FOCI 2007
Pages186-192
Number of pages7
DOIs
StatePublished - 2007
Event2007 IEEE Symposium on Foundations of Computational Intelligence, FOCI 2007 - Honolulu, HI, United States
Duration: Apr 1 2007Apr 5 2007

Publication series

NameProceedings of the 2007 IEEE Symposium on Foundations of Computational Intelligence, FOCI 2007

Conference

Conference2007 IEEE Symposium on Foundations of Computational Intelligence, FOCI 2007
Country/TerritoryUnited States
CityHonolulu, HI
Period4/1/074/5/07

Keywords

  • Opposition based learning
  • Optimization
  • Simulated annealing

ASJC Scopus subject areas

  • Artificial Intelligence
  • Software
  • General Mathematics

Fingerprint

Dive into the research topics of 'Simulated annealing with opposite neighbors'. Together they form a unique fingerprint.

Cite this