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 (한양대학교 교통시스템공학과) |
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 |