求解GTSP问题的自适应遗传算法
Computer Engineering and Applications(2011)
Abstract
利用传统遗传算法的基本思想,针对GTSP问题,提出了一种改进的自适应遗传算法。通过个体编码方法,将GTSP转化为多段图最短路径问题,采用动态规划算法求解;根据多段图最优子结构性质设计了个体适应度评价函数,加快了算法的运行速度。实验测试的结果表明,新算法比传统的遗传算法具有更快的收敛速度和更优的解质量。
MoreTranslated text
Key words
Generalized Traveling Salesman Problem(GTSP),adaptive genetic algorithm,dynamic programming algorithm
AI Read Science
Must-Reading Tree
Example
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined