欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
设计了基于近邻点初始化和改进Inver-over（反序杂交）算子求解旅行商问题的并行演化算法。该算法执行时,主进程每当收集到各个种群的最好个体并形成精英种群时,就对该种群执行一次Inver-over算子,然后将其中最好的个体发送给各个种群。在PVM（并行虚拟机）并行环境下的实验结果表明,并行后能取得更好的解,并且在主进程中建立精英种群的演化有助于更好更快的收敛。
英文摘要：
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.
同期刊论文项目
同项目期刊论文
期刊信息
位置：