基于近邻频次信息引导的多变异差分进化算法求解非线性方程组
DOI:
CSTR:
作者:
作者单位:

辽宁工程技术大学

作者简介:

通讯作者:

中图分类号:

O241.7;TP18

基金项目:

辽宁省教育厅基本科研基金(JYTMS20230802);辽宁省自然科学基金(2023-MS-317);辽宁省研究生教育教学改革研究项目(LNYJG2023119)


Solving nonlinear equation systems with nearest-neighbor frequency information-guided multi-mutation differential evolution algorithm
Author:
Affiliation:

Fund Project:

  • 摘要
  • |
  • 图/表
  • |
  • 访问统计
  • |
  • 参考文献
  • |
  • 相似文献
  • |
  • 引证文献
  • |
  • 资源附件
  • |
  • 文章评论
    摘要:

    求解非线性方程组是数值计算领域中一项重要且具有挑战性的工作,其目标是在一次运行中找到多个根。为充分利用邻域拥挤差分进化算法的寻优信息,同时保持良好的种群多样性和计算资源利用效率,提出一种基于近邻频次信息引导的多变异差分进化算法。多变异策略基于个体适应度值进行分组,每组个体采用不同变异算子,以实现全局和个体邻域信息的综合学习,从而增强算法的多根联解能力;近邻频次信息引导机制利用个体被选为邻域个体的频次信息,以提升进化过程的效率并增强对潜在根的探索能力。实验结果表明,所提算法相较于其他对比算法有更高的计算资源利用效率、更高的找根率和成功率。

    Abstract:

    Solving nonlinear equation systems is a significant and challenging task in the field of numerical computation, aiming to identify multiple roots in a single run. To fully utilize the optimization information in the neighborhood-based crowding differential evolution algorithm while maintaining good population diversity and computational resource efficiency, a nearest-neighbor frequency information-guided multi-mutation differential evolution algorithm is proposed. The multi-mutation strategy groups individuals based on their fitness values, and each group uses different mutation operators to achieve comprehensive learning of global and individual neighborhood information, thereby enhancing the algorithm""s ability of multi-root joint solution. The frequency information guidance mechanism of neighboring individuals utilizes the frequency of an individual being selected as a neighboring individual to improve the efficiency of the evolutionary process and enhance the exploration ability of potential roots. Experimental results show that the proposed algorithm has higher computational resource utilization efficiency, higher root-finding rate and success rate compared to other comparison algorithms.

    参考文献
    相似文献
    引证文献
引用本文
相关视频

分享
文章指标
  • 点击次数:
  • 下载次数:
  • HTML阅读次数:
  • 引用次数:
历史
  • 收稿日期:2025-08-13
  • 最后修改日期:2026-02-24
  • 录用日期:2026-02-25
  • 在线发布日期:
  • 出版日期:
文章二维码