基于深度优先遍历算法-回溯算法的公交网络限时免费换乘优化模型求解

Solution of the Optimization Model of Bus Network Time-limited Free Transfer Based on DFS-Backtracking Algorithm

基于青岛市"限时免费换乘"政策理念,建立费用与时间、换乘次数的关系模型,采用深度优先遍历与回溯相结合的算法,寻找限定时间内最短时间与超限时条件下最低费用路径,给出起讫点间的最优路径方案。结合车站智能诱导发布平台对算法进行验证。运行结果表明,DFS-回溯算法在数据规模较大的情况下,比蚁群等全局搜索算法效率高,可既快又准地找到最优路线;基于该算法的最佳路径模型方案,可准确的为乘客提供最大选择便利性,实现公共交通资源利用最大化。

Based on the Qingdao policy of ＂Time-limited Free Transfer＂, the relational model of cost, time and the number of transfer are established, adopting depth-first search combined with backtracking algorithm, looking for path of the shortest time within limited-time and path of the lowest cost under the condition of overrun, The opti-mal path of any OD is obtained. Combined with the station intelligent induction publishing platform to verify this al-gorithm. the running results show that the DFS-backtracking algorithm have higher efficiency than the global search algorithms such as ant colony algorithm, under the condition of larger data size, can be quickly and accurately find the optimal route; The best route model based on the algorithm, can accurately provide maximum choice conven-ience for passengers, maximize public transport resource utilization.