蚁群算法的随机Petri网分析与路径寻优

Analysis and Route Optimization in Stochastic Petri Net Based on Ant Colony Algorithm

为解决Petri网的最优路径寻找问题,在分析了随机Petri网(Stochastic Petri Net,SPN)中各个变迁实施时刻的分布规律之后,提出了一种计算任意网型变迁时间概率分布的方法.在对SPN分析的基础上,基于蚁群算法设计了一种在SPN中使用的各个网元素数据结构,提出了一种在SPN中更有效率的路径寻优方法.仿真结果表明,此路径寻优方法对时间延迟具有更高的灵敏度,对路径选择具有更高的准确性.

For solve the problem that Petri net＇s route optimization search, the distribution rule of each transition implementation moment has been analyzed in the stochastic Petri net （SPN）, a method for the probability distribution of transition time in arbitrary network is proposed. Based on the analysis of SPN and ant colony algorithm, a data structure for each network elements in SPN is designed, and a more efficient route optimization method in SPN is proposed. The result of the simulation shows that this method has the features of more sensitivity of the time-delay and higher accuracy to the route optimization.