A clustering-based differential evolution with parapatric and cross-generation selection Online publication date: Tue, 14-Sep-2021
by Xujie Tan; Seong-Yoon Shin
International Journal of Computational Vision and Robotics (IJCVR), Vol. 11, No. 5, 2021
Abstract: Differential evolution (DE) is one of the efficient evolutionary algorithms (EA) for continuous optimisation problems. It is commonly known that the mutation is one of the cores of the DE algorithm. However, the mutation strategies randomly selected from the current population can't be fully exploited to search the optimal solution, especially in the big data era. To provide some suitable parent individuals for the mutation strategies, it is essential to exploit the data-driven method for analysing the population data. Tensor decomposition, proven to be an efficient data processing method, can be used to provide data-driven services. We propose a novel data-driven mutation strategy for parent individuals selection, namely tensor-based DE with parapatric and cross-generation (TPCDE). To evaluate the effectiveness of the proposed TPCDE, a series of data-driven experiments are carried out on 13 benchmark functions. The experimental results indicate that TPCDE is an effective and efficient framework.
Online publication date: Tue, 14-Sep-2021
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computational Vision and Robotics (IJCVR):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email email@example.com