This paper presents a multi-way network partitioning methodology for distributed traffic management applications. The methodology can be used to partition a typical urban transportation network such that: (a) the inter-flow among the resulting subnetworks is minimised; (b) the subnetworks are balanced in terms of their sizes/flow activities; and (c) each subnetwork is connected. Two heuristics are presented. The first adopts a recursive iterative procedure to determine the network's sparsest cuts that maintain the balance and connectivity requirements. The second heuristic adopts a greedy network coarsening technique to determine the most flow-independent subnetworks. The solution quality of these two heuristics is evaluated using hypothetical and real networks with different configurations. The results show that the heuristics can obtain near-optimal solution in significantly shorter execution times.
A network partitioning methodology for distributed traffic management applications
Transportmetrica A: Transport Science ; 10 , 6 ; 518-532
2014-07-03
15 pages
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
Taylor & Francis Verlag | 2016
|A Methodology for Benefits Assessments of Distributed Air/Ground Traffic Management
British Library Conference Proceedings | 2002
|A distributed intelligence methodology for railway traffic control
Tema Archiv | 1990
|