| 利用基于分区搜索的自适应遗传算法求解TSP问题 |
| |
| 引用本文： | 江金龙,薛云灿,冯骏.利用基于分区搜索的自适应遗传算法求解TSP问题[J].河海大学常州分校学报,2005,19(3):1-4. |
| |
| 作者姓名： | 江金龙 薛云灿 冯骏 |
| |
| 作者单位： | 1. 河海大学,计算机及信息工程学院,江苏,常州,213022;九江学院,电子工程学院,江西,九江,332005
2. 河海大学,计算机及信息工程学院,江苏,常州,213022 |
| |
| 基金项目： | 湖北省自然科学基金资助项目(2004ABA018)，河海大学常州校区创新基金资助项目(2005B002-01) |
| |
| 摘 要： | 为了提高用遗传算法求解旅行商问题（TSP）的收敛速度，结合自适应算子和父子竞争策略等优化思想．提出了基于分区搜索的自适应遗传算法．该算法将整个搜索区域分成若干个较小的搜索区域，先进行局部搜索．在得到局部较优的基因组合后，再进行全区域搜索，不但提高了遗传算法的收敛速度，而且改进了变异算子的操作性能．通过TSP问题的求解表明，基于分区搜索的自适应遗传算法是一种稳定、高效的优化算法。
|
| 关 键 词： | 遗传算法 分区搜索 旅行商问题 |
| 文章编号： | 1009-1130(2005)03-0001-04 |
| 修稿时间： | 2005年3月16日 |
Solving Traveling Salesman Problem by the Adaptive Genetic Algorithm Based on the Regional Search |
| |
| JIANG Jin-long,XUE Yun-can,FENG Jun.Solving Traveling Salesman Problem by the Adaptive Genetic Algorithm Based on the Regional Search[J].Journal of Hohai University Changzhou,2005,19(3):1-4. |
| |
| Authors: | JIANG Jin-long XUE Yun-can FENG Jun |
| |
| Institution: | JIANG Jin-long1,2,XUE Yun-can1,FENG Jun1 |
| |
| Abstract: | To increase the convergence speed of the genetic algorithm in solving the traveling salesman problem(TSP),combined with adaptive operators and competitive strategy between parents and their children,an adaptive genetic algorithm based on the regional search is proposed. This algorithm divides the global space into regional space and makes the regional search first. The global space search is carried out based on the better local gene sequences obtained from the regional search,so as to improve the search speed. Moreover,this algorithm improves the mutation performance at the same time. The TSP simulations show that the improved algorithm is a steady and efficient optimal search method. |
| |
| Keywords: | genetic algorithms regional search traveling salesman problem(TSP) |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
