蚁群算法的三个模型

学者Dorigo M 研究了三种不同的基本蚁群算法模型，分别记为“蚁周系统"(Ant-Cycle)模型、“蚁量系统"(Ant-Quantity)模型及“蚁密系统"(Ant-Density)模型2 . fu jian nong lin da xue ji suan ji yu xin xi xue yuan ，fu zhou 3 5 0002 ）yao ：zai dan ji duo he xia fen bie gou zao ji yu O p e n M P M P I de bing xing yi qun suan fa mo xing ，zai duo he ji qun ji xia gou zao ji yu M P I M P I + O p e n M "

2.福建农林大学计算机与信息学院，福州350002）要：在单机多核下分别构造基于OpenMPMPI的并行蚁群算法模型，在多核集群机下构造基于MPIMPI+OpenM优化理论与应用——蚁群算法目录一.蚁群算法简介.2.算法的缺陷.11四.算法的发展与展望.12一.蚁群算法简介蚁群算法（antcolonyoptimization,ACO），又称蚂

yi qun suan fa de shu xue mo xing ma yi k ( k 1 , 2 , m ) zai yun dong guo cheng zhong , yun dong zhuan yi de fang xiang you ge tiao lu jing shang de xin xi liang nong du jue ding 。wei fang bian ji lu ke yong t a b u k ( k 1 , 2 , , m ) lai ji lu di k zhi ma yi dang qian yi zou guo de suo you jie dian , zhe li ke yi cheng cun fang jie dian de biao wei jin ji biao ; zhe ge cun fang jie dian de hui ji hui gen zhe ma yi de yun dong dong xiang de tiao zheng 。zai suan fa de zhao xun guo cheng zhong , ma yi hui zhi neng di xuan ze xia yi bu suo yao zou de lu jing 。she m biao shi ma yi zong shu mu , yong d i j ( i , j 0, 1 , , n 1 ) biao shi jie dian i he jie dian j zhi jian de ju li , i j ( " xue zhe D o r i g o M yan jiu fa xian le san zhong bu tong de ji ben yi qun suan fa mo xing , fen bie ji wei “yi zhou xi tong "( A n t - C y c l e ) mo xing 、“yi liang xi tong "( A n t - Q u a n t i t y ) mo xing ji “yi mi xi tong "( A n t - D e n s i t y ) mo xing

蚁群算法的数学模型蚂蚁k(k1,2,m)在运动过程中，运动转移的方向由各条路径上的信息量浓度决定。为方便记录可用tabuk(k1,2,,m)来记录第k只蚂蚁当前已走过的所有节点，这里可以称存放节点的表为禁忌表；这个存放节点的会集会跟着蚂蚁的运动动向的调整。在算法的找寻过程中，蚂蚁会智能地选择下一步所要走的路径。设m表示蚂蚁总数目，用dij(i,j0,1,,n1)表示节点i和节点j之间的距离，ij(you hua li lun yu ying yong ——yi qun suan fa mu lu yi . yi qun suan fa jian jie . 2 . suan fa de que xian . 1 1 si . suan fa de fa zhan yu zhan wang . 1 2 yi . yi qun suan fa jian jie yi qun suan fa （a n t c o l o n y o p t i m i z a t i o n , A C O ），you cheng ma "