摘要
旅行商问题(TSP)是一个著名的组合优化问题,从TSP的区域特性入手,提出并详细描述了将搜索剪枝算法与遗传算法相结合的剪枝表法。在对中国旅行商问题(CTSP)的实验中,剪枝表法表现出了良好的寻优能力和鲁棒性,是一种新的可行解决方案。
The traveling salesman problem（TSP） is a well-known combinatorial optimization problem.,This paper started from the regional characteristics in TSP,came up with the pruning-table-method which combines the search-pruning algorithm and genetic algorithm.The pruning-table-method showed a good search capability and robustness in the experiment of CTSP,it＇s a new and feasible solution.
出处
《电脑编程技巧与维护》
2011年第2期20-22,共3页
Computer Programming Skills & Maintenance
关键词
旅行商问题
剪枝表法
遗传算法
深度优先搜索
就近访问
traveling salesman problem
pruning-table-method
genetic algorithm
deep first search
close-by visit
