| 一种改进的遗传算法求解旅行商问题 |
| |
| 引用本文： | 刘荷花,崔超,陈晶.一种改进的遗传算法求解旅行商问题[J].北京理工大学学报,2013,33(4):390-393. |
| |
| 作者姓名： | 刘荷花 崔超 陈晶 |
| |
| 作者单位： | 太原大学计算机系,山西,太原030009;齐齐哈尔大学应用技术学院,黑龙江,齐齐哈尔161005;齐齐哈尔市第一中学,黑龙江,齐齐哈尔 161005 |
| |
| 基金项目： | 国家自然科学基金资助项目(60475022);山西省科技厅软科学资助项目(2011041022-03) |
| |
| 摘 要： | 针对在解决旅行商问题时标准遗传算法效率不高,很容易陷入局部最优解的问题,提出了一种改进的遗传算法. 根据种群个体的多样性和分布情况,提出了判定遗传算法截止代数的方法. 研究结果表明,通过加入了初始化信息,改进交差算子,可提高遗传算法的精确性和收敛性.
|
| 关 键 词： | 遗传算法 旅行商(TSP) 截止代数 交叉算子 |
| 收稿时间： | 2012/10/17 0:00:00 |
An Improved Genetic Algorithm for Solving Travel Salesman Problem |
| |
| LIU He-hu,CUIChao and CHENJing.An Improved Genetic Algorithm for Solving Travel Salesman Problem[J].Journal of Beijing Institute of Technology(Natural Science Edition),2013,33(4):390-393. |
| |
| Authors: | LIU He-hu CUIChao and CHENJing |
| |
| Affiliation: | 1.Department of Computer, Taiyuan University, Taiyuan,Shanxi 030009, China2.School of Applied Science and Technology, Qiqihar University, Qiqihar, Heilongjiang 161005, China3.No.1 Middle School of Qiqihar, Qiqihar, Heilongjiang 161005, China |
| |
| Abstract: | Standard genetic algorithm in solving the traveling salesman problem (TSP) is not efficient since it is easy to fall into local optimal solution. To improve the efficiency of genetic algorithm, this paper presents an improved genetic algorithm. First, according to the diversity of individuals and the population distribution, the method to determine the cut-off algebraic of genetic algorithm is proposed. Second, by adding initialization information and improving cross-operator, the accuracy and convergence of the genetic algorithm could be improved. |
| |
| Keywords: | genetic algorithm travelling salesman problem(TSP) end algebra crossover operator |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《北京理工大学学报》浏览原始摘要信息 |
|
点击此处可从《北京理工大学学报》下载全文 |
|
