| 基于改进Inver-over算子的并行TSP演化算法 |
| |
| 引用本文： | 谢大同,李程俊,康立山. 基于改进Inver-over算子的并行TSP演化算法[J]. 计算机工程与设计, 2007, 28(10): 2248-2249,2279 |
| |
| 作者姓名： | 谢大同 李程俊 康立山 |
| |
| 作者单位： | 中国地质大学,计算机学院,湖北,武汉,430074;中国地质大学,计算机学院,湖北,武汉,430074;武汉大学,软件工程国家重点实验室,湖北,武汉,430072 |
| |
| 基金项目： | 国家自然科学基金 , 中国地质大学(武汉)校科研和教改项目 |
| |
| 摘 要： | 设计了基于近邻点初始化和改进Inver-over(反序杂交)算子求解旅行商问题的并行演化算法.该算法执行时,主进程每当收集到各个种群的最好个体并形成精英种群时,就对该种群执行一次Inver-over算子,然后将其中最好的个体发送给各个种群.在PVM(并行虚拟机)并行环境下的实验结果表明,并行后能取得更好的解,并且在主进程中建立精英种群的演化有助于更好更快的收敛.
|
| 关 键 词： | 旅行商问题 反序杂交 并行 主从式 近邻 精英种群 |
| 文章编号： | 1000-7024（2007）00-2248-02 |
| 修稿时间： | 2006-05-17 |
Parallel evolutionary algorithm to TSP based on improved inver-over operator |
| |
| XIE Da-tong,LI Cheng-jun,KANG Li-shan. Parallel evolutionary algorithm to TSP based on improved inver-over operator[J]. Computer Engineering and Design, 2007, 28(10): 2248-2249,2279 |
| |
| Authors: | XIE Da-tong LI Cheng-jun KANG Li-shan |
| |
| Affiliation: | 1. School of Computer, China University of Geosciences, Wuhan,430074, China; 2. State Key Laboratory of Sottware Engineering, Wuhan University, Wuhan 430072, China |
| |
| Abstract: | A parallel evolutionary algorithm for TSP,which is based on nearest neighbor initialization and improved Inver-over operator,is purposed.In this algorithm,once the master process has received all the best individuals from each population,it will generate an elite population and run Inver-over operator once.Then,send the best one to each sub-population.The experimental result based on PVM(parallel virtual machine) shows that the parallel algorithm get more reasonable solution and the elite population contributes to the convergence of the evolution. |
| |
| Keywords: | TSP inver-over parallel master-slave nearest neighbor elite population |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
