优化算法种类多且用途广泛, 在解决全局大规模组合优化等复杂问题时选择合适的优化算法具有重要的意义。主要分析了模拟退火算法在解决飞机巡航最短路径问题中的应用, 同时与遗传算法和改进后的遗传算法进行了对比分析。结论表明, 在这个最短路径的应用中模拟退火算法得到的路径最短, 比其他两种优化算法有更好的求解结果。因此, 模拟退火算法在求解全局优化复杂问题上占据一定的重要地位。

There are many kinds of optimization algorithms and they have widely application. It is of great significance to select suitable optimization algorithms when solving complex problems such as global large-scale combinatorial optimization. The application of simulated annealing algorithm in solving the shortest path problem of aircraft cruise is mainly analyzed. And it is compared with genetic algorithm and improved genetic algorithm. The conclusion shows that simulated annealing algorithm has the shortest path in the application of the shortest path, and has better solution results than other two optimization algorithms. Therefore, simulated annealing algorithm plays an important role in solving complex global optimization problems.