Back to Search Start Over

A low complexity method for the optimization of network path length in spatially embedded networks.

Authors :
Chen, Guang
Yang, Xu-Hua
Xu, Xin-Li
Ming, Yong
Chen, Sheng-Yong
Wang, Wan-Liang
Source :
Journal of Physics A: Mathematical & Theoretical. 3/14/2014, Vol. 47 Issue 10, p105101-105112. 12p.
Publication Year :
2014

Abstract

The average path length of a network is an important index reflecting the network transmission efficiency. In this paper, we propose a new method of decreasing the average path length by adding edges. A new indicator is presented, incorporating traffic flow demand, to assess the decrease in the average path length when a new edge is added during the optimization process. With the help of the indicator, edges are selected and added into the network one by one. The new method has a relatively small time computational complexity in comparison with some traditional methods. In numerical simulations, the new method is applied to some synthetic spatially embedded networks. The result shows that the method can perform competitively in decreasing the average path length. Then, as an example of an application of this new method, it is applied to the road network of Hangzhou, China. [ABSTRACT FROM AUTHOR]

Details

Language :
English
ISSN :
17518113
Volume :
47
Issue :
10
Database :
Academic Search Index
Journal :
Journal of Physics A: Mathematical & Theoretical
Publication Type :
Academic Journal
Accession number :
94672772
Full Text :
https://doi.org/10.1088/1751-8113/47/10/105101