The Modeling For Co-opetition Relationships In Bus Network And Analysis Complex Characteristics Based On Station Pairs

The competition and cooperation is the common attributive relationship on bus network, however, there is still lacking mature theory to measure this relationships. Besides, the existing research insist that the co-opetition relationships only exist between intersecting routes, but in fact, it is likely to be fellow of co-opetition even if there are two disjoint routes. In order to fully excavate the complex co-opetition relationships in bus network, based on complex network theory and method, starting from the basic relationship between station pairs, we construct the bus network co-opetition model, which can measure the co-opetition relationship between all station pairs and routes pairs, and study the its related complex characteristics and bus network optimization. The main research contents and achievements include the following three parts:Considering the spatial characteristic of the station, and joining the pedestrian network, a new bus network model is constructed. As a case study of Harbin’s bus network, we analyzes degree distribution, path length, clustering coefficient and betweenness and other complex features in the new bus network. Results show that Harbin’s bus network has many index, Gaussian and power-law rule, and it is a typical small world network.Based on K shortest path algorithm, we designed the multipath space transfer algorithm, co-opetition of bus network model based on station pairs is proposed. The bus network of Harbin has carried on the instance analysis. The results show that the cooperative relationship is dominant in Harbin’s bus network. Cooperation strength distribution is a kind of serious skewness distribution, and the rich club phenomenon of cooperation intensity in bus network in is very obvious. Competition and cooperation coefficient between route pairs show exponential and gamma distribution respectively. There is no obvious correlation between the diversity of competition and competition strength, but it has obvious law of power law between cooperation diversity and cooperation strength.To explore station group characteristics in multi-modal bus network, we put forward the concept of station space clique, and design the clique partition algorithm with least amount of cliques to cover the entire network. Then we establish co-opetition model of station space clique pairs in multi-modal bus network, and explore the different patterns of co-opetition relationships between the subnet. Finally considering the co-opetition relationships, trying to reduce the transfer number and balance cooperation strength as the goal, an optimization method of multi-modal bus network is proposed, which can for provide a macro reference in bus network layout and the overall optimization. And we make a related case analysis for Harbin’s bus network.Above all, in this paper, we establish the co-opetition model based on the station pairs in bus network, which can measure all competition and cooperation relationship between stations and lines. At the same time we explore the station groups characteristic of the multi-modal bus network, and put forward a new bus optimization method, providing reference for public transportation network planning and design.