Abstract

The urban transit routing problem is NP-Hard, referring to the design of effective bus routes on the existing road networks. Current studies mainly focus on the models and the application of algorithms, and the improvements in the operation process in the algorithm such as the construction of initial solutions and the transformation methods are not investigated in detail. In order to optimize bus routes, the initial bus route set generation method, the local search, and the global search of the flower pollination algorithm were improved. Taking the average travel time of passengers and the proportion of the number of transfers as the optimization objective, an improved initial population generative method and an improved framework of flower pollination algorithm were applied to obtain a better set of bus routes. Finally, the effectiveness of the improved algorithm was verified based on some experimental results and compared to the previous bus networks such as Mandl’s Switzerland network.

中文翻译：

---

改进的花卉授粉算法解决城市公交路径问题

摘要

城市公交路线问题是NP-Hard，指的是现有道路网络上有效公交路线的设计。目前的研究主要集中在算法的模型和应用上，对算法的运算过程的改进，如初始解的构造和变换方法等，都没有详细研究。为了优化公交路线，改进了花授粉算法的初始公交路线集生成方法，局部搜索和全局搜索。以旅客的平均出行时间和换乘次数的比例为优化目标，采用改进的初始种群生成方法和改进的花粉授粉算法框架，获得了一套较好的公交线路。最后，