中文核心期刊
CSCD来源期刊
中国科技核心期刊
RCCSE中国核心学术期刊

重庆交通大学学报(自然科学版) ›› 2009, Vol. 28 ›› Issue (6): 1060-1063.DOI: 10.3969/j.issn.1674-0696.2009.06.22

• • 上一篇    下一篇

考虑交叉口延误的城市道路最短路径

黄美灵,陆百川   

  1. 重庆交通大学交通运输学院,重庆400074
  • 收稿日期:2009-07-07 修回日期:2009-07-29 出版日期:2009-12-15 发布日期:2015-04-15
  • 作者简介:黄美灵(1986—),男,湖南益阳人,硕士研究生,研究方向是交通信息工程及控制。E-mail:humeli317@163.com。
  • 基金资助:
    重庆市科技攻关项目( 2008AC6074)

Determination?of?the?Shortest?Path?Considering?Delays?at?Intersections

HUANG Mei-ling, LU Bai-chuan   

  1. School?of?Traffic?&?Transportation,?Chongqing?Jiaotong?University,?Chongqing?400074,?China
  • Received:2009-07-07 Revised:2009-07-29 Online:2009-12-15 Published:2015-04-15

摘要: 在利用GIS建立城市道路网并通过空间分析判断节点方位和路径走向的基础上,提出了一种具有节点阻抗 的Floyd算法来解决城市道路网中的最短路径问题,这里直行、左转或右转的分流向延误得到了充分考虑。最后利 用所提出的算法对重庆市石桥铺街道路网进行了分析计算,得出了比传统方法更合理的结果。

关键词: 城市道路网, 最短路径, 分流向延误, 空间分析, Floyd算法

Abstract: Firstly,?the?methods?that?GIS?is?applied?to?establish?the?network?of?city?road?and?the?direction?of?intersection?and?path?is?analyzed?by?spatial?analysis?are?introduced.?Then,the?Floyd?algorithm?considering?the?delay?at?intersections?is?proposed?to?solve?the?shortest?path?problem?in?the?network?of?city?road,?in?which?the?delay?of?traffic?flow?on?each?direction,?such?as?going?straight,?turning?left?or?right?is?fully?taken?into?consideration.?The?proposed?algorithm?is?applied?to?calculate?and?analyze?the?road?network?of?Shiqiaopu?district?in?Chongqing,which?obtains?the?more?reasonable?results?than?the?conventional?algorithm?does.

Key words: urban road network , shortest path , delay of traffic flow on each direction , spatial analysis , Floyd algorithm

中图分类号: