An optimal network for passenger traffic

Abstract

The optimal solution of an inter-city passenger transport network has been studied using Zipf's law for the city populations and the Gravity law describing the fluxes of inter-city passenger traffic. Assuming a fixed value for the cost of transport per person per kilometer we observe that while the total traffic cost decreases, the total wiring cost increases with the density of links. As a result the total cost to maintain the traffic distribution is optimal at a certain link density which vanishes on increasing the network size. At a finite link density the network is scale-free. Using this model the air-route network of India has been generated and an one-to-one comparison of the nodal degree values with the real network has been made.

5 pages, 4 figures

References in corpus (11)

• Statistical mechanics of complex networks
• The structure and function of complex networks
• Error and attack tolerance of complex networks
• The diameter of the world wide web
• The architecture of complex weighted networks
• Evolution of networks
• Small-world properties of the Indian Railway network
• The spatial structure of networks
• Analysis of the Airport Network of India as a complex weighted network
• Optimal design of spatial distribution networks
• Weighted Scale-free Networks in Euclidean Space Using Local Selection Rule

Cited by in corpus (4)

• Spatial Networks
• Geographical networks stochastically constructed by a self-similar tiling according to population
• Scaling exponents and phase separation in a nonlinear network model inspired by the gravitational accretion
• Estimation of an Origin/Destination matrix: Application to a ferry transport data