公交乘车最佳换乘路线问题

Optimal Bus Transfer Route

随着城市化的加速,城市公交也得到了相应的快速发展.公交车上的智能化服务越来越升级.它可以方便乘客,减轻乘务员的服务负担且能提高服务质量.文章就一个固定模式的城市公交网络去探讨了公交出行乘车距离最短、换乘站点和换乘车次问题.把通常单向或双向有向边的最短路问题用二维邻接矩阵的处理方法,拓广到四维邻接矩阵,建立了解决复有向边的有向图问题的数学模型,且利用Lingo软件对一简化的公交网络进行编程计算,验证了方法的可靠性.四维邻接矩阵解决此类问题的方法及其深入探究也具有一定的理论价值.

With the acceleration of urbanization,urban public transport has also developed rapidly.Intelligent services on buses are getting more and more upgraded.It can facilitate passengers,reduce the service burden of flight attendants and improve the service quality.In this paper,the problems of the shortest bus travel distance,transfer stations and transfer trains are discussed for a fixed mode urban bus network.In this paper,the shortest path problem of one-way or two-way directed edge is extended to four-dimensional adjacent matrix by using the processing method of two-dimensional adjacent matrix,and a mathematical model for solving the directed graph problem of complex directed edge is established.The lingo software is used to program and calculate a simplified bus network,and the reliability of the method is verified.The method of solving such problems with four-dimensional adjacency matrix and its in-depth study also have certain theoretical value.