Optimum route sequence search in Petri net based on ant colony algorithm
基于蚁群算法的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.