论文部分内容阅读
利用改进的粒子群算法求解一类NP-hard且不可微的绝对值方程问题:Ax-|x|=b.该算法是将局部探索能力较强的模式搜索算法和全局开采能力较强的粒子群算法进行有效结合,混合后的算法充分发挥了各自的优点,平衡了局部和全局寻优能力,数值试验显示在求解具有不同类型解的绝对值方程时,误差小,迭代次数少.
The improved Particle Swarm Optimization (PSO) is used to solve a class of NP-hard and nondifferentiable absolute equations: Ax- | x | = b. The algorithm is based on a pattern search algorithm with strong local exploration capability and a particle with strong global mining capability The algorithm is combined effectively. The mixed algorithm gives full play to its advantages and balances the local and global optimization ability. The numerical experiments show that the error is small and the number of iterations is small when solving the equations with different types of solutions.