hMETIS-Based Offline Road Network Partitioning
Distributed transportation simulation is an important technology for evaluating large-scale traffic applications and control policies, before they are implemented in real-world traffic systems. Offline road network partitioning is the first step towards distributed transportation simulation. Currently, road network portioning algorithms, like METIS, are designed to reduce the execution time. However, a slower execution time is acceptable for offline road network partitioning, if it leads to more efficient road network partitions. This paper introduces hMETIS-based offline road network partitioning. One experiment based on Singapore expressways shows that compared with the famous METIS-based offline road network partitioning, hMETIS-based offline road network partitioning reduces the number of vehicles crossing partitions by 9.8% on average, with a similar load imbalance and an acceptable execution time. For distributed traffic simulations, where there are large amount of data exchanged between partitions, hMETIS-based offline road network partitioning is one candidate solution to reduce the simulation time and increase the scalability.
Keywordsdistributed transportation simulation offline road network partitioning hMETIS
Unable to display preview. Download preview PDF.
- 1.Charypar, D.: Efficient algorithms for the microsimulation of travel behavior in very large scenarios. Ph.D thesis, ETH Zurich (2008)Google Scholar
- 2.Karypis, G., Aggarwal, R., Kumar, V., Shekhar, S.: Multilevel hypergraph partitioning: applications in VLSI domain. IEEE Transactions on VLSI Systems, 69–79 (1999)Google Scholar
- 3.Karypis, G., Kumar, V.: Multilevel k-way hypergraph partitioning. VLSI Design, 1–16 (2000)Google Scholar
- 4.Karypis, G., Kumar, V.: A fast and highly quality multilevel scheme for partitioning irregular graphs. SIAM Journal on Scientific Computing, 359–392 (1999)Google Scholar
- 5.Nagel, K., Rickert, M.: Parallel implementation of the TRANSIMS micro-simulation. Parallel Computing, 1611–1639 (2001)Google Scholar
- 6.SMART, Future Urban Mobility (2012), http://smart.mit.edu/research/future-urban-mobility/future-urban-mobility.html
- 7.Voloshin, V.I.: Introduction to graph and hypergraph theory, 2nd edn., pp. 135–160. Nova Science Publishers (2009)Google Scholar
- 8.Yang, W.: Scalability of dynamic traffic assignment. Ph.D thesis, Massachusetts Institute of Technology (2009)Google Scholar
- 9.Cetin, N.: Large scale parallel graph-based simulations. PhD thesis, ETH Zurich (2005)Google Scholar
- 10.Xu, Y., Tan, G.: Offline Road Network Partitioning in Distributed Transportation Simulation. Short paper. In: Proceedings of the 26th Workshop on Principles of Advanced and Distributed Simulation (July 2012)Google Scholar