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

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

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