Finding the K Least Fare Routes In the Distance-Based Fare Policy |
Lee, Mi-Yeong
(한국건설기술연구원)
Baek, Nam-Cheol (한국건설기술연구원) Mun, Byeong-Seop (한국건설기술연구원) Gang, Won-Ui (한국건설기술연구원) |
1 | Ziliaskopoulos A. and Wardell W. (2000), An Intermodal Optimum Path Algorithm for Multimodal Networks with Dynamic Arc Travel Times and Switching Delays, European Journal of Operational Research 125, pp.486-502 DOI ScienceOn |
2 | De Cea. J. and J.E. Fernandez. (1989), Transit Assignment for Minimal Routes: An Efficient New Algorithm, Traffic Engng. Control, pp.492-494 |
3 | Dijkstra E. W. (1959), A Note of Two Problems in Connected with Graphs, Numerical Mathematics. 1, pp.269-271 DOI |
4 | Lozano A. & Storchi G. (2002), Shortest Viable Hyperpath in Multimodal Networks, Transportation Research B 36, pp.853-874 DOI ScienceOn |
5 | Yen J. Y. (1971), Finding the K shortest Loopless Paths in a Network, Management Science, Vol.17, pp. 711-715 DOI ScienceOn |
6 | Pollack M. (1961), The Kth Best Route Through A Network, Operations Research, Vol. 9, pp.578-580 DOI ScienceOn |
7 | 이미영 . 백남철 . 남두희 . 신성일 (2004), 거리비례제 요금부과에 따른 최소요금경로탐색, 대한교통학회지, 제22권 제6호, pp.101-108 |
8 | 장인성 (2000), 서비스시간 제약이 존재하는 도시부 복합교통망을 위한 링크기반의 최단경로탐색 알고리즘, 대한교통학회지, 제18권 제6호, pp.111-121 과학기술학회마을 |
9 | 김현명 . 임용택 . 이승재 (1999), 통합교통망 수단 선택-통행배정모형 개발에 관한 연구, 대한교통학회지, 제17권 제5호, pp.87-98 |
10 | 김현명 . 임용택 (2000), 알고리즘을 이용한 전역 탐색 최단경로 알고리즘개발, 대한교통학회지, 제16권 제2호, pp.157-167 |
11 | Shier R. D. (1979), On Algorithms from Finding the k Shortest Paths in a Network, Networks, Vol. 9, pp.195-214 DOI ScienceOn |
12 | Lozano A. & Storchi G. (2001), Shortest Viable Path Algorithm in Multimodal Networks, Transportation Research A 35(3), pp.225-241 DOI ScienceOn |
13 | Azevedo J. A.. Costa M. E. O. S.. Madeira J.J.E.R.S., and Martins E.Q.V. (1993), An Algorithm from the Ranking of Shortest Paths, European Journal of Operational Research, Vol. 69, pp.97-106 DOI ScienceOn |
14 | De Cea. J. and J.E. Fernandez. (1993), Transit Assignment for Congested Public Transport Systems: An Equilibrium Model, Transportation Science Vol. 27 DOI |
15 | Tong C. O. and Richardson A. J. (1984), Computer Model for Finding the Time-Dependent Minimum Path in Transit Systems with Fixed Schedules, Journal of Advanced Transportation 18, pp. 145-161 DOI ScienceOn |
16 | Potts R.B. and Oliver R.M. (1972), Flows in Transportation Networks, Academic Press |
17 | Bellman R. (1957), Dynamic Programming, Princeton University Press, Princeton, New Jersey |
18 | Martins E.Q.V. (1984), An Algorithm for Ranking Paths that May Contain Cycles, European Journal of Operational Research, Vol. 18, pp.123-130 DOI ScienceOn |
19 | Bellman R. and Kalaba R. (1968), On Kth Best Policies, J. SIAM 8. pp.582-588 |
20 | Lee M. (2004), Transportation Network Models and Algorithms Considering Directional Delay and Prohibition for Intersection Movement, Ph.D. Thesis, University of Wisconsin-Madison |