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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Ceder A, Wilson NHM (1986) Bus network design. Transp Res B 20(4):331–344
Chakroborty P (2003) Genetic algorithms for optimal urban transit network design. Comput Aided Civ Infrastruct Eng 18(3):184–200
Chao PW (2011) A new fruit fly optimization algorithm: taking the financial distress model as an example. Knowl Based Syst 26:69–74
Cheng DY (2018) Research on optimization method for the line design of high-speed railway rapid bus considering in travel time reliability. Doctoral dissertation
Colomi A, Dorigo M, Maniezzo V (1991) The ant system: an autocatalytic optimization process. Technical report 91-016, Department of Electronics, Politecnicco di Milano, Italy
Dijkstra EW (1959) A note on two probles in connexion with graphs. Numer Math 1(1):269–271
Fan L, Mumford CL (2007) A simple model of the urban transit routing problem. In: The 7th metaheuritstics international conference, Montreal, Canada
Fan L, Mumford CL (2010) A metaheuristic approach to the urban transit routing problem. J Heuristics 16(3):353–372
Fan L, Mumford CL, Evans D (2009) A simple multi-objective optimization algorithm for the urban transit routing problem. In: 2009 IEEE congress on evolutionary computation. IEEE, pp 1–7
Hui Z (2016) Analysis of urban public traffic network structure and design of public traffic network. Dissertation, Beijing Jiaotong University
Hui Z, Peng Z (2015) Urban transit network design based on improved bee colony algorithm. J Beijing Jiaotong Univ 39(04):118–124
John M, Mumford C, Lewis R (2014) An improved multi-objective algorithm for the urban transit routing problem. In: EvoCOP 2014: Evolutionary computation in combinatorial optimisation, pp 49–60
Kechagiopoulos PN, Beligiannis GN (2014) Solving the urban transit routing problem using a particle swarm optimization based algorithm. Appl Soft Comput 21:654–676
Krishnanand KN, Ghose D (2005) Detection of multiple source locations using a glowworm metaphor with applications to collective robotics. In: Proceedings of IEEE swarm intelligence symposium 2005, pp 84–91
Magnanti TL, Wong RT (1984) Network design and transportation planning: models and algorithms. Transp Sci 18(1):1–55
Mandl CE (1980) Evaluation and optimization of urban public transportation networks. Eur J Oper Res 5(6):396–404
Mumford CL (2013) New heuristic and evolutionary operators for the multi-objective urban transit routing problem. In: 2013 IEEE congress on evolutionary computation. IEEE, pp 939–946
Nayeem MA, Rahman MK, Rahman MS (2014) Transit network design by genetic algorithm with elitism. Transp Res C 46:30–45
Nielsen G, Lind G, Mulley C, Nelson JD, Tegnér G (2005) Public transport planning the networks. HiTrans best practice guide
Nikolic M, Teodorovic D (2013) Transit network design by bee colony optimization. Expert Syst Appl 40(15):5945–5955
Pattnaik SB (1998) Urban bus transit route network design using genetic algorithm. J Transp Eng 124(4):368–375
Xiao H et al (2015) Flower pollination algorithm based on simulated annealing. J Comput Appl 35(4):1062–1066
Yang XS (2012) Flower pollination algorithm for global optimization. Unconventional computation and natural computation. Springer, Berlin, pp 240–249
Yi Z, Sheng Z (2012) Optimization of urban public traffic route based on genetic algorithm. Comput Eng Sci 34(09):109–112
Acknowledgements
This work was supported by Social Science Fund Project of Beijing (Grant No. 16SRB021) and The National Social Science Fund of China (Grant No. 17CGL075).
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
We declare that we have no conflict of interest.
Ethical approval
This article does not contain any studies with human participants performed by any of the authors.
Additional information
Communicated by V. Loia.
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Fan, L., Chen, H. & Gao, Y. An improved flower pollination algorithm to the urban transit routing problem. Soft Comput 24, 5043–5052 (2020). https://doi.org/10.1007/s00500-019-04253-3
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00500-019-04253-3