Abstract: Based on the analysis of the properties of progressive optimality algorithm(POA),tabu search (TS) and mutative scale chaos optimization algorithm(MSCOA),a chaos optimization algorithm based on progressive optimality and tabu search algorithm is presented.The algorithm has the implicit parallelism and global convergence of POA,the intelligence of tabu search and the fast convergence of MSCOA.The simulation results show that the algorithm,which has characters of simple,optimization efficiency and strong robustness etc.is a powerful technique to solve larger-scale nonlinear programming problems.

摘要： 结合逐次优化、禁忌搜索和变尺度混沌优化方法的优点,提出了基于逐次优化和禁忌搜索算法的混沌优化方法。该方法具有逐次优化算法的隐性并行性和收敛性,禁忌搜索的智能性和变尺度混沌优化方法的快速性。仿真计算表明,该方法具有实现简单,优化效率高,鲁棒性强等特点,是求解大规模非线性规划问题的一种有效手段。

关键词: 混沌, 逐次优化算法, 禁忌搜索, 优化

CLC Number: 

• TP11