Free search: a comparative analysis

  • Authors:
  • Kalin Penev;Guy Littlefair

  • Affiliations:
  • Faculty of Technology, Southampton Institute, East Park Terrace, Southampton S014 OYN, UK;Faculty of Technology, Southampton Institute, East Park Terrace, Southampton S014 OYN, UK

  • Venue:
  • Information Sciences—Informatics and Computer Science: An International Journal
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

The article presents a novel population-based optimisation method, called Free Search (FS). Essential peculiarities of the new method are introduced. The aim of the study is to identify how robust is Free Search. Explored and compared are four different population-based optimisation methods, namely Genetic Algorithm (in real coded BLX-α modification), Particle Swarm Optimisation, Differential Evolution and Free Search. They are applied to five non-linear, heterogeneous, numerical, optimisation problems. The achieved results suggest that Free Search has stable robust behaviour on explored tests; FS can cope with heterogeneous optimisation problems; FS is applicable to unknown (black-box) real-world optimisation tasks.