Xiong Xuan, Li Shaobo, Wu Fengbin
State Key Laboratory of Public Big Data, College of Computer Science and Technology, Guizhou University, Guiyang 550025, China.
State Key Laboratory of Public Big Data, Guizhou University, Guiyang 550025, China.
Entropy (Basel). 2023 Aug 24;25(9):1255. doi: 10.3390/e25091255.
Global optimization problems have been a research topic of great interest in various engineering applications among which neural network algorithm (NNA) is one of the most widely used methods. However, it is inevitable for neural network algorithms to plunge into poor local optima and convergence when tackling complex optimization problems. To overcome these problems, an improved neural network algorithm with quasi-oppositional-based and chaotic sine-cosine learning strategies is proposed, that speeds up convergence and avoids trapping in a local optimum. Firstly, quasi-oppositional-based learning facilitated the exploration and exploitation of the search space by the improved algorithm. Meanwhile, a new logistic chaotic sine-cosine learning strategy by integrating the logistic chaotic mapping and sine-cosine strategy enhances the ability that jumps out of the local optimum. Moreover, a dynamic tuning factor of piecewise linear chaotic mapping is utilized for the adjustment of the exploration space to improve the convergence performance. Finally, the validity and applicability of the proposed improved algorithm are evaluated by the challenging CEC 2017 function and three engineering optimization problems. The experimental comparative results of average, standard deviation, and Wilcoxon rank-sum tests reveal that the presented algorithm has excellent global optimality and convergence speed for most functions and engineering problems.
全局优化问题一直是各种工程应用中备受关注的研究课题,其中神经网络算法(NNA)是应用最为广泛的方法之一。然而,在处理复杂优化问题时,神经网络算法不可避免地会陷入较差的局部最优解并出现收敛问题。为克服这些问题,提出了一种基于准对立和混沌正弦余弦学习策略的改进神经网络算法,该算法加快了收敛速度并避免陷入局部最优。首先,基于准对立的学习促进了改进算法对搜索空间的探索和利用。同时,通过整合逻辑斯谛混沌映射和正弦余弦策略的新型逻辑斯谛混沌正弦余弦学习策略增强了跳出局部最优的能力。此外,利用分段线性混沌映射的动态调整因子来调整探索空间,以提高收敛性能。最后,通过具有挑战性的CEC 2017函数和三个工程优化问题评估了所提出的改进算法的有效性和适用性。平均、标准差和威尔科克森秩和检验的实验比较结果表明,所提出的算法对于大多数函数和工程问题具有出色的全局最优性和收敛速度。