Multi-path search algorithm in public transportation based on node accessibility
基于节点可达度的公交多路径搜索算法

This paper studied path search problem in public transport network from the perspective of complex network, and proposed a multi-path search algorithm in public transportation based on node accessibility from the actual needs of travelers. This algorithm represented public transport network with complex bipartite network, which regarded bus lines and bus stations as different kinds of nodes respectively and there was an edge between each line and every station it passed. Based on the analysis of network community, it defined a concept of node accessibility. The algorithm searched paths from source node to destination node according to node accessibility and it reserved multiple possible optimal paths. Experiment result shows that this algorithm can find several effective paths which have the minimum transfer times.