Please use this identifier to cite or link to this item:
|Title:||Offline road network partitioning in distributed transportation simulation||Authors:||Yan, X.
|Issue Date:||2012||Citation:||Yan, X., Tan, G. (2012). Offline road network partitioning in distributed transportation simulation. Proceedings - 2012 ACM/IEEE/SCS 26th Workshop on Principles of Advanced and Distributed Simulation, PADS 2012 : 90-92. ScholarBank@NUS Repository. https://doi.org/10.1109/PADS.2012.28||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. © 2012 IEEE.||Source Title:||Proceedings - 2012 ACM/IEEE/SCS 26th Workshop on Principles of Advanced and Distributed Simulation, PADS 2012||URI:||http://scholarbank.nus.edu.sg/handle/10635/39995||ISBN:||9780769547145||DOI:||10.1109/PADS.2012.28|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jan 22, 2020
checked on Dec 30, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.