The SPCP on Two Relaxed Special-type Networks
The SPCP on Two Relaxed Special-type Networks
复制标题
两种松弛特殊网络上的SPCP
DOI：
--
复制
发表时间：
1996
期刊：
影响因子：
--
通讯作者：
M. Fushimi
中科院分区：
文献类型：
--
作者：
Mingzhe Li;M. Fushimi
Oyama和Taguchi提出了一种用于分析道路交通拥挤的最短路径计数问题SPCP，并将其应用于一些特殊类型的网络。然而，两种特殊类型的网络，圆形网络和极型网络的讨论，他们的研究严格假设下，该地区是由径向路段平均划分。本文将圆形网络和极型网络推广到其面积不需要被径向路段平分的一般形式，得到了它们上SPCP的一般理论结果。
Oyama and Taguchi proposed the SPCP(shortest path counting problem), which is concerned with the analysis of road traffic congestion, and applied it to some special-type networks. However, two special-type networks, circular-type networks and polar-type networks discussed by them are investigated under the strict assumption that the areas are divided equally by the radial road segments. Here in this paper, we extend circular-type networks and polar-type networks to the general forms whose areas are not required to be divided equally by the radial road segments to obtain the general theoretical results of the SPCP on them.