基于矩阵迭代法的出租车合乘最短路径选择

摘要

为了解决出租车合乘的路线行驶最优问题以保证驾驶员和乘客均能获得利益,构造道路交通网络的距离矩阵,运用运筹学中的矩阵迭代法来求解网络图中的最短距离并确定最短路线,并针对某个道路网络做了分析例证.结论显示:矩阵迭代法用于求解道路网络的最短路径,从理论上解决了出租车在合乘时的路线选择问题,从而使出租车合乘乘客能快捷的到达目的地.%To optimize running route to realize win-win, the distance matrix of road net is built, and matrix iteration method is applied to calculate the shortest distance and find the shortcut. The analysis result of a road net reveals that the matrix iteration method can solve the shortcut question for ensuring the taxi pooling to arrive destination quickly and economically.