Urban traffic signal control network automatic partitioning using laplacian eigenvectors

Many existing traffic signal control systems are of a hierarchical structure employing the concept of subsystems or sub-zone signal control. Therefore, network partitioning becomes an important task of such an urban traffic signal control system. However, urban traffic signal control network partitioning is a multi-objective and multi-constraint problem, which has been shown to be a NP-hard problem. This paper presents a partitioning method using the spectral methodology according to the correlation degree of each link. Two measures are adopted in this problem: modularity and average cut weight. The developed method has been tested on two networks, including a computergenerated network and real-world road network. The results show that the spectral bisection is a reasonable network partitioning method to support urban traffic signal control.

[1]  Adrian Barbu,et al.  Graph partition by Swendsen-Wang cuts , 2003, Proceedings Ninth IEEE International Conference on Computer Vision.

[2]  R L Gordon,et al.  Traffic Control Systems Handbook , 1996 .

[3]  M. Fiedler.  Eigenvectors of acyclic matrices , 1975 .

[4]  Edmond Chin-Ping Chang,et al.  How to decide the interconnection of isolated traffic signals , 1985, WSC '85.

[5]  Alex Pothen,et al.  PARTITIONING SPARSE MATRICES WITH EIGENVECTORS OF GRAPHS* , 1990 .

[6]  John F. Abel,et al.  Recursive spectral algorithms for automatic domain partitioning in parallel finite element analysis , 1995 .

[7]  B. Parlett.  The Symmetric Eigenvalue Problem , 1981 .

[8]  M. Fiedler.  A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory , 1975 .

[9]  Wang Xiaofan,et al.  An Overview of Algorithms for Analyzing Community Structure in Complex Networks , 2005 .

[10]  H N Yagoda,et al.  SUBDIVISION OF SIGNAL SYSTEMS INTO CONTROL AREAS , 1973 .

[11]  M. A. Muñoz,et al.  Journal of Statistical Mechanics: An IOP and SISSA journal Theory and Experiment Detecting network communities: a new systematic and efficient algorithm , 2004 .

[12]  George Karypis,et al.  Multilevel k-way Partitioning Scheme for Irregular Graphs , 1998, J. Parallel Distributed Comput..

[13]  Horst D. Simon,et al.  Partitioning of unstructured problems for parallel processing , 1991 .

[14]  M E J Newman,et al.  Finding and evaluating community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[15]  Horst D. Simon,et al.  Fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems , 1994, Concurr. Pract. Exp..

[16]  M. Fiedler.  Algebraic connectivity of graphs , 1973 .

[17]  M E J Newman,et al.  Fast algorithm for detecting community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.