Browse > Article

Finding the One-to-One Optimum Path Considering User's Route Perception Characteristics of Origin and Destination (Focused on the Origin-Based Formulation and Algorithm)  

Shin, Seong-Il (서울시정개발구원)
Sohn, Kee-Min (서울시정개발연구원)
Cho, Chong-Suk (서울시정개발연구원)
Cho, Tcheol-Woong (한양대학교 교통시스템공학과)
Kim, Won-Keun (한양대학교 교통시스템공학과)
Publication Information
Journal of Korean Society of Transportation / v.23, no.7, 2005 , pp. 99-110 More about this Journal
Abstract
Total travel cost of route which connects origin with destination (O-D) is consist of the total sum of link travel cost and route perception cost. If the link perception cost is different according to the origin and destination, optimal route search has limitation to reflect the actual condition by route enumeration problem. The purpose of this study is to propose optimal route searching formulation and algorithm which is enable to reflect different link perception cost by each route, not only avoid the enumeration problem between origin and destination. This method defines minimum unit of route as a link and finally compares routes using link unit costs. The proposed method considers the perception travel cost at both origin and destination in optimal route searching process, while conventional models refect the perception cost only at origin. However this two-way searching algorithm is still not able to guarantee optimum solution. To overcome this problem, this study proposed an orign based optimal route searching method which was developed based on destination based optimal perception route tree. This study investigates whether proposed numerical formulas and algorithms are able to reflect route perception behavior reflected the feature of origin and destination in a real traffic network by the example research including the diversity of route information for the surrounding area and the perception cost for the road hierarchy.
Keywords
경로인지비용;양방향 최적경로탐색;최적경로트리;최적링크인지경로트리;출발지기반 최적경로탐색;도착지기반 최적경로탐색;경로열거;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 Ran B., Hall, R., and Boyce D. (1996) A Link-Based Variational Inequality Model for Dynamic Departure Time/Route Choice, Transportation Research B, Vol. 30, No. 1, pp.31-46   DOI   ScienceOn
2 Hall, R. W. (1986) The Fastest Path through A Network with Random Time-Dependent Travel Times. Transportation Science, 20(3)
3 Sheffi Y. and Powell W.B. (1982) An Algorithm for the Equilibrium Assignment Problem with Random Link Times. Networks 12(2), pp.191-207   DOI   ScienceOn
4 Kirby R. F. and Potts R. B. (1969) The Minimum Route Problem for Networks with Turn Penalties and Prohibitions. Transportation Research 3, pp.397-408
5 Daganzo C.F. and Sheffi Y. (1977) On Stochastic Models of Traffic Assignment. Transportation Science 11(3). pp.253-274   DOI   ScienceOn
6 Moore E. F. (1957) The Shortest Path through A Maze. Proc. Int. Conf. on the Theory of Switching. Harvard Univ., Cambridge, MA
7 Lee M. (2004) Transportation Network Models and Algorithms Considering Directional Delay and Prohibition for Intersection Movement, Ph.D. Thesis, University of Wisconsin-Madison
8 이미영.백남철.문병섭.강원의 (2005), 경로인지비용을 반영한 사용자최적통행배정모형, 대한교통학회지, 제23권 제2호, 대한교통학회, pp.117-130