The Journal of The Korea Institute of Intelligent Transport Systems (한국ITS학회 논문지)

The Korea Institute of Intelligent Transport Systems (한국ITS학회)
권호 표지
DOI QR코드

DOI QR Code

Development of Shortest Path Searching Network Reduction Algorithm

최단경로 탐색영역 축소 알고리즘 개발

  • Published : 2013.04.30
Download PDF
⟨ Previous Next ⟩

Abstract

This study developed searching network reduction algorithm for reduce shortest path searching time. Developed algorithm is searching nodes that have the including possibility of less weights path than temporal path that consists minimum number of nodes and minimum sum of the straight line distances. The node that has the including possibility of shortest path is the node that the sum of straight line distance from start node and straight line distance to target node is less than the value that temporary path's weights divided by minimum weights units. If searching network reconstitutes only these nodes, the time of shortest path searching will be reduced. This developed algorithm has much effectiveness that start node and target node is close in large network.

본 연구에서는 최단경로 탐색 소요시간을 줄이기 위한 목적으로 탐색영역을 축소하는 알고리즘을 개발하였다. 개발된 알고리즘은 출발노드와 목적노드를 최소의 노드 수로 연결하면서 직선거리의 합이 최소인 임시경로를 구축하고, 구축된 임시경로의 부하량 보다 적은 부하량의 경로를 연결할 가능성이 있는 노드들을 찾는 것이다. 하나의 노드에서 출발노드까지의 직선거리와 목적노드까지의 직선거리 합이 임시경로의 부하량을 최소 가로 부하량 원단위로 나눈 값보다 적을 경우, 그 노드는 임시경로 보다 더 적은 부하량을 가질 수 있는 경로를 구성할 가능성이 있는 노드가 된다. 이와 같은 노드들만을 탐색영역으로 하면 탐색영역이 축소됨에 따라 최단경로 탐색 소요시간을 줄일 수 있게 된다. 개발된 알고리즘은 큰 탐색영역에서 출발노드와 목적노드가 가까울 경우 더욱 효과적이다.

Keywords

References

  1. Lipimg Fu and L. R. Rilett, "Expected shortest paths in dynamic and stochastic traffic networks", Transportation Research Part B, vol 32, no 7, pp.499-516, 1998. https://doi.org/10.1016/S0191-2615(98)00016-2
  2. Taehyeong Kim, Taehyeong Kim, Bum-Jin Park, Hyoungsoo Kim, "Development of One-to-One Shortest Path Algorithm Based on Link Flow Speeds on Urban Networks ", The Journal of The Korea Institute of Intelligent Transport Systems , vol 11, no 5, pp.38-45, 2012. https://doi.org/10.12815/kits.2012.11.5.038
  3. E.W. DIJKSTRA, "A Note on Two Problems in Connexion with Graphs", Numerische Mathematik1, pp.269-271, 1959. https://doi.org/10.1007/BF01386390
  4. Orda, A. and Rom, R. , "Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length", journal of the ACM 37, pp.607-625, 1990. https://doi.org/10.1145/79147.214078
  5. Kaufman, E. , Lee, J. and Smith, R. L. , "Fastest paths in time-dependent networks for intelligent vehicle highway systems application", IVHS journal 1(1), pp.1-11, 1993.
  6. Ziliaskopoulos, A.K. and Mahassani, H.S. ,"Time-dependent, shortest-path algorithms for real-time intelligent vehicle system applications", Transportation Research Record 1408, TRB, National Research Council, Washington DC, pp.94-100, 1993.
  7. Chabini, I. ,"A new algorithm for shortest-path in discrete dynamic networks", Proceeding of the 8th International Federation of Automatic Control Symposium on transportation Systems, Vol. 2, eds M. Papageorgiu and A. Pouliezos, pp.551-556, 1997.
  8. Hall, R. ,"The fastest path through a network with random time-dependent travel time", Transportation Science 20(3), pp182-188, 1986. https://doi.org/10.1287/trsc.20.3.182
  9. Ryu, Yeong-Geun, "A Study on the Forecasting of Bus Travel Demand and the Method of Determining Optimal Bus Network", Ph. D. Thesis, Yeong Nam University, pp.131-140, 1996.

Cited by

  1. Development of a Shortest Path Searching Algorithm Using Minimum Expected Weights vol.12, pp.5, 2013, https://doi.org/10.12815/kits.2013.12.5.036
  2. A Study on Changing Estimation Weights of A* Algorithm's Heuristic Function vol.14, pp.3, 2015, https://doi.org/10.12815/kits.2015.14.3.001
  3. A* 알고리즘의 최단경로 탐색 정확도 향상을 위한 역방향 적용방법에 관한 연구 vol.12, pp.6, 2013, https://doi.org/10.12815/kits.2013.12.6.001