会议专题

Finding the critical repairing road section of a transportation network

Let G(v,E) denote a transportation network with a rate of traffic between each pair of nodes, and a latency function for each edge (road section). However, some road sections may be repaired at certain times and make some blockages. In this paper, we focus on the problem of finding a road section ey e ? to be repaired, whose removal produces the ratio of the minimum sum travel times (total latency) of network G - e to that of network G is minimum. We define such a road section as the critical repairing road section of a transportation network (CRR for short), and give an algorithm for computing the CRR. Finally, an application of the CRR for a special network is shown.

total latency traffic flow loss coefficient of repairing road section critical repairing road section

Bing Su Chunyan Hua Xiaoyi Lan Qian Yang

School of Economics and Management, XiOan technological University, XiUan 710032, China The State Ke School of Economics and Management, XiOan technological University, XiUan 710032, China

国际会议

International Symposium on Emergency Management 2011(ISEM‘2011)(第六届国际应急管理论坛暨中国(双法)应急管理专业委员会第七届年会)

北京

英文

240-243

2011-11-19(万方平台首次上网日期,不代表论文的发表时间)