基于仿真的出发地矩阵约简:以赫尔辛基城区为例

Klavdiya Olegovna Bochenina, Anton Taleiko, L. Ruotsalainen
{"title":"基于仿真的出发地矩阵约简:以赫尔辛基城区为例","authors":"Klavdiya Olegovna Bochenina, Anton Taleiko, L. Ruotsalainen","doi":"10.52825/scp.v4i.197","DOIUrl":null,"url":null,"abstract":"Estimation of a travel demand in a form of origin-destination (OD) matrix is a necessary step in a city-scale simulation of the vehicular mobility. However, an input data on travel demand in OD matrix may be available only for a specific set of traffic assignment zones (TAZs). Thus, there appears a need to infer OD matrix for a region of interest (we call it ‘core’ area) given OD matrix for a larger region (we call it ‘extended’ area), which is challenging as trip counts are only given for zones of the initial region. To perform a reduction, we explicitly simulate vehicle trajectories for the extended area and supplement trip values in ‘core’ TAZs based on the recorded trajectories on the border of core and extended areas. To keep validation results consistent between extended and core simulations, we introduce edge-based origin-destination assignment algorithm which preserves properties of traffic flows on the border of the core area but also keeps randomness in instantiating simulation for the core area. \nThe experimental study is performed for Helsinki city area using Simulation of Urban MObility (SUMO) tool. The validation was performed using DigiTraffic data from traffic counting stations within the city area for workdays of autumn 2018. Validation results show that the reduced OD matrix combined with edge-based OD assignment algorithm keeps the simulated traffic counts in good agreement with results from the extended area simulation with average MAPE between observed and simulated traffic counts equal to 34%. Simulation time after reduction is equal to 20 minutes compared to 6 hours for the extended OD.","PeriodicalId":439794,"journal":{"name":"SUMO Conference Proceedings","volume":"20 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Simulation-Based Origin-Destination Matrix Reduction: A Case Study of Helsinki City Area\",\"authors\":\"Klavdiya Olegovna Bochenina, Anton Taleiko, L. Ruotsalainen\",\"doi\":\"10.52825/scp.v4i.197\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Estimation of a travel demand in a form of origin-destination (OD) matrix is a necessary step in a city-scale simulation of the vehicular mobility. However, an input data on travel demand in OD matrix may be available only for a specific set of traffic assignment zones (TAZs). Thus, there appears a need to infer OD matrix for a region of interest (we call it ‘core’ area) given OD matrix for a larger region (we call it ‘extended’ area), which is challenging as trip counts are only given for zones of the initial region. To perform a reduction, we explicitly simulate vehicle trajectories for the extended area and supplement trip values in ‘core’ TAZs based on the recorded trajectories on the border of core and extended areas. To keep validation results consistent between extended and core simulations, we introduce edge-based origin-destination assignment algorithm which preserves properties of traffic flows on the border of the core area but also keeps randomness in instantiating simulation for the core area. \\nThe experimental study is performed for Helsinki city area using Simulation of Urban MObility (SUMO) tool. The validation was performed using DigiTraffic data from traffic counting stations within the city area for workdays of autumn 2018. Validation results show that the reduced OD matrix combined with edge-based OD assignment algorithm keeps the simulated traffic counts in good agreement with results from the extended area simulation with average MAPE between observed and simulated traffic counts equal to 34%. Simulation time after reduction is equal to 20 minutes compared to 6 hours for the extended OD.\",\"PeriodicalId\":439794,\"journal\":{\"name\":\"SUMO Conference Proceedings\",\"volume\":\"20 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-06-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"SUMO Conference Proceedings\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.52825/scp.v4i.197\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"SUMO Conference Proceedings","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.52825/scp.v4i.197","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

以起点-目的地矩阵的形式估计出行需求是城市尺度车辆移动仿真的必要步骤。然而,在OD矩阵中输入的出行需求数据可能只适用于一组特定的交通分配区。因此,在给定更大区域(我们称之为“扩展”区域)的OD矩阵的情况下,似乎需要推断出感兴趣区域(我们称之为“核心”区域)的OD矩阵,这是具有挑战性的,因为行程计数只给出了初始区域的区域。为了进行减少,我们明确地模拟了扩展区域的车辆轨迹,并根据核心和扩展区域边界上记录的轨迹补充了“核心”taz的行程值。为了保持扩展仿真和核心仿真验证结果的一致性,我们引入了基于边缘的起点-目的地分配算法,该算法既保留了核心区边界交通流的特性,又保持了核心区实例化仿真的随机性。利用城市交通模拟(SUMO)工具对赫尔辛基城区进行了实验研究。使用2018年秋季工作日城市区域内交通计数站的数字交通数据进行验证。验证结果表明,简化OD矩阵与基于边缘的OD分配算法相结合,使模拟流量与扩展区域模拟结果吻合较好,实测流量与模拟流量的平均MAPE为34%。减小后的模拟时间等于20分钟,而延长OD后的模拟时间为6小时。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Simulation-Based Origin-Destination Matrix Reduction: A Case Study of Helsinki City Area
Estimation of a travel demand in a form of origin-destination (OD) matrix is a necessary step in a city-scale simulation of the vehicular mobility. However, an input data on travel demand in OD matrix may be available only for a specific set of traffic assignment zones (TAZs). Thus, there appears a need to infer OD matrix for a region of interest (we call it ‘core’ area) given OD matrix for a larger region (we call it ‘extended’ area), which is challenging as trip counts are only given for zones of the initial region. To perform a reduction, we explicitly simulate vehicle trajectories for the extended area and supplement trip values in ‘core’ TAZs based on the recorded trajectories on the border of core and extended areas. To keep validation results consistent between extended and core simulations, we introduce edge-based origin-destination assignment algorithm which preserves properties of traffic flows on the border of the core area but also keeps randomness in instantiating simulation for the core area. The experimental study is performed for Helsinki city area using Simulation of Urban MObility (SUMO) tool. The validation was performed using DigiTraffic data from traffic counting stations within the city area for workdays of autumn 2018. Validation results show that the reduced OD matrix combined with edge-based OD assignment algorithm keeps the simulated traffic counts in good agreement with results from the extended area simulation with average MAPE between observed and simulated traffic counts equal to 34%. Simulation time after reduction is equal to 20 minutes compared to 6 hours for the extended OD.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信