Research on Bus and Metro Transfer From Perspective of Hypernetwork—A Case Study of Xi’an, China (December 2020)

Abstract

Aiming at the blank of hypernetwork in the empirical research field of the composite transportation network, taking Xi'an city as an example, this paper uses the “HyperEdge” to connect the bus network with the metro network and constructs a large-scale complex hypernetwork, hereinafter referred to as B-M hypernetwork. In this paper, the topological characteristics of a single hypernetwork are analogized to a complex hypernetwork, and the interaction mechanism among bus networks, metro networks, and B-M hypernetwork is studied. A multi-source least transferred algorithm based on the incidence matrix is proposed to solve any two nodes' minimum transfer times in a large complex hypernetwork. The multi-source least transferred algorithm and matrix transfer algorithm is applied to the B-M hypernetwork, and the random attack and intentional attack analyze the robustness of the B-M hypernetwork. The results show that the improved multi-source minimum transmission algorithm based on the incidence matrix is feasible and effective and can obtain superior computing power for large and complex hypernetworks.

Keywords

• Hypernetwork
• topological characteristics
• robustness
• incidence matrix
• deep optimization algorithm