分布式交通仿真中的离线路网划分

Xu Yan, Gary S. H. Tan
{"title":"分布式交通仿真中的离线路网划分","authors":"Xu Yan, Gary S. H. Tan","doi":"10.1109/PADS.2012.28","DOIUrl":null,"url":null,"abstract":"Distributed transportation simulation is an important technology for evaluating various Intelligent Transportation Systems (ITS) applications, before they are implemented in the real-world traffic system. Offline road network partitioning is the first step towards distributed transportation simulation. However, as the most popular offline road network partitioning solution, METIS cannot naturally formalize data distribution in ITS applications, and thus cannot guarantee to minimize data exchanges between partitions. In this paper, we propose to formalize offline road network partitioning as a hyper graph partitioning, which can naturally deal with data distribution in ITS applications. Then, we propose to solve the hyper graph partitioning using hMETIS, a graph partitioning algorithm borrowed from VLSI applications. Preliminary experiments show that even in the case where there is no ITS application, hyper graph-based offline road network partitioning can reduce data exchanges between partitions by around 10% on average. Currently, we are evaluating hyper graph-based offline road network partitioning on ITS applications.","PeriodicalId":299627,"journal":{"name":"2012 ACM/IEEE/SCS 26th Workshop on Principles of Advanced and Distributed Simulation","volume":"84 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Offline Road Network Partitioning in Distributed Transportation Simulation\",\"authors\":\"Xu Yan, Gary S. H. Tan\",\"doi\":\"10.1109/PADS.2012.28\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Distributed transportation simulation is an important technology for evaluating various Intelligent Transportation Systems (ITS) applications, before they are implemented in the real-world traffic system. Offline road network partitioning is the first step towards distributed transportation simulation. However, as the most popular offline road network partitioning solution, METIS cannot naturally formalize data distribution in ITS applications, and thus cannot guarantee to minimize data exchanges between partitions. In this paper, we propose to formalize offline road network partitioning as a hyper graph partitioning, which can naturally deal with data distribution in ITS applications. Then, we propose to solve the hyper graph partitioning using hMETIS, a graph partitioning algorithm borrowed from VLSI applications. Preliminary experiments show that even in the case where there is no ITS application, hyper graph-based offline road network partitioning can reduce data exchanges between partitions by around 10% on average. Currently, we are evaluating hyper graph-based offline road network partitioning on ITS applications.\",\"PeriodicalId\":299627,\"journal\":{\"name\":\"2012 ACM/IEEE/SCS 26th Workshop on Principles of Advanced and Distributed Simulation\",\"volume\":\"84 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-07-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 ACM/IEEE/SCS 26th Workshop on Principles of Advanced and Distributed Simulation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PADS.2012.28\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 ACM/IEEE/SCS 26th Workshop on Principles of Advanced and Distributed Simulation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PADS.2012.28","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

分布式交通仿真是在智能交通系统应用于实际交通系统之前对其进行评估的一项重要技术。离线路网划分是实现分布式交通仿真的第一步。然而,作为目前最流行的线下路网分区解决方案,METIS无法自然形式化ITS应用中的数据分布,因此无法保证分区之间的数据交换最小化。在本文中,我们提出将离线道路网络划分形式化为超图划分,可以自然地处理ITS应用中的数据分布问题。然后,我们提出使用hMETIS(一种借鉴VLSI应用的图划分算法)来解决超图划分问题。初步实验表明,即使在没有ITS应用的情况下,基于超图的离线道路网络分区也可以平均减少分区之间的数据交换10%左右。目前,我们正在评估基于超图的离线道路网络划分在ITS应用中的应用。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Offline Road Network Partitioning in Distributed Transportation Simulation
Distributed transportation simulation is an important technology for evaluating various Intelligent Transportation Systems (ITS) applications, before they are implemented in the real-world traffic system. Offline road network partitioning is the first step towards distributed transportation simulation. However, as the most popular offline road network partitioning solution, METIS cannot naturally formalize data distribution in ITS applications, and thus cannot guarantee to minimize data exchanges between partitions. In this paper, we propose to formalize offline road network partitioning as a hyper graph partitioning, which can naturally deal with data distribution in ITS applications. Then, we propose to solve the hyper graph partitioning using hMETIS, a graph partitioning algorithm borrowed from VLSI applications. Preliminary experiments show that even in the case where there is no ITS application, hyper graph-based offline road network partitioning can reduce data exchanges between partitions by around 10% on average. Currently, we are evaluating hyper graph-based offline road network partitioning on ITS applications.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信