Chaos could escape from local minima and approach the global minima, and simplex method was used to perform the local search in the neighborhoods of chaos optimization results.

• 混沌能有效地跳出局部最优解而接近全局最优点，同时利用单纯形法在混沌优化解的邻域内局部寻优。