混沌优化算法在组合优化问题中的应用

组合优化问题一直都受到理论界和工程界的重视,此类问题的求解方法也有很多,却各有缺点和局限性,不能满足实际应用的需要。混沌优化算法在解决数值优化问题上具有一定的普遍性,可以很快找到全局最优解,不过组合优化问题的解不是一个数值,因此在前人研究的基础上,提出求解组合优化问题的混沌优化算法。首先分析混沌优化,并针对组合优化问题中的TSP问题,提出一种混沌优化策略,探讨在TSP问题中应用混沌优化算法的方法。结果表明了该方法的有效性。

Application of Chaos Optimization Algorithm in the Solution of Combination Optimization Problems

The combination optimization problems have been paid more attention in the field of theory and the engineering,there also has many solutions of this kind of problems,but actually they all have their disadvantages and limitations,so they cannot satisfy the need of the practical application.The chaos optimization algorithm has certain universality in the solution of the value optimization problems,and they can find the globally optimal solution very quickly,but the solution of the combination optimization problems is not a value,therefore this article proposes the solution of the combination optimization problems chaos optimization algorithm on the studies of the predecessors.This article first analyzes the chaos optimization,and aims at the TSP problems in the combination optimization problems,proposes one kind of strategy of the chaos optimization,and discusses application of chaos optimization algorithm in the TSP problems,and finally it indicates that this method is effective.