Authors: Kalin Penev
Addresses: Technology School, Maritime and Technology Faculty, Southampton Solent University, East Park Terrace, Southampton, SO14 0YN, UK
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.
Keywords: multidimensional optimisation; adaptive search algorithms; Free Search; differential evolution; particle swarm optimisation; PSO.
International Journal of Metaheuristics, 2014 Vol.3 No.2, pp.118 - 132
Received: 04 Oct 2013
Accepted: 28 Mar 2014
Published online: 03 Jul 2014 *