变迁特性服从不同分布的SPN最优路径序列寻找.pdfVIP

计算机工程与应用 2∞9 ， 45(29) 43 变迁特性服从不同分布的 SPN 最优路径序列寻找 .黄光球，王金城，张娥 HUANG Guang-qiu , WANG Jin吨he吨，ZHANG Bin 西安建筑科技大学管理学院，西安 71∞55 Schω1 of Mana在ement ， Xí an Uníversity of Archítectur暗 Technology ，泪an 71ω55 ， China E牛mail: huangnan93@吕 HUANG Guang -qiu ,WANG Jin -cheng ,ZHANG Bin.O川mum route sequence 僻arch in stoch创tic petri net b制ed on transition s (1刷turωobeying different distributiollS.Computer E吨ineering and AppUωtiollS .2创队45( 29 ) : 43-48. Abstract: Many problems in engineering can be modeled a串 the maínframe route 自equence search problem bωed on a Stochastic Petri Net( SPN ).Supposing 出at a unit represented by a transition is rl创torable ，而liability and maíntenance degr啊。f a transition obeys Weibull distribution and lognormal distribution respectively ,and then the concept of generalized maintenance time is put forward ,and the steady state avaílability formulas of a unit and a system ar暗 obtaíned respectively .In order to find the mainframe route sequence ,a SPN with Memorability and Avaílability(SPNMA) ,whose elements can record a litùe information ,is proposed based on the ant colony optimization algorithm and features of SPN.When SPNMA ís running ,enough tokens walk and leave pheromone on the complicated SPNMA.Synthetic cωt and steady state availability of transitions and pheromone on transitíons are the primary M盼 to adjust route choice of tokens.Pheromone wei酬 multiplier of normal distribution. phcromone balance 0脚rator of uniform distribution and stochastic tokens are introduced to ímprove 由e ant colony optimizatìon algorithm.Ants give priority to select routes 明th lower synthetíc cost.At 1ast a clear ant route c阳 be found on the route with thc lowest synthetic cost.The re棚lt of simulatîon shows that the clear 阳t route is formed along the best route effectively by tokens. Key words: stocha