高师理科学刊
高師理科學刊
고사이과학간
JOURNAL OF SCIENCE OF TEACHERS＇ COLLEGE AND UNIVERSITY
2014年
5期
1-4
,共4页
遗传算法%TSP%NP-hard
遺傳算法%TSP%NP-hard
유전산법%TSP%NP-hard
genetic algorithm%TSP%NP-hard
TSP 组合优化问题随着问题规模的增大，其潜在解的搜索空间增长速度比指数函数增加的速度还快．TSP问题的NP-hard使得求解这些问题的最优解非常困难．提出了通过改进经典遗传算法来求解TSP问题近似解的一个算法．仿真结果验证了该算法的有效性．
TSP 組閤優化問題隨著問題規模的增大，其潛在解的搜索空間增長速度比指數函數增加的速度還快．TSP問題的NP-hard使得求解這些問題的最優解非常睏難．提齣瞭通過改進經典遺傳算法來求解TSP問題近似解的一箇算法．倣真結果驗證瞭該算法的有效性．
TSP 조합우화문제수착문제규모적증대，기잠재해적수색공간증장속도비지수함수증가적속도환쾌．TSP문제적NP-hard사득구해저사문제적최우해비상곤난．제출료통과개진경전유전산법래구해TSP문제근사해적일개산법．방진결과험증료해산법적유효성．
TSP combinatorial optimization problem increases with the size of the problem,the growth rate of search space solutions for its potential is also faster than the exponential increase.The TSP NP-hard problem makes the optimal solution to solve this problem is very difficult.Gave a new algorithm to comput a realistic solution for TSP approximate by using of the genetic algorithm that improves classical genetic algorithm.The simulation results verified the effectiveness of the algorithm.
