Parallel Simulated Annealing Algorithms in Global Optimization

  • Authors:

  • Esin Onbaş/oğ/lu;Linet Ö/zdamar

  • Affiliations:

  • Yeditepe University, Department of Computer Engineering/;Yeditepe University, Department of Systems Engineering, Gayrettepe Emekli Subay Evleri 23/5, Istanbul, Turkey (e-mail: lozdamar@hotmail.com)

  • Venue:
  • Journal of Global Optimization
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

Global optimization involves the difficult task of the identification of global extremities of mathematical functions. Such problems are often encountered in practice in various fields, e.g., molecular biology, physics, industrial chemistry. In this work, we develop five different parallel Simulated Annealing (SA) algorithms and compare them on an extensive test bed used previously for the assessment of various solution approaches in global optimization. The parallel SA algorithms consist of various categories: the asynchronous approach where no information is exchanged among parallel runs and the synchronous approaches where solutions are exchanged using genetic operators, or where solutions are transmitted only occasionally, or where highly coupled synchronization is achieved at every iteration. One of these approaches, which occasionally applies partial information exchanges (controlled in terms of solution quality), provides particularly notable results for functions with vast search spaces of up to 400 dimensions. Previous attempts with other approaches, such as sequential SA, adaptive partitioning algorithms and clustering algorithms, to identify the global optima of these functions have failed without exception.