• Title/Summary/Keyword: 최단경로흐름

Search Result 16, Processing Time 0.07 seconds

A dynamic Shortest Path Finding with Forecasting Result of Traffic Flow (교통흐름 예측 결과틀 적용한 동적 최단 경로 탐색)

  • Cho, Mi-Gyung
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.5
    • /
    • pp.988-995
    • /
    • 2009
  • One of the most popular services of Telematics is a shortest path finding from a starting point to a destination. In this paper, a dynamic shortest path finding system with forecasting result of traffic flow in the future was developed and various experiments to verify the performance of our system using real-time traffic information has been conducted. Traffic forecasting has been done by a prediction system using Bayesian network. It searched a dynamic shortest path, a static shortest path and an accumulated shortest path for the same starting point and destination and calculated their travel time to compare with one of its real shortest path. From the experiment, over 75%, the travel time of dynamic shortest paths is the closest to one of their real shortest paths than one of static shortest paths and accumulated shortest paths. Therefore, it is proved that finding a dynamic shortest path by applying traffic flows in the future for intermediated intersections can give more accurate traffic information and improve the quality of services of Telematics than finding a static shortest path applying by traffic flows of the starting time for intermediated intersections.

Street Search Algorithm That Consider Direction (방향성을 고려한 길 탐색 알고리즘)

  • Kim, Il-Ju;Lee, Kyu-Hwa;Lee, Song-Keun
    • Proceedings of the KIEE Conference
    • /
    • 2008.07a
    • /
    • pp.1837-1838
    • /
    • 2008
  • 최단 경로란 유향(有向) 또는 무향(無向) 그래프에서 어떤 두 점 사이를 맺는 유향 또는 무향 경로 중 가장 짧은 것, 즉 가지의 길이 합을 최소로 하는 것을 구하는 문제. 그래프가 평면 접속인 경우에는 쌍대(雙對) 그래프의 최대 흐름을 구하는 문제와 등가이다. 본 논문에서는 최단 경로 문제를 풀기 위하여 Dijkstra의 장점은 살리고 단점을 보완하는 방향성을 가지는 Dijkstra 알고리즘을 제안하였다. 사례연구를 통하여 제안한 알고리즘은 출발점에서 도착점까지 최단 경로를 빠른 시간에 찾아가는 것을 보였다.

  • PDF

A Design and Performance Evaluation of Path Search by Simplification of Estimated Values based on Variable Heuristic (가변 휴리스틱 기반 추정치 간소화를 통한 경로탐색 기법의 설계 및 성능 평가)

  • Kim, Jin-Deog
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.10 no.11
    • /
    • pp.2002-2007
    • /
    • 2006
  • The path search method in the telematics system should consider traffic flow of the roads as well as the shortest time because the optimal path with minimized travel time could be continuously changed by the traffic flow. The existing path search methods are not able to cope efficiently with the change of the traffic flow. The search method to use traffic information also needs more computation time than the existing shortest path search. In this paper, a method for efficiency improvement of path search is implemented and its performance is evaluated. The method employs the fixed grid for adjustable heuristic to traffic flow. Moreover, in order to simplify the computation of estimation values, it only adds graded decimal values instead of multiplication operation of floating point numbers with due regard to the gradient between a departure and a destination. The results obtained from the experiments show that it achieves the high accuracy and short execution time as well.

Performance Evaluation of a Survivable Ship Backbone Network Exploiting k-Shortest Disjoint Paths (k-최단 분리 경로 배정을 적용한 장애 복구형 선박 백본 네트워크의 성능 평가)

  • Tak, Sung-Woo
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.16 no.4
    • /
    • pp.701-712
    • /
    • 2012
  • The concept of $k$-shortest disjoint paths is considered important because the establishment of primary and backup forwarding paths exploiting shorter distance and faster propagation time is a dominant consideration for the design of a survivable backbone network. Therefore, we need to evaluate how well the concept of $k$-shortest disjoint paths is exploited for the design of a survivable ship backbone network considering the international standard related to ship backbone networks, the IEC61162-410 standard specifying how to manage redundant message transmissions among ship devices. Performance evaluations are conducted in terms of following objective goals: link capacity, hop and distance of primary and backup paths, even distribution of traffic flows, restoration time of backup forwarding paths, and physical network topology connectivity.

Analysis of Passenger Flows in the Subway Transportation Network of the Metropolitan Seoul (서울 수도권 지하철 교통망에서 승객 흐름의 분석)

  • Park, Jong-Soo;Lee, Keum-Sook
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.16 no.3
    • /
    • pp.316-323
    • /
    • 2010
  • We propose a method to find flows of transit users in the subway transportation network of the metropolitan Seoul and analyze the passenger flows on some central links of the network. The transportation network consists of vertices for subway stops, edges for links between two adjacent subway stops, and flows on the edges' Each subway transit user makes a passenger flow along edges of the shortest path from the origin stop to the destination stop in his trip. In this paper, we have developed a new algorithm to find the passenger flow of each link in the subway network from a large trip-transaction database of subway transit users. We have applied the algorithm to find the passenger flows from one day database of about 5 million transactions by the subway transit users. As results of the experiments, the travel behavior on 4 central subway links is analyzed in passenger flows and top 10 flows among all subway links are explained in a table.

Development of Optimal Rehabilitation Model for Water Distribution System Based on Prediction of Pipe Deterioration (I) - Theory and Development of Model - (상수관로의 노후도 예측에 근거한 최적 개량 모형의 개발 (I) - 이론 및 모형개발 -)

  • Kim, Eung-Seok
    • Journal of Korea Water Resources Association
    • /
    • v.36 no.1
    • /
    • pp.45-59
    • /
    • 2003
  • The method in this study, which is more efficiency than the existing method, propose the optimal rehabilitation model based on the deterioration prediction of the laying pipe by using the deterioration survey method of the water distribution system. The deterioration prediction model divides the deterioration degree of each pipe into 5 degree by using the probabilistic neural network. Also, the optimal residual durability is estimated by the calculated deterioration degree in each pipe and pipe diameter. The optimal rehabilitation model by integer programming base on the shortest path can calculate a time and cost of maintenance, rehabilitation, and replacement. Also, the model is divided into budget constraint and no budget constraint. Consequently, the model proposed by the study can be utilized as the quantitative method for the management of the water distribution system.

A practical approach for a lower bound of the number of wavelengths in WDM-based Optical transport networks (광전달망에서 최소 파장 수의 한계값을 구하는 실질적인 방법)

  • 이종원;박구현;이창희
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.23 no.5
    • /
    • pp.1222-1228
    • /
    • 1998
  • Most of researchers have tried to find heuristic methods for near-optimal solutions of establishing light paths with minimum number of wavelengths in wavelengh-routed optical networks. In order to provide a performance measure for heuristic approaches, we propose a practical approach for a lower bound of the number of wavelengths which is required to provide full connections in WDM-based optical transport networks. This method is based on a path-flow formulation using K-shortest paths for each connection. Compared with a general link-flow formulation, the proposed method has much lower complexity and so needs much less calcuation tiem while it gives the same results as a general link-flow formulation in some sample networks.

  • PDF

Intelligent Traffic System for Reaching Destinations in the Shortest Time (최단 시간 목적지 이동을 위한 교통 정보 시스템)

  • Lee Jongchan;Seo Minkoo;Park Sanghyun;Won JungIm
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2004.11a
    • /
    • pp.137-140
    • /
    • 2004
  • 최근 모바일 기기의 보급이 증가되고, 고급 어플리케이션의 동작이 가능해지는 등 모바일 장비의 사용 편이성이 급속도로 증가되고 있다. 또한 GPS 기술의 발전으로 인해 위치 기반 서비스가 여러 분야에서 널리 사용되고 있다. 본 논문에서는 고정된 노선을 이동하는 버스를 대상으로 목적지까지의 최단 시간 경로를 제공하는 교통 정보 시스템을 제안한다. 이를 위해 우선, 이동 객체인 버스와 관련된 정보를 효율적으로 저장, 관리, 검색할 수 있는 스키마와 질의 모델을 제안한다. 또한, 제안된 시스템에서는 최단 시간 경로를 위해 버스의 노선 정보 및 위치 정보, 정류장간 소요 시간 정보, 사용자의 근접 정류장까지의 이동 시간, 사용자의 도보 이동 시간 등의 정보를 활용한다. 대부분의 위치기반 서비스를 위한 시공간데이터베이스 기술에서는 이동 객체가 시간의 흐름에 따라 속도와 방향의 변화로 인한 임의의 동선으로 움직인다고 가정하고 있으며, 버스와 같이 고정된 노선을 이동하는 이동 객체의 관리 기법은 다루어지지 않고 있다. 따라서 본 논문의 연구 결과는 고정된 노선을 이동하는 이동 객체의 저장 및 이동 객체의 미래 위치 예측 기법에 활용될 수 있다.

  • PDF

Route Determination Service for the Open LBS (개방형 LBS 를 위한 경로탐색 서비스)

  • Kim, Sung-Soo;Kim, Jae-Chul;Kim, Kwang-Soo;Park, Jong-Hyun;Lee, Jong-Hun
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2003.11b
    • /
    • pp.713-716
    • /
    • 2003
  • 현재 국내 LBS 가 중요한 서비스로 널리 확산되기 위해서는 서비스간의 상호운용성이 제공되어야 한다. 본 논문에서는 LBS 서비스간 상호운용성을 제공하는 개방형 LBS 를 위한 경로탐색 서비스에 대한 설계 및 구현기법을 제시한다. 최단경로문제(Shortest Path Problem)는 통신망 및 교통망의 분석, 생산라인의 품질 관리 등의 다양한 분야 등의 네트워크 흐름 최적화 문제 중에서 가장 많이 연구되고 있는 문제다. 도로 교통망에서는 교차로상에서의 회전 제약 문제 등의 제한조건이 존재한다. 본 논문에서 경로탐색은 듀얼 그래프(dual graph)를 이용하여 회전제약조건을 만족하는 경로를 구할 수 있었고, 사용자 경로탐색 기준에 따른 탐색기법도 제시한다. 또한, 구현된 서비스는OpenLS의 표준화된 인터페이스를 구현하여 상호운용성(interoperability)을 지원하며, 자바를 이용한 웹서비스로 구현되어 이식성, 운영체제 및 프로그래밍 언어 독립성을 제공할 수 있는 장점이 있다.

  • PDF

Routing Protocol Supporting QoS in Mobile Ad-hoc Network (이동 애드 혹 네트워크에서 QoS를 지원하는 라우팅 프로토콜)

  • Kang, Kyung-In;Park, Kyung-Bae
    • Journal of the Korea Society of Computer and Information
    • /
    • v.12 no.2 s.46
    • /
    • pp.189-196
    • /
    • 2007
  • In this paper, we proposed a mobile ad hoc routing protocol based on AODV(Ad hoc On demand Distance Vector) with QoS(Quality of Service) support and evaluated the performance through simulation. The waste of communication resources is reduced by establishing the shortest route suitable to QoS support, considering in advance the usable communication resources at each node. For performance evaluation, we analyzed the average data reception rate, considering the node mobility and the number of best effort/QoS data flows. We found that in the mobile Ad Hoc networks the QoS service for some specific data flows increased the average data reception rate for the QoS data flows.

  • PDF