节点文献
基于Anytime算法的组合优化问题求解
Combinatory Optimization Problem Solving Using Anytime Algorithms
【摘要】 介绍一种基于Anytime算法的组合优化问题求解框架,并报告了对TSP问题进行求解的实验。实验结果表明,上述框架可以较好地协调问题的复杂度与求解时间要求之间的冲突。
【Abstract】 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.
【关键词】 组合优化问题;
Anytime算法;
TSP问题;
【Key words】 Combinatory optimization problem; Anytime algorithm; TSP problem;
【Key words】 Combinatory optimization problem; Anytime algorithm; TSP problem;
【基金】 国家自然科学基金!(69875017)
- 【文献出处】 计算机工程 ,COMPUTER ENGINEERING , 编辑部邮箱 ,2000年05期
- 【分类号】TP18
- 【被引频次】2
- 【下载频次】64