Determining Arc Segment Significance in Two Idealized Road Networks
As road networks become increasingly congested, accurate information regarding their vulnerability to an amalgamation of situations becomes more vital. Understanding how accidents,routine closures (due to construction, public events, etc) and even premeditated attacks on individual arcs nfluence the road network may assist policy makers in decisions on network expansion or planning, helping to ensure the development of a more robust, reliable, and protected network.This paper discusses a method for determining arc segment significance within two idealized networks using SPCP (Shortest Path Counting Problem) and DSPCP (Directed Shortest Path Counting Problem) as an analytical basis.
arc analysis SPCP DSPCP road network design
Mingzhe Li Justin Yates
Faculty of Economics, Fukuoka University, 8-19-1 Nanakuma, Jonan-ku, Fukuoka, Japan 814-0180 Department of Industrial and Systems Engineering, Texas A&M University, College Station, TX, USA 778
国际会议
The Seventh International Symposium(ISORA08)(第七届国际效力研究及其应用学术会议)
云南丽江
英文
485-495
2008-10-31（万方平台首次上网日期，不代表论文的发表时间）