摘要
笔者分别使用L空间方法和P空间方法对公共交通网络(公交网络)进行建模,将其建为一个复杂网络模型。利用邻接矩阵将公交网络在计算机中进行表达和存储。根据复杂网络理论,分析了其统计特性。随后介绍了广度优先搜索算法,并利用该算法设计了换乘次数最少的最优公交换乘方案。最后用实际数据验证了此算法的有效性。
The author uses the L space method and the P space method to model the public transport network(public transport network),and builds it into a complex network model.By using the adjacency matrix,the bus network is expressed and stored in the computer.According to the complex network theory,the statistical characteristics are analyzed.Then we introduce the breadth first search algorithm,and use the algorithm to design the optimal bus transfer scheme with the least transfer times.Finally,the validity of the algorithm is verified by the actual data.
作者
李娜
王波
Li Na;Wang Bo(School of Electro-mechanical and Information Technology,Yiwu Industrial&Commercial College,Yiwu Zhejiang 322000,China)
出处
《信息与电脑》
2018年第6期32-34,共3页
Information & Computer
基金
2017年浙江省大学生科技创新活动计划暨新苗人才计划项目"基于广度优先搜索的城市最优公交换乘方案研究与设计"(项目编号:2017R476004)
关键词
公交网络
复杂网络
广度优先搜索
换乘
bus transport network
complex network
breadth first search
transfer
