A similarity-based neighbourhood search for enhancing the balance exploration–exploitation of differential evolution. (May 2020)

• Record Type: Journal Article
• Authors: Segredo, Eduardo; Lalla-Ruiz, Eduardo; Hart, Emma; Voß, Stefan
• Is Part Of: Computers & operations research. Volume 117(2020)
• Publication Date: 2020-05
• Subjects: Differential evolution -- Global search -- Diversity management -- Exploration -- Exploitation -- Large-scale continuous optimization; Operations research -- Periodicals; Electronic digital computers -- Periodicals; 004.05
• DOI: 10.1016/j.cor.2019.104871
• Languages: English
• ISSNs: 0305-0548

Abstract

Highlights: A novel approach that promotes a balance between exploration and exploitation. Adaptively promotes diversification and intensification based on the search progress. Hybridisation of this method with both explorative and exploitative variants of DE. The use of this approach with DE leads to better solutions on large-scale problems. Abstract: The success of search-based optimisation algorithms depends on appropriately balancing exploration and exploitation mechanisms during the course of the search. We introduce a mechanism that can be used with Differential Evolution (de ) algorithms to adaptively manage the balance between the diversification and intensification phases, depending on current progress. The method— Similarity-based Neighbourhood Search (sns )—uses information derived from measuring Euclidean distances among solutions in the decision space to adaptively influence the choice of neighbours to be used in creating a new solution. sns is integrated into explorative and exploitative variants of jade, one of the most frequently used adaptive de approaches. Furthermore, shade, which is another state-of-the-art adaptive de variant, is also considered to assess the performance of the novel sns . A thorough experimental evaluation is conducted using a well-known set of large-scale continuous problems, revealing that incorporating sns allows the performance of both explorative and exploitative variants of de to be significantly improved for a wide range of the test-cases considered. The method is also shown to outperform variants of de that are hybridised with a recently proposed global search procedure, designed to speed up the convergence of that algorithm.