.png){kind=icon}
.png){kind=icon}
Return
Solving Nonlinear Equations System With Dynamic Repulsion-Based Evolutionary Algorithms
.png){kind=icon}
PRE
AI
DOI：10.1109/TSMC.2018.2852798.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Nonlinear equations system (NES) arises commonly in science and engineering. Repulsion techniques are considered to be the effective methods to locate different roots of NES. In general, the repulsive radius needs to be given by the user before the run. However, its optimal parameter setting is difficult and problem-dependent. To alleviate this drawback, in this paper, we first propose a dynamic repulsion technique, and then a general framework based on the dynamic repulsion technique and evolutionary algorithms (EAs) is presented to effectively solve NES. The major advantages of our framework are: 1) the repulsive radius is controlled dynamically during the evolutionary process; 2) multiple roots of NES can be simultaneously located in a single run; 3) the diversity of the population is preserved due to the population reinitialization; and 4) different repulsion techniques and different EAs can be readily integrated into this framework. To extensively evaluate the performance of our framework, we choose 42 problems with diverse features as the test suite. In addition, some representative differential evolution and particle swarm optimization variants are incorporated into the framework. Our method is also compared with other state-of-the-art methods. Experimental results indicate that the dynamic repulsion technique can improve the performance of the original repulsion technique with static repulsive radius. Moreover, the proposed method is able to yield better results compared with other methods.
Keywords:
Heuristic algorithms
Optimization
Nonlinear equations
Evolutionary computation
Sociology
Statistics
Task analysis
Dynamic repulsive radius
evolutionary algorithms (EAs)
nonlinear equations system (NES)
repulsion technique
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
10.5
Papers:
1.1W
Citations:
5.0W