检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:熊浩 张丽[1] 郝椿淋 XIONG Hao;ZHANG Li;HAO Chunlin(Air Transportation College,Shanghai University of Engineering Science,Shanghai 201600,China)
机构地区:[1]上海工程技术大学航空运输学院,上海201600
出 处:《物流科技》2024年第19期97-103,共7页Logistics Sci Tech
摘 要:为了提高短时交通流预测的准确性,鉴于短时交通流非平稳、难预测的特征,提出了基于完全自适应噪声集合经验模态分解(CEEMDAN)短时交通流组合预测方法。利用CEEMDAN将原始短时交通流信号进行分解得多个复杂度、频率不同的时间序列分量,利用排列熵算法(PE算法)计算各分量的复杂度;然后根据复杂度和随机性的不同分为高频和低频,分别使用ATT-TCN-BIGRU模型和ARIMA模型对高频分量和低频分量进行预测,最后叠加高频和低频的每个分量预测结果作为最终短时交通流预测值。仿真分析结果表明:与ARIMA模型、TCN模型、BIGRU模型、ATT-TCN-BIGRU模型相比,此模型的平均绝对误差及平均绝对百分比误差为最小,预测精度更高。In order to improve the accuracy of short-term traffic flow prediction,a short-term traffic flow combination prediction method based on Complementary Ensemble Empirical Mode Decomposition with Adaptive Noise(CEEMDAN)is proposed in view of the non-stationary and unpredictable characteristics of short-term traffic flow.CEEMDAN is used to decompose the original short-time traffic flow signal into multiple time series components with different complexity and frequency,and the complexity of each component is calculated by permutation entropy algorithm(PE algorithm).Then,according to the complexity and randomness,it is divided into high frequency and low frequency,and the ATT-TCN-BIGRU model and ARIMA model are used to predict the high frequency component and low frequency component,and finally the prediction results of each component of high frequency and low frequency are superimposed as the final short-term traffic flow prediction value.The simulation results show that compared with the ARIMA model,TCN model,BIGRU model and ATT-TCN-BIGRU model,the average absolute error and average absolute percentage error of this model are the smallest,and the prediction accuracy is higher.
关 键 词:短时交通流预测 完全自适应噪声集合经验模态分解 排列熵 组合预测
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.49