Support vector machines and k-means to build implementation areas of bundling hubs

IF 0.7 Q4 TRANSPORTATION
Jihane El Ouadi
{"title":"Support vector machines and k-means to build implementation areas of bundling hubs","authors":"Jihane El Ouadi","doi":"10.48295/et.2021.83.5","DOIUrl":null,"url":null,"abstract":"City transportation has three basic components that create the essential environment for its functioning and the social welfare namely infrastructure, operational assets, and management policies. The key focus of this article is on understanding long-term distribution of transport demand in order to build bundling networks. To achieve this aim, we provide a hybrid machine-learning approach using a combination of several clustering and forecasting algorithms that are considered efficient given the key performance indicators obtained. This approach involves combining two types of algorithms: clustering and prediction algorithms. Based on simulated benchmarks, results indicated that the clustering phase is still appropriate using the k-means algorithm. To improve the k-means results, we measured 30 validation indices to estimate the number of clusters. In so doing, not only does it want to validate the clusters but also to identify the optimal k. To evaluate forecast accuracy in the demand prediction phase, we used the standard key performance indicators, namely MSE, RMSE, MAPE and R². The SVM algorithm has been judged as the most efficient prediction algorithm based on average values of the obtained metrics.","PeriodicalId":45410,"journal":{"name":"European Transport-Trasporti Europei","volume":null,"pages":null},"PeriodicalIF":0.7000,"publicationDate":"2021-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"European Transport-Trasporti Europei","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.48295/et.2021.83.5","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"TRANSPORTATION","Score":null,"Total":0}
引用次数: 1

Abstract

City transportation has three basic components that create the essential environment for its functioning and the social welfare namely infrastructure, operational assets, and management policies. The key focus of this article is on understanding long-term distribution of transport demand in order to build bundling networks. To achieve this aim, we provide a hybrid machine-learning approach using a combination of several clustering and forecasting algorithms that are considered efficient given the key performance indicators obtained. This approach involves combining two types of algorithms: clustering and prediction algorithms. Based on simulated benchmarks, results indicated that the clustering phase is still appropriate using the k-means algorithm. To improve the k-means results, we measured 30 validation indices to estimate the number of clusters. In so doing, not only does it want to validate the clusters but also to identify the optimal k. To evaluate forecast accuracy in the demand prediction phase, we used the standard key performance indicators, namely MSE, RMSE, MAPE and R². The SVM algorithm has been judged as the most efficient prediction algorithm based on average values of the obtained metrics.
支持向量机和k-means构建捆绑枢纽的实施区域
城市交通有三个基本组成部分,即基础设施、运营资产和管理政策,它们为城市交通的运行和社会福利创造了必要的环境。本文的重点是了解运输需求的长期分布,以建立捆绑网络。为了实现这一目标,我们提供了一种混合机器学习方法,使用几种聚类和预测算法的组合,在获得关键性能指标的情况下,这些算法被认为是有效的。这种方法结合了两种算法:聚类算法和预测算法。基于模拟基准测试,结果表明使用k-means算法聚类阶段仍然是合适的。为了改进k-means结果,我们测量了30个验证指标来估计聚类的数量。这样做,不仅要验证集群,而且要确定最优k。为了评估需求预测阶段的预测准确性,我们使用了标准的关键绩效指标,即MSE, RMSE, MAPE和R²。基于得到的指标的平均值,SVM算法被认为是最有效的预测算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
2.30
自引率
0.00%
发文量
19
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信