International comparison on characteristics of travel behaviour in congested network

本研究旨在获得世界城市拥挤网络中旅行者行为的经验知识。本研究开发了一种方法来衡量低成本城市的拥堵程度。运用Wardrop的均衡理论，它旨在减少需要测量的环节的数量。网络的静态信息，如节点、链路、链路的自由流动时间、连通性的拓扑信息等，都是事先已知的。要测量的链接由该信息确定。利用该方法，可以从有限路段的行驶时间测量结果中估计未进行测量的路段的行驶时间。上面解释的方法是通过基于路径的理论来描述的，因此枚举每个O-D对之间的所有可能路径是必要的。然而，由于计算成本的原因，枚举所有路由是不现实的。这个理论提供了一种不用枚举就能完成计算的方法。另一方面，现实世界中的旅行者可能无法列举出出发地和目的地之间的所有可能路线。他们可以从有限的选项中选择路线。考虑到出行者的这种行为，本研究提出了一种从所有可能的路线中提取出行者路线选择选项的算法。该方法经实证检验。实证调查是在世界上选定的城市进行的。网络的运行时间由配备gps的车辆获得。已获得网络各链路的运行时间。将此结果与上述方法进行比较，可以得到拥塞网络中的拥塞特征和出行行为。

This research intends to obtain empirical knowledge of travellers' behaviour in congested network in cities in the world. This research developed a methodology for measuring degree of congestion in cities with lower cost. Applying Wardrop's theory of equilibrium, it intends to reduce the number of links to be measured. Static information of the network, such as nodes, links, free flow travel time of links, and topological information of their connectivity, is assumed to be obtained beforehand. The links to be measured are determined by this information. Using this methodology, travel times of links where measurement is not made can be estimated from the result of measurement of travel time on limited links.The methodology explained above is described by route based theory and therefore enumerating all possible routes between each O-D pairs is necessary. However, it is known that enumerating all routes is not realistic due to calculation cost. This theory provides a method to finish calculations without such enumerations. On the other hand, travellers in the real world may not have ability to enumerate all possible routes between their origins and destinations. They may choose their routes from the limited options they can consider. Considering such behaviour of travellers, this study shows an algorithm to extract route choice options of travellers from all possible routes. This method was checked by empiricl test.The empirical surveys were made in the selected cities in the world. Travel time of the networks was obtained by GPS-equipped cars. Travel time of all links of the networks has been obtained. Comparing this result with the methods shown above, characteristics of congestion and travel behaviour in congested network can be obtained.