基于Anytime算法的组合优化问题求解

Combinatory Optimization Problem Solving Using Anytime Algorithms

介绍一种基于Ａｎｙｔｉｍｅ算法的组合优化问题求解框架，并报告了对ＴＳＰ问题进行求解的实验。实验结果表明，上述框架可以较好地协调问题的复杂度与求解时间要求之间的冲突。

The authors introduce a framework of combinatory optimization problem solving using anytime algorithms and the experiments of TSP problem solving in this thesis. The result of experiments indicates that the framework coordinates the conflict preferably between the complexity of problem and the computing time.