Browse > Article

A Kth Shortest Path Algorithm with the Link-Based Label Setting Approach and Its Application for An Alternative Routes Selection  

Lee, Mee-Young (한국건설기술연구원 첨단도로시스템연구센터)
Baik, Nam-Cheol (한국건설기술연구윈 첨단도로시스템연구센터)
Kang, Weon-Eui (한국건설기술연구원 첨단도로시스템연구센터)
Shin, Seong-Il (서울시정개발연구윈 도시교통연구부)
Publication Information
Journal of Korean Society of Transportation / v.22, no.4, 2004 , pp. 85-96 More about this Journal
Abstract
Given a Path represented by a sequence of link numbers in a transportation network, the reasonable path is defined as a path that any link is appeared multiple times in it. Application of the link labelmethod(LLM) to the shortest path algorithms(SPA) enables to model the reasonable path choice behavior in urban networks. This study aims at expanding the LLM to a Kth shortest path algorithms(KPSA), which adopts the node label setting method. The small-scaled network test demonstrated that the proposed algorithm works correctly and the revised Sioux fall network test showed that the path choice behaviors are reasonably reflected. In the large-scaled network based on the South Korea peninsula, drivers' route diversion perceptions are included as cost terms in total cost. The algorithm may be applied as an alternative route information tools for the deployment of ATIS.
Keywords
Label Setting; Kth Shortest Path Algorithm; Reasonable Path Choice; Link Label; Alternative Route;
Citations & Related Records
Times Cited By KSCI : 2  (Citation Analysis)
연도 인용수 순위
1 김현명.임용택(1999). 유전 알고리듬을 이용한 전역탐색 최단경로 알고리듬개발, 대한교통학회지, 제17권 제2호, 대한교통학회, pp.163-178   과학기술학회마을
2 이승환.최기주.김원길(1996), 도시부 ATIS 효율적 적용을 위한 탐색영역기법 및 양방향 링크탑색 알고리즘의 구현, 대한교통학회지, 제14권 제3호, 대한교통학회, pp.45-59
3 Dijkstra E.W. (1959), A Note of Two Problems in conneced with Graphs. Numerical Mathematics, I. pp.269-271
4 Yen J.Y. (1971). Finding the K shortest Looplees Paths in a network, Management Science. Vol. 17. pp. 771-715
5 장인성(2000), 서비스시간 제약이 존재하는 도시부 복합교통망을 위한 링크기반의 최근경로탐색 알고리즘, 대한교통학회지, 제18권 제6호, 대한교통학회, pp.111-121
6 Lee M. (2004). Transportation Network Models and Algorithms Considering Directional Delay and Prohibition for Intersection Movement, Ph,D Thesism University of Wisconsin-Madison
7 이미영.백남철,최대순,신성일(2004). 링크표시갱신 다수경로탐색 알고리즘, 대한교통학회지 제22권 제2호, 대한교통학회, pp.131-143
8 노정현. 남궁성(1995), 도시가로망에 적합한 최단 경로탐색기법의 개발, 국토계획, 제30권 제5호, 대한국토도시계획학회, pp.153-168
9 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
10 Potts R.B. and Oliver R.M.(1972). Flows in Transportation networks, Acadmic Press
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 Moore E.F. (1957). The Shortest Path through A Maze. Proc. Int Conf, on the Theory of Switching, Havard Univ, Cambridge. MA
13 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   DOI   ScienceOn
14 Bellman R. (1957). Dynamic Programming, Princeton university Press, Princeton, New Jersey
15 Bellman R, and Kalaba R. (1968). On Kth Best Policies. J SIAM S. pp.582-588
16 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
17 이미영.유기윤,김정현.신성일(2003). 덩굴망 통행 패턴을 고려한 One-To-One 다경로알고리즘. 대한교통학회지, 제21권 제6호. 대한교통학회. pp.89-99
18 임경원,임용택(2003) 교통망분석론. 서울대학교 출판부
19 Pollack M. (1961). The Kth Best Route Through A Network. Operations Research. Vol. 9. pp. 578-580   DOI   ScienceOn