基于蚁群算法的Petri网最优路径序列寻找  

Optimum route sequence search in Petri net based on ant colony algorithm

作　　者：黄光球[1] 苏海洋[1] 刘冠[1] 

机构地区：[1]西安建筑科技大学管理学院,陕西西安710055

出　　处：《计算机应用》2007年第4期932-935,共4页journal of Computer Applications

基　　金：陕西省自然科学基金资助项目(2005F38);陕西省教育厅专项基金资助项目(06JK258);西安建筑科技大学基础研究基金项目(JC0616)

摘　　要：根据蚁群算法和时间Petri网的特点提出了一种网络元素可以记录少量信息的记忆扩展时间Petri网(METPN)。当METPN运行时,使用充足量的托肯在网络中行走并在行走过程中留下信息素来调整托肯的路径选择,从而使大量蚂蚁的行走路线不断逼近Petri网中时间延迟更短的变迁序列,最终在最短变迁序列上形成清晰的蚁路,从而在一定程度上解决了复杂Petri网的最优路径寻找问题。仿真结果表明,托肯可以有效地在最短延时路径上形成蚁路,能够求得从初始库所到网络中任意库所的最短路径。A Memory Extended Timed Petri Net （METPN） whose elements can record a little information was proposed based on the ant colony optimization algorithm and the features of the Timed Petri Net （TPN）. When METPN was running, enough tokens walked and left odor in METPN so that route selections of tokens could be adjusted, in this way it made lots of ant walk routes to approach the transitional sequences with less delay. At last a clear ant walk route could be found on the transitional sequence with the least delay, and the route search problem of complex TPN was solved to certain extent. The result of the simulation shows that the ant walk route is formed along the least delay route effectively by tokens, and the shortest route from initial places to every place of METPN can be gotten.

关 键 词：蚁群算法 PETRI网 路径序列 优化 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程] TP301.5[自动化与计算机技术—控制科学与工程]