首页 | 本学科首页   官方微博 | 高级检索  
     检索      

车流在交叉口分流向延误的最短路径及算法
引用本文:刘灿齐.车流在交叉口分流向延误的最短路径及算法[J].同济大学学报(自然科学版),2002,30(1):52-56.
作者姓名:刘灿齐
作者单位:同济大学,道路与交通工程系,上海,200092
基金项目:国家自然科学基金资助项目 ( 70 0 710 18)
摘    要:以往最短路径的定义及其算法只考虑路段上的走行时间,没有考虑节点的延误,这对城市道路网是不适合的。用相邻节点向理描述了节点的相对方位,定义了次步节点的概念,给出了不同流向车流延误的数学表达,在此基础上重新定义了道路网的最短路径,并探讨了它的算法。

关 键 词:城市道路网  最短路径算法  交叉口  分流向延误  交通规划  相邻节点向量  次步节点
文章编号:0253-374(2002)01-0052-05
修稿时间:2001年3月20日

Shortest Path Including Delay of Each Flow at Intersection and Its Algorithm
LIU Can-qi.Shortest Path Including Delay of Each Flow at Intersection and Its Algorithm[J].Journal of Tongji University(Natural Science),2002,30(1):52-56.
Authors:LIU Can-qi
Abstract:The former definition of the shortest path only included the cost on links,but did not include the cost at nodes.That is unsuitable for urban road network.In this paper,the relative position of nodes is depicted with vector of neighboring nodes,and the `next-step node'is defined.Then the delay of traffic flow on each direction at intersection is expressed.At last,the conception of the shortest path is anew given,and its algorithm is researched.
Keywords:urban road network  shortest path  intersection  delay of traffic flow on each dirction  algorithm  
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号