A Chaotic Search Method for a Class of Combinatorial Optimization Problems
求解一类组合优化问题的混沌搜索法

It is a good idea to merge chaos into various conventional optimal methods in order to escape from local minima. This paper proposes a chaotic optimization model for combinatorial optimization problems and theoretically expounds that the model is feasible. Compared with chaotic neural network models, the present model will avoid the parameter settings of chaotic neural network models which is often very difficult, so it is easy to operate. Moreover, it can get better results according to numerical simulation.