基于变迁可靠性的随机Petri网最优路径序列寻找.pdfVIP

Vo l. 31 No.1 第 31 脊第1 期 系统工程均电子技术 2009 年 1 月 Systerns Engineering and Electronics Jlln. 2009 文意编号: 1001.506X(2009)Ol-0 187.08 基于变迁可靠性的随机 Petri 网最优路径序列寻找 黄光球，张斌 (商安建筑科技大学管理学院，陕西西安 710055) 摘 要:为了解决随机Petrí 网的路径导优问题，在变迁中引进了可靠性的特性，并假设变迁的寿命服从成布 尔分布模型，然后根据蚁群算法和时间 Petri 网的特点提出了卢种网络元常可以记录少量信息的带可靠性的记忆 时间随机 Petri 阅。在网络运行时，大蒙托常在网络中行走并且在行走过程中留下信息素，以此来调整托常的路 径选择.在满足一定可靠性的前提下，在延迟越短的路径上蚂蚁将留下越多的信息素，最终在延迟最短的路径上 形成清晰的蚁路。阂为变迁的可靠性随时间的增加而不断减小，当一段时间过后路径的可靠性不能满足要求时， 需要重新选择一条满足可靠性要求且相对延迟最短的新路径。仿真给采农明，托常可以有效地在:l.优Ji径上形 成清晰的蚁移，并且能随着可靠性的不断变化寻找新的最优珞径。 提键询:随机 Petri 网 F 蚁群算法z 路径序列$可靠性 中嗣分类在寄: TP 39 1. 9 X献标志码:A Optimum route sequence search in stochastic Petri net based on reliability of transition HUANG Guang-qiu , ZHANG Bin (School 01 Management , Xian Univ. 01Architecture and Technology. Xi an 710055. China) Abstract: In order to solve the route search problem in stochastic Petri net , the feature of reliability is in- troduced into each transition , and suppose that the lifetime distribution of a transition obeys the Weibull distri- bution model , then a memorial stochastíc Petri net with reliability whose elements can record a little information ís proposed based on the ant colony optimization algorithm and features of the memorial stochastic Petri net. When the Petri net is runnin日， enough tokens walk and leave pheromone in the Petri net , which is used to adjust the route choice of tokens. When certain reliability requirernent needs to be satísfíed , ants willleave more pher- omone on routes wíth less delay and required reliability. at last