高师理科学刊Issue(5)：1-4,4.DOI:10.3969/j.issn.1007-9831.2014.05.001
改进遗传算法在TSP组合优化问题中的应用
The application of genetic algorithms in the TSP combination optimization problem
摘要
Abstract
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.关键词
遗传算法/TSP/NP-hardKey words
genetic algorithm/TSP/NP-hard分类
数理科学引用本文复制引用
张芳琴..改进遗传算法在TSP组合优化问题中的应用[J].高师理科学刊,2014,(5):1-4,4.基金项目
国家自然科学基金资助项目（11361046）；宁夏师范学院科学研究项目（YB201452，YB201440，YB201453，ZD2011001）；宁夏师范学院创新项目 （）
