Compared with traditional DFS algorithm and simulated annealing (SA) algorithm, the proposed algorithm possesses better convergency and high convergence rate.
该算法克服了DFS算法收敛性差和模拟退火(SA)算法收敛速度慢的缺点。
In addition, hypothesis-test based simulated annealing (SA) and genetic algorithms are proposed respectively by incorporating the statistical idea of hypothesis test into intelligent algorithms.
另一方面,通过将假设检验的统计思想融入智能优化算法,分别提出了基于假设检验的模拟退火和遗传算法。
This paper solved offline Constraint-Based Routing problem with simulated annealing(SA).
应用模拟退火算法解决了光网络中的静态受限路由问题。
应用推荐