• Title/Summary/Keyword: Historical Profile

Search Result 35, Processing Time 0.023 seconds

Travel Time Forecasting in an Interrupted Traffic Flow by adopting Historical Profile and Time-Space Data Fusion (히스토리컬 프로파일 구축과 시.공간 자료합성에 의한 단속류 통행시간 예측)

  • Yeo, Tae-Dong;Han, Gyeong-Su;Bae, Sang-Hun
    • Journal of Korean Society of Transportation
    • /
    • v.27 no.2
    • /
    • pp.133-144
    • /
    • 2009
  • In Korea, the ITS project has been progressed to improve traffic mobility and safety. Further, it is to relieve traffic jam by supply real time travel information for drivers and to promote traffic convenience and safety. It is important that the traffic information is provided accurately. This study was conducted outlier elimination and missing data adjustment to improve accuracy of raw data. A method for raise reliability of travel time prediction information was presented. We developed Historical Profile model and adjustment formula to reflect quality of interrupted flow. We predicted travel time by developed Historical Profile model and adjustment formula and verified by comparison between developed model and existing model such as Neural Network model and Kalman Filter model. The results of comparative analysis clarified that developed model and Karlman Filter model similarity predicted in general situation but developed model was more accurate than other models in incident situation.

Dynamic Route Guidance via Road Network Matching and Public Transportation Data

  • Nguyen, Hoa-Hung;Jeong, Han-You
    • Journal of IKEEE
    • /
    • v.25 no.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.

Customer Behavior Data Model using User Profile Analysis

  • Jung, Yong Gyu;Lee, Agatha;Lee, Jeong Chan;Lee, Young Dae
    • International Journal of Advanced Culture Technology
    • /
    • v.1 no.2
    • /
    • pp.13-17
    • /
    • 2013
  • Today, most of the companies have numerous issues to take advantage of the data within the organization. Modeling techniques could be described using profile and historical log data as a tool of data mining techniques. It is covered increasingly with data entry, research, processing, modeling and reporting components of the icon in the form of easy-to-use in many datamining tools. Visual data mining process can create a data stream. In this paper, customer behavior is predicted in pages or products, using the history profile analysis and the navigation items are necessary to predict unknown features.

  • PDF

A Study on the Construction of Historical Profiles for Freeway Travel Time Forecasting (고속도로 통행시간 예측을 위한 과거 통행시간 이력자료 구축에 관한 연구(지점 검지기를 중심으로))

  • Kim, Dong-Ho;Rho, Jeong-Hyun;Park, Dong-Joo;Park, Jee-Hyung;Kim, Han-Soo
    • Journal of Korean Society of Transportation
    • /
    • v.26 no.5
    • /
    • pp.131-141
    • /
    • 2008
  • The objective of this study is to propose methods for determining optimal representative value and the optimal size of historical data for reliable travel time forecasting. We selected values with the smallest mean of forecasting errors as the optimal representative value of travel time pattern data. The optimal size of historical data used was determined using the CVMSE(Cross Validated Mean Square Error) method. According to the results of applying the methods to point vehicle detection data of Korea Highway Corporation, the optimal representative value were analyzed to be median. Second, it was analyzed that 60 days' data is the optimal size of historical data usedfor travel time forecasting.

A Study on the Construction of Historical Profiles for Travel Speed Prediction Using UTIS (UTIS기반 구간통행속도 예측을 위한 교통이력자료 구축에 관한 연구)

  • Ki, Yong-Kul;Ahn, Gye-Hyeong;Kim, Eun-Jeong;Bae, Kwang-Soo
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.11 no.6
    • /
    • pp.40-48
    • /
    • 2012
  • In this paper, we suggests methods for determining optimal representative value and the optimal size of historical data for reliable travel speed prediction. To evaluate the performance of the proposed method in real world environments, we did field tests at four roadway links in Seoul on Tuesday and Sunday. According to the results of applying the methods to historical data of Central Traffic Information Center, the optimal representative value were analyzed to be average and weighted average. Second, it was analyzed that 2 months data is the optimal size of historical data used for travel speed prediction.

A Travel Time Estimation Algorithm using Transit GPS Probe Data (Transit GPS Data를 이용한 링크통행시간 추정 알고리즘 개발)

  • Choi, Keechoo;Hong, Won-Pyo;Choi, Yoon-Hyuk
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.26 no.5D
    • /
    • pp.739-746
    • /
    • 2006
  • The bus probe-based link travel times were more readily available due to bus' fixed route schedule and it was different from that of taxi-based one in its value for the same link. At the same time, the bus-based one showed less accurate information than the taxi-based link travel time, in terms of reliability expressed by 1-RMSE(%) measure. The purpose of this thesis is to develop a heuristic algorithm for mixing both sources-based link travel times. The algorithm used both real-time and historical profile travel times. Real-time source used 4 consecutive periods' average and historical source used average value of link travel time for various congestion levels. The algorithm was evaluated for Seoul urban arterial network 3 corridors and 20 links. The results based on the developed algorithm were superior than the mere fusion based link travel times and the reliability amounted up to 71.45%. Some limitation and future research agenda have also been discussed.

Short-term Load Forecasting of Buildings based on Artificial Neural Network and Clustering Technique

  • Ngo, Minh-Duc;Yun, Sang-Yun;Choi, Joon-Ho;Ahn, Seon-Ju
    • Journal of IKEEE
    • /
    • v.22 no.3
    • /
    • pp.672-679
    • /
    • 2018
  • Recently, microgrid (MG) has been proposed as one of the most critical solutions for various energy problems. For the optimal and economic operation of MGs, it is very important to forecast the load profile. However, it is not easy to predict the load accurately since the load in a MG is small and highly variable. In this paper, we propose an artificial neural network (ANN) based method to predict the energy use in campus buildings in short-term time series from one hour up to one week. The proposed method analyzes and extracts the features from the historical data of load and temperature to generate the prediction of future energy consumption in the building based on sparsified K-means. To evaluate the performance of the proposed approach, historical load data in hourly resolution collected from the campus buildings were used. The experimental results show that the proposed approach outperforms the conventional forecasting methods.

The Historical Study of SDI System (2) (SDI System의 사적 연구 (2))

  • Kim, Chong Hwoe
    • Journal of the Korean Society for information Management
    • /
    • v.2 no.2
    • /
    • pp.150-169
    • /
    • 1985
  • This study is to introduce the SDI(Selective Dissemination of Information) system, a typical aspect of information retrieval systems nowadays quite popular. The term "SDI" is most often used to describe systems of using electronic data processing equipment as a means of matching the terms of user-interest profile against document descriptors and selecting those documents with a specified degree of similarity to the terms of the user-interest profile. Various up-ta-date informations on SDI systems developed after the first introduction of the original idea by "Luhn" are reviewed and compared. The stage of development, structure, characteristics, and various other matters concerning the SDI systems are analyzed, and discussed.

  • PDF

The Historical Study of SDI System (SDI System의 사적연구(史的硏究)(1))

  • Kim, Chong Hwoe
    • Journal of the Korean Society for information Management
    • /
    • v.1 no.1
    • /
    • pp.146-161
    • /
    • 1984
  • This study is to introduce the SDI(Selective Dissemination of Information) system, a typical aspect of information retrieval systems nowadays quite popular. The term "SDI" is most often used to describe systems of using electronic data processing equipment as a means of matching the terms of user-interest profile against document descriptors and selecting those documents with a specified degree of similarity to the terms of the user-interest profile. Various up-to-date informations on SDI systems developed after the first introduction of the original idea by "Luhn" are reviewed and compared. The stage of development, structure, characteristics, and various other matters concerning the SDI systems are analyzed and discussed.

  • PDF