SHORT-TERM TRAFFIC FLOW PREDICTION USING ARTIFICIAL INTELLIGENCE WITH PERIODIC CLUSTERING AND ELECTED SET

被引:0
|
作者
Dogan, Erdem [1 ]
机构
[1] Kirikkale Univ, Engn Fac, Dept Civil Engn, TR-71451 Kirikkale, Yahsihan, Turkey
来源
PROMET-TRAFFIC & TRANSPORTATION | 2020年 / 32卷 / 01期
关键词
traffic prediction; training set; short-term prediction; k-means; artificial neural networks; LOCALLY WEIGHTED REGRESSION; MULTIVARIATE; VEHICLE; NETWORK; MODELS; SYSTEM; SVR;
D O I
暂无
中图分类号
U [交通运输];
学科分类号
08 ; 0823 ;
摘要
Forecasting short-term traffic flow using historical data is a difficult goal to achieve due to the randomness of the event. Due to the lack of a solid approach to short-term traffic prediction, the researchers are still working on novel approaches. This study aims to develop an algorithm that dynamically updates the training set of models in order to make more accurate predictions. For this purpose, an algorithm called Periodic Oustering and Prediction (PCP) has been developed for use in short-term traffic forecasting. In this study, PCP was used to improve Artificial Neural Networks (ANN) predictive performance by improving the training set of ANN to predict short-term traffic flow using selected clusters. A large amount of traffic data collected from the US and UK motorways was used to determine the PCP ability to increase the ANN performance. The robustness of the proposed approach was determined by the performance measures used in the literature and the mean prediction errors of PCP were significantly below other approaches. In addition, the studies showed that the percentage errors of PCP predictions decreased in response to increasing traffic flow values. Considering the obtained positive results, this method can be used in real-time traffic control systems and in different areas needed.
引用
收藏
页码:65 / 78
页数:14
相关论文
共 50 条
  • [21] Metro short-term traffic flow prediction with ConvLSTM
    基于卷积长短时记忆神经网络的城市轨道交通短时客流预测
    Chen, Yan-Ru (chenyanru@swjtu.cn), 1600, Northeast University (36):
  • [22] Short-term traffic flow prediction using neuro-genetic algorithms
    Abdulhai, B
    Porwal, H
    Recker, W
    ITS JOURNAL, 2002, 7 (01): : 3 - 41
  • [23] Short-term traffic flow prediction using neuro-genetic algorithms
    Abdulhai, Baher
    Porwal, Himanshu
    Recker, Will
    ITS Journal: Intelligent Transportation Systems Journal, 2002, 7 (01) : 3 - 41
  • [24] Short-term Traffic Flow Prediction Using DTW-BiGRU Model
    Zou, Hanyi
    Liu, Heng
    Zhou, Tianli
    Li Jiashun
    Zhan, Yang
    2020 35TH YOUTH ACADEMIC ANNUAL CONFERENCE OF CHINESE ASSOCIATION OF AUTOMATION (YAC), 2020, : 557 - 562
  • [25] Construction of traffic state vector using mutual information for short-term traffic flow prediction
    Ryu, Unsok
    Wang, Jian
    Kim, Thaeyong
    Kwak, Sonil
    Juhyok, U.
    TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, 2018, 96 : 55 - 71
  • [26] SHORT-TERM TRAFFIC FLOW PREDICTION BASED ON GENETIC ARTIFICIAL NEURAL NETWORK AND EXPONENTIAL SMOOTHING
    Ma, Changxi
    Tan, Limin
    Xu, Xuecai
    PROMET-TRAFFIC & TRANSPORTATION, 2020, 32 (06): : 747 - 760
  • [27] Study on short-term prediction methods of traffic flow on expressway based on artificial neural network
    Wu, HY
    Cong, YL
    Jiang, GY
    Wang, HY
    SEVENTH IASTED INTERNATIONAL CONFERENCE ON SIGNAL AND IMAGE PROCESSING, 2005, : 161 - 165
  • [28] Prediction and control of short-term congestion in ATM networks using Artificial Intelligence techniques
    Corral, G
    Zaballos, A
    Camps, J
    Garrell, JM
    NETWORKING - ICN 2001, PART II, PROCEEDINGS, 2001, 2094 : 648 - 657
  • [29] Short-Term Traffic Prediction Using Long Short-Term Memory Neural Networks
    Abbas, Zainab
    Al-Shishtawy, Ahmad
    Girdzijauskas, Sarunas
    Vlassov, Vladimir
    2018 IEEE INTERNATIONAL CONGRESS ON BIG DATA (IEEE BIGDATA CONGRESS), 2018, : 57 - 65
  • [30] SHORT TERM TRAFFIC FLOW PREDICTION IN HETEROGENEOUS CONDITION USING ARTIFICIAL NEURAL NETWORK
    Kumar, Kranti
    Parida, Manoranjan
    Katiyar, Vinod Kumar
    TRANSPORT, 2015, 30 (04) : 397 - 405