首页 | 官方网站   微博 | 高级检索  
     

改进的多智能体遗传算法求解TSP研究
引用本文:张继军,田宝国,李萧.改进的多智能体遗传算法求解TSP研究[J].计算机应用,2008,28(4):954-956.
作者姓名:张继军  田宝国  李萧
作者单位:1. 海军航空工程学院,基础部,山东,烟台,264001
2. 63891部队,河南,洛阳,471003
摘    要:多智能体遗传算法是基于智能体对环境感知与反作用的能力提出的一种新的函数优化方法,具有很快的收敛速度,尤其是在优化超高维函数时更显示出了它的优越性。针对这一特点对该算法进行了适当的改进,在邻域正交交叉算子中采用精英保留策略,在自学习算子中引入邻域正交交叉算子并采用小变异概率以加快收敛速度。求解TSP的实验结果显示,改进后算法的性能有了较大的提高。

关 键 词:智能体  遗传算法  多智能体遗传算法  旅行商问题
文章编号:1001-9081(2008)04-0954-03
收稿时间:2007-10-30
修稿时间:2007年10月26

Solving TSP with improved multi-Agent genetic algorithm
ZHANG Ji-jun,TIAN Bao-guo,LI Xiao.Solving TSP with improved multi-Agent genetic algorithm[J].journal of Computer Applications,2008,28(4):954-956.
Authors:ZHANG Ji-jun  TIAN Bao-guo  LI Xiao
Affiliation:ZHANG Ji-jun1,TIAN Bao-guo1,LI Xiao2(1.Basic Department,Naval Aeronautical , Astronautical University,Yantai Sh,ong 264001,China,2.63891 Army,Luoyang Henan 471003,China)
Abstract:Based on agent's capability of perceiving and reacting on environment,Multi-Agent Genetic Algorithm(MAGA)was proposed as a new method of function optimization.MAGA had a rapid convergence velocity especially when it optimized super-high dimensional functions.This algorithm was improved properly based on its characteristics:elitist reservation strategy was adopted in neighborhood orthogonal crossover operator,and neighborhood orthogonal crossover operator was introduced into self-learning operator and small ...
Keywords:Agent  genetic algorithm  multi-Agent genetic algorithm  Traveling Salesman Problem (TSP)
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机应用》浏览原始摘要信息
点击此处可从《计算机应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号