Modelling and optimisation on bus transport system with graph theory and complex network

Abstract

In order to provide effective managements of urban bus transport network and serve better for citizen travels, we modelled and simulated the Tai'an city bus lines by space P way, space L way and bus line way with complex network and graph theory. By computing adjacency matrix and complex network topology characters in bus line model, we concluded that the Tai'an city network had small-world character with short average path length and high clustering coefficient. The same results were achieved by complex network characters statistics in space P way and space L way after getting rid of noise. Theoretical analysis and experimental simulation imply that it is feasible and effective for bus line management and citizen travel by modelling and optimisation on bus transport network with complex network characters statistics and analysis.

Analysis of Public Bus Transportation of a Brazilian City Based on the Theory of Complex Networks Using the P-Space

“…Since CPTS has also high modularity, it is possible to consider it as a scale-free network (hub-based network) with small-world characteristics and hierarchical structures built up around its hubs. These statistical results are similar to features observed in other transport networks (underground, railway, or airline systems) [9,[27][28][29][30][31] where such networks tend to share small-world characteristics. It is possible to speculate that bus transportation system of other cities with comparable population and transportation infrastructure can be modeled as complex networks with mixing characteristics.…”

“…The definition of the complex network elements of a public transport network and how this network shall be modeled requires a lot of attention to establish a simple model where the extraction of results can be performed in a limited time [27]. The most widely used topologies are the P-Space and L-Space [8-10, 19, 27-30]; sometimes P-Space was called spaceof-changes [5,6].…”