基于Petri网的顾及转向延误的最优路径算法  

Intelligent routing algorithm considering turn delays based on Petri net

作　　者：杨琰[1] 廖伟志[1] 李文敬[1] 杨文[1] 李杰[1] 

机构地区：[1]广西师范学院计算机与信息工程学院,广西南宁530023

出　　处：《计算机工程与设计》2013年第10期3643-3648,共6页Computer Engineering and Design

基　　金：国家自然科学基金项目(61163012);广西自然科学基金项目(2012GXNSFAA053218);广西研究生教育创新计划基金项目(YCSZ2012099)

摘　　要：针对双向通行的交通运输网络结构复杂,且城市道路交叉口的转向延误不可忽略的问题,提出基于无向Petri网的顾及转向延误的最优路径智能搜索算法。从赋予托肯另外两种状态和拓展定义变迁的使能规则两方面对Petri网进行扩展,将网络站点间的最优路径问题转换为求解在限制区域内托肯在节点间通行的最短时间消耗问题。算例模拟和实例分析结果表明了算法的可行性和有效性。To solve the problems that the structure of two-way transportation network is complex and turn delays could not be ignored,an intelligent routing algorithm based on undirected Petri Net is presented.An extended Petri net is formed from giving tokens two other states and redefining the enabling rules of transition.The optimal path problem between two sites of the network is converted into the shortest time consuming that token spends in passing through two related nodes in reasonable restrict searching area.Finally,a simulation example and a set of living examples are presented to prove the feasibility and validity of the proposed method.

关 键 词：无向Petri网 转向延误 使能规则 最优路径 智能搜索 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]