Journal of Global Optimization

, Volume 11, Issue 4, pp 377–385

A Numerical Comparison of Some Modified Controlled Random Search Algorithms

  • M. M. Ali
  • A. Törn
  • S. Viitanen
Article

DOI: 10.1023/A:1008236920512

Cite this article as:
Ali, M.M., Törn, A. & Viitanen, S. Journal of Global Optimization (1997) 11: 377. doi:10.1023/A:1008236920512

Abstract

In this paper we propose a new version of the Controlled Random Search(CRS) algorithm of Price. The new algorithmhas been tested on thirteen global optimization test problems. Numericalexperiments indicate that the resulting algorithm performs considerablybetter than the earlier versions of the CRS algorithms. The algorithm,therefore, could offer a reasonable alternative to many currently availablestochastic algorithms, especially for problems requiring ’direct search‘type methods. Also a classification of the CRS algorithms is made based on’global technique‘ – ’local technique‘ and the relative performance ofclasses is numerically explored.

Global optimization β-distribution controlled random search 
Download to read the full article text

Copyright information

© Kluwer Academic Publishers 1997

Authors and Affiliations

  • M. M. Ali
    • 1
  • A. Törn
    • 2
  • S. Viitanen
    • 2
  1. 1.Turku Center for Computer Science (TUCS)TurkuFinland
  2. 2.Department of Computer ScienceÅbo Akademi UniversityFinland

Personalised recommendations