An Improved Newton-raphson Optimizer with Differential Evolution and Adaptive Strategy.

Saved in:

Bibliographic Details
Title:	An Improved Newton-raphson Optimizer with Differential Evolution and Adaptive Strategy.
Authors:	Wang, Bo¹ zsa3685@163.com, Zhang, Yong² zy9091@163.com
Source:	Engineering Letters. Jul2026, Vol. 34 Issue 7, p2808-2823. 16p.
Subjects:	Newton-Raphson method, Differential evolution, Mathematical optimization, Swarm intelligence, Process optimization, Metaheuristic algorithms
Abstract:	Newton-raphson optimizer (NRBO) is a new swarm intelligence meta-heuristic algorithm inspired by Newton-raphson method, which combines Newton-raphson search rule (NRSR) and trap avoidance operator (TAO). Although it performs well in global exploration, the original NRBO has some shortcomings in local harsh utilization, which may lead to poor utilization effect of NRBO, insufficient convergence accuracy, insufficient exploration-mining balance and easy to fall into local optimum. Therefore, this paper proposes an improved version of EDNRBO. By introducing a variety of strategies to solve the above defects. Firstly, the introduction of a nonlinear convergence factor AF in the original NRBO parameter ρ can improve the local search effect of NRBO and improve the convergence accuracy. Secondly, the particle position is updated by combining the advantages of differential evolution and local search. Finally, the adaptive factor (DF) is improved to avoid EDNRBO falling into local optimum. In this study, the CEC2022 benchmark suite was used to evaluate the performance of the EDNRBO algorithm, and compared with the other four optimization algorithms. In addition, the proposed algorithm was qualitatively analyzed with NRBO to further verify the effectiveness of EDNRBO. The algorithm is applied to engineering optimization problems with different complexity. The test data show that it is superior to other comparison algorithms in terms of optimization accuracy, problem adaptability and solution stability. [ABSTRACT FROM AUTHOR]
	Copyright of Engineering Letters is the property of International Association of Engineers (IAENG) and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database:	Engineering Source

Description
Abstract:	Newton-raphson optimizer (NRBO) is a new swarm intelligence meta-heuristic algorithm inspired by Newton-raphson method, which combines Newton-raphson search rule (NRSR) and trap avoidance operator (TAO). Although it performs well in global exploration, the original NRBO has some shortcomings in local harsh utilization, which may lead to poor utilization effect of NRBO, insufficient convergence accuracy, insufficient exploration-mining balance and easy to fall into local optimum. Therefore, this paper proposes an improved version of EDNRBO. By introducing a variety of strategies to solve the above defects. Firstly, the introduction of a nonlinear convergence factor AF in the original NRBO parameter ρ can improve the local search effect of NRBO and improve the convergence accuracy. Secondly, the particle position is updated by combining the advantages of differential evolution and local search. Finally, the adaptive factor (DF) is improved to avoid EDNRBO falling into local optimum. In this study, the CEC2022 benchmark suite was used to evaluate the performance of the EDNRBO algorithm, and compared with the other four optimization algorithms. In addition, the proposed algorithm was qualitatively analyzed with NRBO to further verify the effectiveness of EDNRBO. The algorithm is applied to engineering optimization problems with different complexity. The test data show that it is superior to other comparison algorithms in terms of optimization accuracy, problem adaptability and solution stability. [ABSTRACT FROM AUTHOR]
ISSN:	1816093X