反向学习的灰狼算法优化及其在交通流预测中的应用

doi:10.12263/DZXB.20200915

电子学报 ›› 2021, Vol. 49 ›› Issue (5): 879-886.DOI: 10.12263/DZXB.20200915

所属专题：面向自动驾驶和智慧交通协同的通信与控制

• 面向自动驾驶和智慧交通协同的通信与控制 • 上一篇下一篇

反向学习的灰狼算法优化及其在交通流预测中的应用

张兴辉^1,3, 樊秀梅¹, 阿喜达^1,4, 樊书嘉², 武文瑜¹

1. 西安理工大学自动化与信息工程学院, 陕西西安 710048;
2. 清华大学计算机科学与技术系, 北京 100084;
3. 安康学院电子与信息工程学院, 陕西安康 725000;
4. 包头师范学院信息科学与技术学院, 内蒙古包头 014030

收稿日期:2020-08-21 修回日期:2021-02-18 出版日期:2021-05-25
- 通讯作者:
- 樊秀梅
- 作者简介:
- 张兴辉 男,1982年4月生于辽宁省营口县.2009年获长春理工大学硕士学位,其后在安康学院从事教学工作,讲师.2018年至今在西安理工大学信息与控制系攻读博士学位.主要研究方向为车联网、智能交通控制. E-mail:1180311021@stu.xaut.edu.cn
- 基金资助:
- 国家自然科学基金 (No.61272509）; 陕西省"百人计划"、陕西省重点研发计划一般项目 (No.2017ZDCXL-GY-05-01）

Grey Wolf Optimization Based on Opposition Learning and Its Application in Traffic Flow Forecasting

ZHANG Xing-hui^1,3, FAN Xiu-mei¹, SHAN Axida^1,4, FAN Shu-jia², WU Wen-yu¹

1. Department of Automation and Information Engineering, Xi'an University of Technology, Xi'an, Shaanxi 710048, China;
2. Department of Computer Science and Technology, Tsinghua University, Beijing 100084, China;
3. College of Electronics and Information Engineering, Ankang University, Ankang, Shaanxi 725000, China;
4. School of Information Science and Technology, Baotou Teachers' College, Baotou, Inner Mongolia 014030, China

Received:2020-08-21 Revised:2021-02-18 Online:2021-05-25 Published:2021-05-25
- Corresponding author:
- FAN Xiu-mei
- Supported by:
- National Natural Science Foundation of China (No.61272509); 100 Talents Project of Shaanxi Province, General Program of Key Research and Development Project of Shanxi Province (No.2017ZDCXL-GY-05-01)

摘要/Abstract

摘要： 本文针对灰狼优化(Grey Wolf Optimizer,GWO)算法平衡全局探索和局部搜索能力的不足,提出了一种基于反向改进的灰狼算法(Opposition Learning Grey Wolf Optimizer,OLGWO),来优化预测模型的超参数,以提高其用于交通流预测的精度与鲁棒性.本算法在迭代过程中采用了反向学习策略,并引入了等级相关概念,主要通过计算普通狼与目标狼的Spearman相关系数,并根据其值来选择性地更新狼种群.实验先对12个标准测试函数对比了四种算法OLGWO、TGWO(Transformed Grey Wolf Optimizer)、GWO、PSO(Particle Swarm Optimization),得到了寻优均值和标准差,验证了OLGWO算法具有突出的性能优势;然后采用美国加州公路交通流数据,在不同缺失率下比较了四种算法优化的反向传播(Back Propagation,BP)网络模型,结果显示,OLGWO-BP模型预测精度比其它三种模型最高分别有1.95%、3.98%和11.07%的提升,同时表现出更好的稳定性.

关键词: 智能交通, 交通流预测, 灰狼优化(GWO), BP神经网络, 反向学习(OL)

Abstract: Focusing on the weakness of the balance capability between global exploration and local search in the classical GWO algorithm, a novel grey wolf algorithm based on opposition learning (OLGWO), which can evolve the hyper-parameters of forecasting model, is proposed to improve the accuracy and enhance the robustness of traffic flow forecasting models. This algorithm is designed to take advantage of opposition learning strategy with the iterative process, and exploits the concept of rank correlation that can describe the Spearman correlation coefficients between the target wolf and the common wolves, and then selectively updates the each wolf of the whole population according to their values. Firstly, the performance comparison of four algorithms (OLGWO, TGWO, GWO, PSO), based on 12 benchmark functions, is conducted in terms of the two metrics, namely the optimization means and standard deviations. The results verify the outstanding performance of the proposed algorithm. Furthermore, based on the California highway traffic flow data, the four models optimized by the concerned algorithms are compared under different loss rates. The results show that the prediction accuracy of OLGWO-BP is higher than that of the others by 1.95%, 3.98% and 11.07%, respectively, and the stability is better.

Key words: intelligent transportation, traffic flow prediction, grey wolf optimizer (GWO), BP neural networks, opposition learning

中图分类号:

U491.1

张兴辉, 樊秀梅, 阿喜达, 等. 反向学习的灰狼算法优化及其在交通流预测中的应用[J]. 电子学报, 2021, 49(5): 879-886.

ZHANG Xing-hui, FAN Xiu-mei, SHAN Axida, et al. Grey Wolf Optimization Based on Opposition Learning and Its Application in Traffic Flow Forecasting[J]. Acta Electronica Sinica, 2021, 49(5): 879-886.

参考文献

[1] 代亮,梅洋,钱超,等.基于深度学习的短时交通量预测研究综述[J].计算机科学,2019,46(3):39-47. Dai L,Mei Y,Qian C,et al.Survey on short-term traffic flow forecasting based on deep learning[J].Computer Science,2019,46(3):39-47.(in Chinese).
[2] Moretti F,Pizzuti S,Panzieri S,et al.Urban traffic flow forecasting through statistical and neural network bagging ensemble hybrid modeling[J].Neurocomputing,2015,167(C):3-7.
[3] Zhao Z,Chen W H,Wu X M,et al.LSTM network:a deep learning approach for short-term traffic forecast[J].IET Intelligent Transport Systems,2017,11(2):68-75.
[4] 蔡亮,周泓岑,白恒,等.基于多层BiLSTM和改进粒子群算法的应用负载预测方法[J].浙江大学学报(工学版),2020,54(12):2414-2422. Cai L,Zhou H C,Bai H,et al.Application load forecasting method based on multi-layer bidirectional LSTM and improved PSO algorithm[J].Journal of Zhejiang University (Engineering Science),2020,54(12):2414-2422.(in Chinese).
[5] Mirjalili S,Mirjalili S M,Lewis A.Grey wolf optimizer[J].Advances in Engineering Software,2014,69(3):46-61.
[6] 傅蔚阳,刘以安,薛松.基于灰狼算法与小波神经网络的目标威胁评估[J].浙江大学学报(工学版),2018,52(4):680-686. FU W Y,LIU Y A,XUE S.Target threat assessment using grey wolf optimization and wavelet neural network[J].Journal of Zhejiang University (Engineering Science),2018,52(4):680-686.(in Chinese).
[7] 张文胜,郝孜奇,朱冀军,等.基于改进灰狼算法优化BP神经网络的短时交通流预测模型[J].交通运输系统工程与信息,2020,20(2):196-203. Zhang W S,Hao Z Q,Zhu J J,et al.BP neural network model for short-time traffic flow forecasting based on transformed grey wolf optimizer algorithm[J].Journal of Transportation Systems Engineering and Information Technology,2020,20(2):196-203.(in Chinese).
[8] Mee Song H,Sulaiman M H,Mohamed M R.An application of grey wolf optimizer for solving combined economic emission dispatch problems[J].International Review on Modelling and Simulations (IREMOS),2014,7(5):838.
[9] Heidari A A,Pahlavani P.An efficient modified grey wolf optimizer with Lévy flight for optimization tasks[J].Applied Soft Computing,2017,(60):115-134.
[10] Tizhoosh H R.Opposition-based learning:a new scheme for machine intelligence[A].International Conference on Computational Intelligence for Modelling,Control and Automation,and International Confere nce on Intelligent Agents,Web Technologies and Internet Commerce[C].Vienna,Austria: IEEE Computer Society,2005.695-701.
[11] 樊嵘,孟大志,徐大舜.统计相关性分析方法研究进展[J].数学建模及其应用,2014,3(1):1-12. Fan R,Meng D Z,Xu D S.Survey of research process on statistical correlation analysis[J].Mathematical Modeling and Its Applications,2014,3(1):1-12.(in Chinese).
[12] Rashedi E,Nezamabadi-pour,H Saryazdi S.GSA:A gravitational search algorithm[J].Information Sciences,2009,179(13):2232-2248.
[13] 沈焱萍,郑康锋,伍淳华,等.智能启发算法在机器学习中的应用研究综述[J].通信学报,2019,40(12):124-137. Shen Y P,Zheng K F,Wu C H,et al.Survey of research on application of heuristic algorithm in machine learning[J].Journal on Communications,2019,40(12):124-137.(in Chinese).
[14] Ali M H,Al Mohammed B A D,Ismail A,et al.A new intrusion detection system based on fast learning network and particle swarm optimization[J].IEEE Access,2018,6:20255-20261.
[15] Wu Q,He F F,Fan X M.The intelligent control system of traffic light based on fog computing[J].Chinese Journal of Electronics,2018,27(6):1265-1270.

反向学习的灰狼算法优化及其在交通流预测中的应用

Grey Wolf Optimization Based on Opposition Learning and Its Application in Traffic Flow Forecasting

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 12

编辑推荐

Metrics

[1]	李长乐, 王硕, 岳文伟, 毛国强, 何祥健. 面向空地一体化交通的虚拟车道：发展阶段与关键技术[J]. 电子学报, 2022, 50(5): 1255-1265.
[2]	刘冰艺, 秦静, 熊盛武, 邓东晓, 吴黎兵, 程传奇. 一种结合雾计算的车辆通信网络碰撞避免TDMA MAC协议[J]. 电子学报, 2021, 49(5): 843-850.
[3]	张萌. 基于BP神经网络的高精度本地多基准时钟合成算法研究[J]. 电子学报, 2019, 47(8): 1618-1625.
[4]	徐兴安, 吴雄斌, 陈骁锋, 沈志奔. 一种基于S变换的高频地波雷达瞬态干扰抑制方法[J]. 电子学报, 2014, 42(3): 602-606.
[5]	张会清, 石晓伟, 邓贵华, 高学金, 任明荣. 基于BP神经网络和泰勒级数的室内定位算法研究[J]. 电子学报, 2012, 40(9): 1876-1879.
[6]	杨金辉, 郜克存, 戴瑜兴, 洪天宇. 正弦逆变波形的神经网络内膜控制算法[J]. 电子学报, 2012, 40(7): 1345-1350.
[7]	曹政才;韩丁富;乔非. 基于新型路网模型的路径寻优方法研究[J]. 电子学报, 2012, 40(4): 756-761.
[8]	曹政才, 韩丁富, 王永吉. 面向城市交通网络的一种新型动态路径寻优方法[J]. 电子学报, 2012, 40(10): 2062-2067.
[9]	鲁智勇;张权;张希;唐朝京. 等效分组级联BP网络模型及其应用[J]. 电子学报, 2010, 38(6): 1349-1354.
[10]	张清河;邓小炼. BCGs-FFT结合BP神经网络反演金属介质复合柱体目标参数[J]. 电子学报, 2010, 38(5): 1217-1220.
[11]	曹政才;温金涛;吴启迪. 未知环境下一种移动机器人实时最优路径规划方法研究[J]. 电子学报, 2010, 38(11): 2535-2539.
[12]	宋锐, 张静, 夏胜平, 郁文贤. 一种基于BP神经网络群的自适应分类方法及其应用[J]. 电子学报, 2001, 29(S1): 1950-1953.