摘要
组合优化是一个离散最优化问题,在规划,调度,资源分配,决策等问题中有着非常广泛的应用。入们已经认识到,组合优化问题的计算复杂度高,属于NP难一类的问题,除了枚举一部分解空间之外,
In recent years, Simulated Annealing, Genetic Algorithm and Tabu Search have achieved notable success in combinatorial optimization. In this paper, we review and compare characteristics of these algorithms, and their performance. We emphasize the intensification and diversification problem in metaheuristics, and give some insight in application of these algorithms.
出处
《计算机科学》
CSCD
北大核心
1998年第2期13-16,共4页
Computer Science
基金
国家自然科学基金
北京市自然科学基金
关键词
组合优化问题
启发式搜索
遗传算法
Combinatorial optimization, Simulated annealing, Genetic algorithm, Tabu search, Meta-heuristics search.
