模拟退火算法是通过赋予搜索过程一种时变且最终趋于零的概率突跳性，从而可有效避免陷入局部极小并最终趋于全局最优的串行结构的优化算法。-Simulated annealing algorithm is a time-varying by giving the search process and ultimately tends to zero the probability of jumps, thus can effectively avoid local minima and eventual

混沌粒子群算法是混沌优化和粒子群优化两者的结合。对于给定的优化函数，通过将搜索过程对应为混沌轨道的遍历过程，可使搜索过程具有避免陷入局部极小的能力。-Chaos particle swarm optimization (pso) algorithm is a combination of both the chaos optimization and particle swarm optimization.For a given optimization function, through th