• Journal of Korean Society of Transportation
• /
• v.23 no.7 s.85
• /
• pp.99-110
• /
• 2005

Total travel cost of route which connects origin with destination (O-D) is consist of the total sum of link travel cost and route perception cost. If the link perception cost is different according to the origin and destination, optimal route search has limitation to reflect the actual condition by route enumeration problem. The purpose of this study is to propose optimal route searching formulation and algorithm which is enable to reflect different link perception cost by each route, not only avoid the enumeration problem between origin and destination. This method defines minimum unit of route as a link and finally compares routes using link unit costs. The proposed method considers the perception travel cost at both origin and destination in optimal route searching process, while conventional models refect the perception cost only at origin. However this two-way searching algorithm is still not able to guarantee optimum solution. To overcome this problem, this study proposed an orign based optimal route searching method which was developed based on destination based optimal perception route tree. This study investigates whether proposed numerical formulas and algorithms are able to reflect route perception behavior reflected the feature of origin and destination in a real traffic network by the example research including the diversity of route information for the surrounding area and the perception cost for the road hierarchy.

• Journal of Korean Society of Transportation
• /
• v.22 no.5
• /
• pp.111-122
• /
• 2004

The driver's decision making (e.g. route choice) is a typical decision making with an uncertainty. In this paper, we investigate the effect of route guidance information on driver's route choice and learning behavior and analyse the potential of information system in a road network in which traffic flows follow random walk. A Simulation performed focuses on the relationship among the network wide performance, message receiving rates and driver's learning mechanism. We know that at high levels of message receiving rates, the network-wide performance may get worse. However, at low levels of receiving rates, we found that the travel time when guidance information is provided decrease compared to the cases when no pubic information is provided. Also, we found that the learning parameter of the learning mechanism model always changes under nonstationary traffic condition. In addition, learning process of drivers does not converge on any specific value. More investigation is needed to enlarge the scope of the study and to explore more deeply driver's behavior.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.7
• /
• pp.103-111
• /
• 2014

This paper proposes a modified algorithm that improves on Dijkstra's algorithm by applying it to purely two-way traffic paths, given that a road where bi-directional traffic is made possible shall be considered as an undirected graph. Dijkstra's algorithm is the most generally utilized form of shortest-path search mechanism in GPS navigation system. However, it requires a large amount of memory for execution for it selects the shortest path by calculating distance between the starting node and every other node in a given directed graph. Dijkstra's algorithm, therefore, may occasionally fail to provide real-time information on the shortest path. To rectify the aforementioned shortcomings of Dijkstra's algorithm, the proposed algorithm creates conditions favorable to the undirected graph. It firstly selects the shortest path from all path vertices except for the starting and destination vertices. It later chooses all vertex-outgoing edges that coincide with the shortest path setting edges so as to simultaneously explore various vertices. When tested on 9 different undirected graphs, the proposed algorithm has not only successfully found the shortest path in all, but did so by reducing the time by 60% and requiring less memory.

• Journal of Korean Society of Transportation
• /
• v.24 no.5 s.91
• /
• pp.77-88
• /
• 2006

The purpose of this study is to Propose the time dependent K-least time path algorithm applicable to a real-time based operation strategy in multi-modal transportation network. For this purpose, we developed the extended method based on entire path deletion method which was used in the static K-least time path algorithm. This method was applied to time dependent K-least time path algorithm to find k least time paths in order based on both time dependant mode-link travel time and transfer cost In particular, this algorithm find the optimal solution, easily describing transfer behavior, such as walking and waiting for transfer by applying a link-based time dependent label. Finally, we examined the verification and application of the Proposed algorithm through case study.

• Proceedings of the Korean Reliability Society Conference
• /
• 2001.06a
• /
• pp.479-486
• /
• 2001

일시적인 행사, 도로공사 또는 교통사고로 인해 도로용량이 저하되거나 도로가 폐쇄되는 경우, 운전자들은 당초 자신이 원하는 시간에 목적지에 도달하지 못함에 따라 스케쥴 지체를 경험하게 된다. 이는 교통망의 신뢰성이 저하됨으로서 발생하는 것으로 이들 비 반복적인 혼잡요소들을 운전자의 경로선택행위에 포함시킬 필요가 있다. 이런 측면에서 본 연구에서는 기존 교통분야에서 소홀히 다루었던 신뢰성이라는 개념을 운전자 행태모형에 도입하는 방안을 제시코자 한다.

• Journal of Korean Society of Transportation
• /
• v.33 no.3
• /
• pp.256-267
• /
• 2015

The intelligent transportation systems allow us to have valuable opportunities for collecting wide-area coverage traffic data. The significant efforts have been made in many countries to provide the reliable traffic conditions information such as travel time. This study analyzes the impacts of the fog weather conditions on the traffic stream. Also, a strategy for predicting the long-term traffic speeds is developed under foggy weather conditions. The results show that the average of speed reductions are 2.92kph and 5.36kph under the slight and heavy fog respectively. The best prediction performance is achieved when the previous 45 pattern cases data is used, and the 14.11% of mean absolute percentage error(MAPE) is obtained. The outcomes of this study support the development of more reliable traffic information for providing advanced traffic information service.

• Journal of Korean Society of Transportation
• /
• v.22 no.6
• /
• pp.121-131
• /
• 2004

The K-shortest path algorithms are largely classified into two groups: oneis for finding loopless path (simple path), another loop paths. In terms of cimputational complexities, in general the loop-paths-finding ones are considered more efficient and easier to be handled than the loopless-paths-finding. The entire path deletion methods have been known as the best efficient algorithms among the proposed K-shortest path algorithms. These algorithms exploit the K-th network transformation to prevent the same path, which was already selected as the (K-1)th path, from being redetected. Nevertheless, these algorithms have a critical limitationto be applied in the practical traffic networks because the loops, in which the same modes and links can be unlimitedly repeated, are not preventable. This research develops a way to be able to selectively control loop-paths by applying link-label. This research takes an advantage of the link-based shortest path algorithms that since the algorithms can take care of two links simultaneouslyin the searching process, the generation of loops can be controlled in the concatenation process of the searched link and the preceded link. In concatenation of two links, since the precede link can be treated a sub-shortest to this link from the origination, whether both the node and the link of the searched link were already existed or not can be evaluated. Terefore, both the node-loopless path, in which the same node is not appeared, and the link-loopless, in which the same link is not appeared, can be separately controlled. Especially, the concept of the link-loopless path is expended to take into consideration reasonable route choice behaviors such as U-Turn, P-Turn, and Turn-Penalty, which are frequently witnessed in urban traffic network with intersections. The applicability of the proposed method is verified through case studies.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2016.10a
• /
• pp.810-813
• /
• 2016

기존 IoT 스마트 가로등은 모션 감지 센서를 이용하여 보행자를 감지하고, 가로등의 밝기를 조정하는 형태로 구성된다. 하지만 이러한 방법은 보행자가 나아갈 길을 미리 예측하여 밝혀주지 않는다. 특히 기존 방법은 보행자 현재 위치만 밝힐 뿐, 나아갈 길은 어두운 상태이기 때문에 통행에 불편함을 겪고 있다. 본 논문에서는 보행자 경로를 미리 파악하여 가로등 밝기를 조절하는 방식을 소개한다. 보행자의 현재 위치를 파악하기 위해 모션 감지 센서를 이용하며, 보행자 경로 예측은 모션 벡터를 사용하여 가로등 밝기를 조절한다. 이러한 개선을 통하여 보행자의 편의 증대와 범죄 예방 등 긍정적인 효과를 기대 할 수 있다.

• Spatial Information Research
• /
• v.13 no.3 s.34
• /
• pp.221-237
• /
• 2005

This study attempts at building a GIS computing environment that incorporates object-relational spatio-temporal database for the time geography model with space-time path, space-time prism and space-time accessibility. The proposed computing environment is composed of ( i ) mobile GIS application for collecting spatio-temporal trajectory data of an individual, ( ii ) spatio-temporal database server that includes time geography model, and (iii) geovisualization client that performs time geographic queries to the spatio-temporal database. The spatio-temporal trajectory data collected by GPS-PDA client is automatically processed and sent to server through data management middleware. The spatio-temporal database implemented by extending a generic DBMS provides spatio-temporal objects, functions, and SQL. The geovisualization client illustrates 3D visual results of the queries about space-time path, space-time prism, and space-time accessibility. This study confirms the possibility of integrating mobile GIS and DBMS for time geography model, and it presents the appropriate database model with spatio-temporal objects and functions that may handle very large data for time geography application.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.31 no.3D
• /
• pp.355-361
• /
• 2011

In order to properly evaluate ITS services exposed in SMART Highway project, a confident dynamic origin-destination (OD) is inevitably needed. This paper used WAVE communication information as a part of call and response (C&R) communication which constitutes core part of the technology for constructing OD. This information includes node information and vehicle information (e.g., latitude and longitude) as well as trajectory data and sample path volume date calculated using node information and vehicle information. A procedure developed to construct a dynamic OD and to validate OD is consist of 1) making toy network and one-hour 00 (random distribution), 2) collecting link information and vehicle information, 3) constructing five-minute OD, and 4) validating estimated OD result using traffic volume and travel time simultaneously. The constructed OD is about 84.79% correct within less than 20% error range for 15min traffic volume, and about 85.42%, within less than 20% error rate of 15 min travel time. Some limitations and future research agenda have also been discussed.