• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1999년도 하계종합학술대회 논문집
• /
• 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.

• 한국ITS학회:학술대회논문집
• /
• 한국ITS학회 2003년도 제2회 정기총회 및 추계학술대회
• /
• pp.324-329
• /
• 2003

• 산업경영시스템학회지
• /
• 제22권50호
• /
• pp.333-340
• /
• 1999

An ideal traffic control system should consider simultaneously both route guidance of vehicles and signal policies at intersection of a traffic network. It is known that an iterative procedure gives an optimal route to each vehicle in the network. This paper presents an iterative procedure to find an optimal signal plan for the network. We define the optimal solution as a signal equilibrium. From the definition of signal equilibrium, we prove that the fixed point solution of the iterative procedure is a signal equilibrium, when optimal signal algorithms are implemented at each intersection of the network. A combined model of route guidance and signal planning is also suggested by relating the route guidance procedure and the signal planning procedure into a single loop iterative procedure.

• 산업공학
• /
• 제11권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.

• 산업공학
• /
• 제14권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.

• 대한교통학회지
• /
• 제26권5호
• /
• pp.185-194
• /
• 2008

본 논문에서는 기본적으로 라우팅(routing) 메커니즘을 이용하는 개미 알고리즘(ant algorithm)을 이용하여 실시간으로 변화하는 교통 상황과 U턴, P턴 및 회전제약(좌회전 및 U턴 금지)을 고려하여 다수의 최적경로를 제한된 시간내에 탐색제시 할 수 있는 경로 유도 방법을 제시하고자 한다. 이 방법은 기존 최적경로알고리즘과 비교하여 회전 제약 상황을 쉽고 빠르게 고려할 수 있는 장점이 있다.

• 전기전자학회논문지
• /
• 제25권4호
• /
• pp.756-761
• /
• 2021

Dynamic route guidance (DRG) finds the fastest path from a source to a destination location considering the real-time congestion information. In Korea, the traffic state information is available by the public transportation data (PTD) which is indexed on top of the node-link map (NLM). While the NLM is the authoritative low-detailed road network for major roads only, the OpenStreetMap road network (ORN) supports not only a high-detailed road network but also a few open-source routing engines, such as OSRM and Valhalla. In this paper, we propose a DRG framework based on road network matching between the NLM and ORN. This framework regularly retrieves the NLM-indexed PTD to construct a historical speed profile which is then mapped to ORN. Next, we extend the Valhalla routing engine to support dynamic routing based on the historical speed profile. The numerical results at the Yeoui-do island with collected 11-month PTD show that our DRG framework reduces the travel time up to 15.24 % and improves the estimation accuracy of travel time more than 5 times.

• 대한기계학회:학술대회논문집
• /
• 대한기계학회 2008년도 추계학술대회A
• /
• pp.979-983
• /
• 2008

A bi-modal tram can travel in not only dedicated way but also road so as to reduce construction costs and increase vehicle operation efficiency, whose passenger capacity is 2,500 to 7,000 persons/direction/hour. A bi-modal has an electronic guidance system that knows the location and route of the vehicle, and uses magnetic markers in the road surface for reference. Since a bi-modal tram will be operated in the downtown area, there is some possibility that strong wind occurred between high-rise buildings can produce sudden lateral movement (displacement) of the vehicle to influence its automatic operation controlled by electronic guidance system. For bi-modal tram in the automatic operation mode, lateral movements occurred by strong wind were calculated and analyzed in the dynamic model developed by using the ADAMS. Some useful relations among vehicle speeds, wind speeds, and lateral behaviors were discussed in this paper.

• 대한공간정보학회지
• /
• 제18권4호
• /
• pp.101-107
• /
• 2010

본 연구의 목적은 벡터 도메인 안에 대규모 도로 선형 사상을 대상으로 실시간 데이터 변경, 관리가 가능한 네트워크의 다중 표현 데이터베이스 모델을 구축하는 것이다. 즉, 최상위 레벨의 네트워크 데이터로부터 이에 대응하는 하위 베이스 네트워크 데이터로 순차적으로 데이터 통합과 자동 매칭을 수행하는 상의하달 방식(top-down)을 기초로 하는 프레임워크를 제시하며, 이를 통해 변화 가능한 축척(variable-scale)의 지도를 생성하는 모델을 제안하였다. 구현된 MRDB(Multi-Resolution Database) 모델을 차량 항법 서비스에 적용하여 실제 동적 경로 안내 시스템에 활용 가능함을 확인할 수 있었다.

• 산업기술연구
• /
• 제21권A호
• /
• pp.241-249
• /
• 2001

The objective of this paper is to develop the optimal path algorithm for dynamic route guidance system in advanced traveler information system (ATIS). The travel time is forecasted in each path between network nodes. Floyd-Warshall algorithm is used to find the optimal route based on this forecasted travel time in dynamic traffic network. This algorithm is modified to apply the real traffic network that has left-turn restriction, U-turn, and P-turn. A big value is assigned to one of arcs in turn restriction and a virtual node is used to consider U-turn and P-turn for Floyd-Warshall algorithm.