2005 Fiscal Year Final Research Report Summary
International comparison on characteristics of travel behaviour in congested network
| Project/Area Number |
16404014
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (B)
|
| Allocation Type | Single-year Grants |
|---|
| Section | 海外学術 |
|---|
| Research Field |
交通工学・国土計画
|
|---|
| Research Institution | Kobe University |
|---|
Principal Investigator |
ASAKURA Yasuo Kobe University, Graduate School of Science and Technology, Professor, 自然科学研究科, 教授 (80144319)
|
|---|
| Co-Investigator(Kenkyū-buntansha) |
KUWAHARA Masao University of Tokyo, Center for collaborative research, Professor, 国際・産学共同研究センター, 教授 (50183322)
YOSHII Toshio Kyoto University, Graduate School of Technology, Associate Professor, 大学院・工学研究科, 助教授 (90262120)
IRYO Takamasa Kobe University, Faculty of Engineering, Research Associate, 工学部, 助手 (10362758)
HATO Eiji Ehime University, Faculty of Engineering, Associate Professor, 工学部, 助教授 (60304648)
NAGAE Takeshi Kobe University, Graduate School of Science and Technology, Research Associate, 自然科学研究科, 助手 (30379482)
|
|---|
| Project Period (FY) |
2004 – 2005
|
| Keywords | Traffic congestion / Travel behaviour / GPS / Route choice / Traffic survey |
|---|
| Research Abstract |
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.
|
