Free Search – comparative analysis 100. (1st January 2014)

• Record Type: Journal Article
• Authors: Penev, Kalin
• Is Part Of: International journal of metaheuristics. Volume 3:Number 2(2014)
• Page Start: 118
• Page End: 132
• Publication Date: 2014-01-01
• Subjects: multidimensional optimisation -- adaptive search algorithms -- Free Search -- FS -- differential evolution -- particle swarm optimisation -- PSO; Heuristic algorithms -- Periodicals; 006.3105
• Languages: English
• ISSNs: 1755-2176

Abstract

Search methods' abilities for adaptation to various multidimensional tasks where optimisation parameters are hundreds, thousands and more, without retuning of algorithms' parameters seems to be a great challenge for modern computational intelligence. Many evolutionary, swarm and adaptive methods, which perform well on numerical tests with up to ten dimensions are suffering insuperable stagnation when applied to 100 and more dimensional tests. This article presents a comparison between particle swarm optimisation, differential evolution both with enhanced adaptivity and Free Search applied to 100 multidimensional heterogeneous real-value numerical tests. The aim is to extend the knowledge on how high dimensionality reflects on search space complexity, in particular to identify minimal time and minimal number of objective function evaluations required by used methods for reaching acceptable solution with non-zero probability on tasks with high dimensions' number. The achieved experimental results are summarised and analysed. Brief discussion on concepts, which support search methods effectiveness, concludes the article.