Prediction of Train Arrival Delay Using Hybrid ELM-PSO Approach
In this study, a hybrid method combining extreme learning machine (ELM) and particle swarm optimization (PSO) is proposed to forecast train arrival delays that can be used for later delay management and timetable optimization. First, nine characteristics (e.g., buffer time, the train number, and sta...
Main Authors: | , , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi-Wiley
2021-01-01
|
Series: | Journal of Advanced Transportation |
Online Access: | http://dx.doi.org/10.1155/2021/7763126 |
id |
doaj-30b047726acd4c4cb52d98c6cf6820b3 |
---|---|
record_format |
Article |
spelling |
doaj-30b047726acd4c4cb52d98c6cf6820b32021-06-28T01:52:04ZengHindawi-WileyJournal of Advanced Transportation2042-31952021-01-01202110.1155/2021/7763126Prediction of Train Arrival Delay Using Hybrid ELM-PSO ApproachXu Bao0Yanqiu Li1Jianmin Li2Rui Shi3Xin Ding4College of Traffic EngineeringSchool of Traffic and TransportationSchool of Traffic and TransportationSchool of Traffic and TransportationSchool of Traffic and TransportationIn this study, a hybrid method combining extreme learning machine (ELM) and particle swarm optimization (PSO) is proposed to forecast train arrival delays that can be used for later delay management and timetable optimization. First, nine characteristics (e.g., buffer time, the train number, and station code) associated with train arrival delays are chosen and analyzed using extra trees classifier. Next, an ELM with one hidden layer is developed to predict train arrival delays by considering these characteristics mentioned before as input features. Furthermore, the PSO algorithm is chosen to optimize the hyperparameter of the ELM compared to Bayesian optimization and genetic algorithm solving the arduousness problem of manual regulating. Finally, a case is studied to confirm the advantage of the proposed model. Contrasted to four baseline models (k-nearest neighbor, categorical boosting, Lasso, and gradient boosting decision tree) across different metrics, the proposed model is demonstrated to be proficient and achieve the highest prediction accuracy. In addition, through a detailed analysis of the prediction error, it is found that our model possesses good robustness and correctness.http://dx.doi.org/10.1155/2021/7763126 |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Xu Bao Yanqiu Li Jianmin Li Rui Shi Xin Ding |
spellingShingle |
Xu Bao Yanqiu Li Jianmin Li Rui Shi Xin Ding Prediction of Train Arrival Delay Using Hybrid ELM-PSO Approach Journal of Advanced Transportation |
author_facet |
Xu Bao Yanqiu Li Jianmin Li Rui Shi Xin Ding |
author_sort |
Xu Bao |
title |
Prediction of Train Arrival Delay Using Hybrid ELM-PSO Approach |
title_short |
Prediction of Train Arrival Delay Using Hybrid ELM-PSO Approach |
title_full |
Prediction of Train Arrival Delay Using Hybrid ELM-PSO Approach |
title_fullStr |
Prediction of Train Arrival Delay Using Hybrid ELM-PSO Approach |
title_full_unstemmed |
Prediction of Train Arrival Delay Using Hybrid ELM-PSO Approach |
title_sort |
prediction of train arrival delay using hybrid elm-pso approach |
publisher |
Hindawi-Wiley |
series |
Journal of Advanced Transportation |
issn |
2042-3195 |
publishDate |
2021-01-01 |
description |
In this study, a hybrid method combining extreme learning machine (ELM) and particle swarm optimization (PSO) is proposed to forecast train arrival delays that can be used for later delay management and timetable optimization. First, nine characteristics (e.g., buffer time, the train number, and station code) associated with train arrival delays are chosen and analyzed using extra trees classifier. Next, an ELM with one hidden layer is developed to predict train arrival delays by considering these characteristics mentioned before as input features. Furthermore, the PSO algorithm is chosen to optimize the hyperparameter of the ELM compared to Bayesian optimization and genetic algorithm solving the arduousness problem of manual regulating. Finally, a case is studied to confirm the advantage of the proposed model. Contrasted to four baseline models (k-nearest neighbor, categorical boosting, Lasso, and gradient boosting decision tree) across different metrics, the proposed model is demonstrated to be proficient and achieve the highest prediction accuracy. In addition, through a detailed analysis of the prediction error, it is found that our model possesses good robustness and correctness. |
url |
http://dx.doi.org/10.1155/2021/7763126 |
work_keys_str_mv |
AT xubao predictionoftrainarrivaldelayusinghybridelmpsoapproach AT yanqiuli predictionoftrainarrivaldelayusinghybridelmpsoapproach AT jianminli predictionoftrainarrivaldelayusinghybridelmpsoapproach AT ruishi predictionoftrainarrivaldelayusinghybridelmpsoapproach AT xinding predictionoftrainarrivaldelayusinghybridelmpsoapproach |
_version_ |
1721357055929876480 |