4.7 Article

A clustering-based differential evolution with different crowding factors for nonlinear equations system

Journal

APPLIED SOFT COMPUTING
Volume 98, Issue -, Pages -

Publisher

ELSEVIER
DOI: 10.1016/j.asoc.2020.106733

Keywords

Nonlinear equation systems; k-means clustering; Niching; Differential evolution

Funding

  1. National Natural Science Fund of China [62076225]
  2. Natural Science Fund for Distinguished Young Scholars of Hubei [2019CFA081]
  3. Fundamental Research Funds for the Central Universities, China University of Geosciences (Wuhan) [CUGGC03]
  4. National Natural Science Fund for Distinguished Young Scholars of China [61525304]
  5. Open Research Fund of the State Key Lab of Digital Manufacturing Equipment Technology [DMETKF2019018]

Ask authors/readers for more resources

This paper addresses the challenges of guiding populations towards multiple roots, dealing with individuals stuck in local optima, and minimizing replacement errors when using evolutionary algorithms for solving nonlinear equation systems. It introduces a one-step k-means clustering method combined with niching to help individuals search for different roots in their respective directions, proposes methods to form species to encourage individuals to escape local optima, and adopts different crowding factors to reduce replacement errors. The proposed KSDE shows great potential in locating multiple roots and outperforms other state-of-the-art methods in experimental evaluations on 30 NES problems.
Solving nonlinear equations systems (NESs) is one of the most important tasks in numerical computation. It is common that most NESs contain more than one root. Generally, these roots are equally important. Therefore, locating as many of these roots as possible is extremely useful; however, it is a difficult task. Recently, the use of evolutionary algorithms (EAs) for NESs has been given more consideration. There are several issues that need to be considered when applying EAs to solve NESs: (1) How to guide the population towards multiple roots, (2) how to tackle individuals which trip into local optimum, and (3) how to minimize replacement errors. In this paper, we deal with the first issue by introducing a one-step k-means clustering method combined with niching. In this way, individuals will search for different roots in their respective directions. For the second issue, we propose two methods to form species, the goal of which is to promote individuals to get rid of local optima. Finally, different crowding factors are adopted to reduce replacement errors. By assembling these improvements, a one-step k-means clustering based differential evolution, namely KSDE, is proposed. To evaluate the effectiveness of the proposal, we use 30 NES problems from the literature as the test suite. Experimental results demonstrate KSDE has great potential to locate multiple roots in a single run. Furthermore, according to the evaluation criteria, KSDE shows better performance compared with other state-of-the-art methods. (C) 2020 Elsevier B.V. All rights reserved.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available