• Title/Summary/Keyword: Dynamic Route Guidance System (DRGS)

Search Result 8, Processing Time 0.031 seconds

A Study on Telecommunication Media and Dynamic Route Guidance Systems for Intelligent Transport System (지능형교통시스템을 위한 정보통신 매체와 동적경로 유도체계 확립에 관한 연구)

  • Kim, Sung-Soo
    • IE interfaces
    • /
    • v.11 no.1
    • /
    • pp.33-40
    • /
    • 1998
  • The objective of this paper is to help organizations select a suitable telecommunications media and dynamic route guidance system (DRGS) for an intelligent transport system (ITS) taking into account both cost and functionality. The media selection criteria and wireless communications for an ITS are discussed along with various DRGS. We describe which kind of telecommunication media and DRGS are suitable. The strategy of an ITS in Korea is described in regards to telecommunication media and DRGS.

  • PDF

A Proposal of the Real time Optimal Route Algorithm With Window mechanism (윈도우 매커니즘을 이용한 실시간 최적경로 추출 알고리즘 제안)

  • 이우용;하동문;신준호;김용득
    • Proceedings of the IEEK Conference
    • /
    • 1999.06a
    • /
    • pp.737-740
    • /
    • 1999
  • This paper deals with a real time optimization algorithm within real time for DRGS(Dynamic Route Guidance System) and evaluate the algorithm. A pre-developed system offers the optimal route in using only static traffic information. In using real-time traffic information, Dynamic route guidance algorithm is needed. The serious problem in implementing it is processing time increase as nodes increase and then the real time processing is impossible. Thus, in this paper we propose the optimal route algorithm with window mechanism for the real-time processing and then evaluate the algorithms.

  • PDF

Development of Dynamic Route Guidance System for Multiple Shortest Paths Using Genetic Algorithm (유전자알고리듬을 사용하여 다수최적경로를 제공할 수 있는 동적경로유도시스템의 개발)

  • Kim, Sung-Soo;Jeong, Jong-Du;Lee, Jong-Hyun
    • IE interfaces
    • /
    • v.14 no.4
    • /
    • pp.374-384
    • /
    • 2001
  • The objective of this paper is to design the dynamic route guidance system(DRGS) and develop a genetic algorithm(GA) for finding the multiple shortest paths in real traffic network. The proposed GA finds a collection of paths between source and destination considering turn-restrictions, U-turn, and P-turn that are genetically evolved until an acceptable solution is reached. This paper also shows the procedure to find the multiple shortest paths in traffic network of Seoul.

  • PDF

Ant Algorithm for Dynamic Route Guidance in Traffic Networks with Traffic Constraints (회전 제약을 포함하고 있는 교통 네트워크의 경로 유도를 위한 개미 알고리즘)

  • Kim, Sung-Soo;Ahn, Seung-Bum;Hong, Jung-Ki;Moon, Jae-Ki
    • Journal of Korean Society of Transportation
    • /
    • v.26 no.5
    • /
    • pp.185-194
    • /
    • 2008
  • The objective of this paper is to design the dynamic route guidance system(DRGS) and develop an ant algorithm based on routing mechanism for finding the multiple shortest paths within limited time in real traffic network. The proposed ant algorithm finds a collection of paths between source and destination considering turn-restrictions, U-turn, and P-turn until an acceptable solution is reached. This method can consider traffic constraints easily comparing to the conventional shortest paths algorithms.

An Approximate Shortest Path Re-Computation Method for Digital Road Map Databases in Mobile Computing Environments (모바일 컴퓨팅 환경에서의 디지털 로드맵 데이타베이스를 위한 근접 최단 경로 재계산 방법)

  • 김재훈;정성원;박성용
    • Journal of KIISE:Databases
    • /
    • v.30 no.3
    • /
    • pp.296-309
    • /
    • 2003
  • One of commercial applications of mobile computing is ATIS(Advanced Traveler Information Systems) in ITS(Intelligent Transport Systems). In ATIS, a primary mobile computing task is to compute the shortest path from the current location to the destination. In this paper, we have studied the shortest path re-computation problem that arises in the DRGS(Dynamic Route Guidance System) in ATIS where the cost of topological digital road map is frequently updated as traffic condition changes dynamically. Previously suggested methods either re-compute the shortest path from scratch or re-compute the shortest path just between the two end nodes of the edge where the cost change occurs. However, these methods we trivial in that they do not intelligently utilize the previously computed shortest path information. In this paper, we propose an efficient approximate shortest path re-computation method based on the dynamic window scheme. The proposed method re-computes an approximate shortest path very quickly by utilizing the previously computed shortest path information. We first show the theoretical analysis of our methods and then present an in-depth experimental performance analysis by implementing it on grid graphs as well as a real digital road map.

An Adaptive Strategy for Providing Dynamic Route Guidance under Non-Recurrent Traffic Congestion (돌발적 교통혼잡발생시 동적경로안내를 위한 적응형 알고리즘개발에 관한 연구)

  • 이상건
    • Proceedings of the KOR-KST Conference
    • /
    • 1996.12a
    • /
    • pp.81-108
    • /
    • 1996
  • 첨단교통정보시스템(ATIS)의 핵심 요소라 할 수 있는 동적경로안내 시스템(Dynamic Route Guidance System : DRGS)은 운전자가 목적지에 도착하기까지 실시간 교통정보를 토대로 최적경로를 안내해 줌으로써 날로 심화되어 가고 있는 교통혼잡을 최소화할 수 있으리라 기대를 모으고 있다. 특히 교통사고나 긴급도로공사 등으로 인해 발생하는 돌발적 교통혼잡하에서는 DRGS의 역할이 더욱 커질 것으로 예상되고 있다. 본 논문은 돌발적 교통혼잡하에서 보다 효과적인 DRGS의 경로 안내 알고리즘을 개발하는 데 그 목적이 있다. 이를 위해서 우선 하부구조기반(Infrastructure Based) DRGS와 개인차량기반(In-vehicle Based)DRGS의 장단점을 운전자, 교통행정당국, 그리고 교통체계관점에서 비교하였고, 시스템 아키텍쳐와 경로안내 알고리즘간의 상호관계를 규명하였다. 또한 효율적인 경로안내를 위해 사용자 평형(User Equilibrium)경로안내전략과 시스템최적화(System Optimal) 경로안내전략을 이상형 교통망(Idealistic Network)을 통해 비교분석하였다. 여기에는 현재 ITS-America에서 System Architecture 평가를 위해 사용한 INTEGRATION이라는 ITS Simulation Model과 그 통행저항함수를 사용하였다. 이를 토대로 돌발적 교통혼잡상황 아래서 사용자평형 경로안내를 제공할 경우 야기될 수 있는 Braess` Paradox 문제와, 총통행시간을 최소화하기 위한 시스템최적 경로안내를 제공할 경우 일어날 수 있는 사용자 호응도(User Compliance)문제를 동시에 고려한 적응형 동적경로안내 알고리즘을 개발하였다. 여기에는 돌발적 교통혼잡하에서 통행시간을 동적으로 예측하기 위해 이산형 확정적 대기행렬모형(Discrete Deterministic Queueing Model)이 사용되었다. 한편 알고리즘의 효율성을 평가하기 위해 이상형 교통망과, 실제 미국 Virginia 주의 Fairfax County에 소재한 주간 고속도로 66번(I-66)과 인접 교통망의 교통자료를 사용하여 각종 돌발교통 혼잡 상황을 전제로 한 Traffic Simulation과 정보제공시나\리오를 INTEGRATION Model을 이용해 실행하였다. 그 결과 적응형 알고리즘이 개개인의 최단시간 경로를 제공하는 사용자 평형 경로안내전략에 비해 교통혼잡도와 정체시간의 체류정도에 따라 3%에서 10%까지 전체통행시간을 절약할 수 있다는 결론을 얻었다.

  • PDF

Development of a neural-based model for forecating link travel times (신경망 이론에 의한 링크 통행시간 예측모형의 개발)

  • 박병규;노정현;정하욱
    • Journal of Korean Society of Transportation
    • /
    • v.13 no.1
    • /
    • pp.95-110
    • /
    • 1995
  • n this research neural -based model was developed to forecast link travel times , And it is also compared wiht other time series forecasting models such as Box-Jenkins model, Kalman filter model. These models are validated to evaluate the accuracy of models with real time series data gathered by the license plate method. Neural network's convergency and generalization were investigated by modifying learning rate, momentum term and the number of hidden layer units. Through this experiment, the optimum configuration of the nerual network architecture was determined. Optimumlearining rate, momentum term and the number of hidden layer units hsow 0.3, 0.5, 13 respectively. It may be applied to DRGS(dynamic route guidance system) with a minor modification. The methods are suggested at the condlusion of this paper, And there is no doubt that this neural -based model can be applied to many other itme series forecating problem such as populationforecasting vehicel volume forecasting et .

  • PDF

Improvement of ATIS Model Performance under Connected Vehicle Environment

  • Kim, Hoe-Kyoung
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.11 no.4
    • /
    • pp.10-18
    • /
    • 2012
  • This paper develops a decentralized advanced traveler information system (ATIS) under the connected vehicle environment, recently regarded as one of most promising tools in Intelligent Transportation Systems (ITS). The performance of the proposed ATIS is reinforced by introducing autonomous automatic incident detection (AAID) function. The proposed ATIS is implemented and tested using an off-the-shelf microscopic simulation model (VISSIM) on a simple traffic network under idealized communication conditions. A key attribute of this experiment is the inclusion of a non-recurrent traffic state (i.e., traffic incident). Simulation results indicate that the ATIS using V2V communication is efficient in saving drivers' travel time and AAID plays an important role in improving the effectiveness of the system.