{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T23:41:48Z","timestamp":1776296508978,"version":"3.50.1"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T00:00:00Z","timestamp":1565049600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T00:00:00Z","timestamp":1565049600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"The Social Science Fund of Beijing","award":["16SRB021"],"award-info":[{"award-number":["16SRB021"]}]},{"name":"The National Social Science Fund of China","award":["17CGL075"],"award-info":[{"award-number":["17CGL075"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2020,4]]},"DOI":"10.1007\/s00500-019-04253-3","type":"journal-article","created":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T09:42:10Z","timestamp":1565170930000},"page":"5043-5052","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["An improved flower pollination algorithm to the urban transit routing problem"],"prefix":"10.1007","volume":"24","author":[{"given":"Lang","family":"Fan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9761-8859","authenticated-orcid":false,"given":"Hui","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ying","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,8,6]]},"reference":[{"issue":"4","key":"4253_CR1","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/0191-2615(86)90047-0","volume":"20","author":"A Ceder","year":"1986","unstructured":"Ceder A, Wilson NHM (1986) Bus network design. Transp Res B 20(4):331\u2013344","journal-title":"Transp Res B"},{"issue":"3","key":"4253_CR2","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1111\/1467-8667.00309","volume":"18","author":"P Chakroborty","year":"2003","unstructured":"Chakroborty P (2003) Genetic algorithms for optimal urban transit network design. Comput Aided Civ Infrastruct Eng 18(3):184\u2013200","journal-title":"Comput Aided Civ Infrastruct Eng"},{"key":"4253_CR3","first-page":"69","volume":"26","author":"PW Chao","year":"2011","unstructured":"Chao PW (2011) A new fruit fly optimization algorithm: taking the financial distress model as an example. Knowl Based Syst 26:69\u201374","journal-title":"Knowl Based Syst"},{"key":"4253_CR4","unstructured":"Cheng DY (2018) Research on optimization method for the line design of high-speed railway rapid bus considering in travel time reliability. Doctoral dissertation"},{"key":"4253_CR5","unstructured":"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"},{"issue":"1","key":"4253_CR6","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra EW (1959) A note on two probles in connexion with graphs. Numer Math 1(1):269\u2013271","journal-title":"Numer Math"},{"key":"4253_CR7","unstructured":"Fan L, Mumford CL (2007) A simple model of the urban transit routing problem. In: The 7th metaheuritstics international conference, Montreal, Canada"},{"issue":"3","key":"4253_CR8","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/s10732-008-9089-8","volume":"16","author":"L Fan","year":"2010","unstructured":"Fan L, Mumford CL (2010) A metaheuristic approach to the urban transit routing problem. J Heuristics 16(3):353\u2013372","journal-title":"J Heuristics"},{"key":"4253_CR9","doi-asserted-by":"crossref","unstructured":"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\u20137","DOI":"10.1109\/CEC.2009.4982923"},{"key":"4253_CR10","unstructured":"Hui Z (2016) Analysis of urban public traffic network structure and design of public traffic network. Dissertation, Beijing Jiaotong University"},{"issue":"04","key":"4253_CR11","first-page":"118","volume":"39","author":"Z Hui","year":"2015","unstructured":"Hui Z, Peng Z (2015) Urban transit network design based on improved bee colony algorithm. J Beijing Jiaotong Univ 39(04):118\u2013124","journal-title":"J Beijing Jiaotong Univ"},{"key":"4253_CR12","doi-asserted-by":"crossref","unstructured":"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\u201360","DOI":"10.1007\/978-3-662-44320-0_5"},{"key":"4253_CR13","doi-asserted-by":"publisher","first-page":"654","DOI":"10.1016\/j.asoc.2014.04.005","volume":"21","author":"PN Kechagiopoulos","year":"2014","unstructured":"Kechagiopoulos PN, Beligiannis GN (2014) Solving the urban transit routing problem using a particle swarm optimization based algorithm. Appl Soft Comput 21:654\u2013676","journal-title":"Appl Soft Comput"},{"key":"4253_CR14","unstructured":"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\u201391"},{"issue":"1","key":"4253_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/trsc.18.1.1","volume":"18","author":"TL Magnanti","year":"1984","unstructured":"Magnanti TL, Wong RT (1984) Network design and transportation planning: models and algorithms. Transp Sci 18(1):1\u201355","journal-title":"Transp Sci"},{"issue":"6","key":"4253_CR16","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1016\/0377-2217(80)90126-5","volume":"5","author":"CE Mandl","year":"1980","unstructured":"Mandl CE (1980) Evaluation and optimization of urban public transportation networks. Eur J Oper Res 5(6):396\u2013404","journal-title":"Eur J Oper Res"},{"key":"4253_CR17","doi-asserted-by":"crossref","unstructured":"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\u2013946","DOI":"10.1109\/CEC.2013.6557668"},{"key":"4253_CR18","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/j.trc.2014.05.002","volume":"46","author":"MA Nayeem","year":"2014","unstructured":"Nayeem MA, Rahman MK, Rahman MS (2014) Transit network design by genetic algorithm with elitism. Transp Res C 46:30\u201345","journal-title":"Transp Res C"},{"key":"4253_CR19","unstructured":"Nielsen G, Lind G, Mulley C, Nelson JD, Tegn\u00e9r G (2005) Public transport planning the networks. HiTrans best practice guide"},{"issue":"15","key":"4253_CR20","doi-asserted-by":"publisher","first-page":"5945","DOI":"10.1016\/j.eswa.2013.05.002","volume":"40","author":"M Nikolic","year":"2013","unstructured":"Nikolic M, Teodorovic D (2013) Transit network design by bee colony optimization. Expert Syst Appl 40(15):5945\u20135955","journal-title":"Expert Syst Appl"},{"issue":"4","key":"4253_CR21","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1061\/(ASCE)0733-947X(1998)124:4(368)","volume":"124","author":"SB Pattnaik","year":"1998","unstructured":"Pattnaik SB (1998) Urban bus transit route network design using genetic algorithm. J Transp Eng 124(4):368\u2013375","journal-title":"J Transp Eng"},{"issue":"4","key":"4253_CR22","first-page":"1062","volume":"35","author":"H Xiao","year":"2015","unstructured":"Xiao H et al (2015) Flower pollination algorithm based on simulated annealing. J Comput Appl 35(4):1062\u20131066","journal-title":"J Comput Appl"},{"key":"4253_CR23","first-page":"240","volume-title":"Flower pollination algorithm for global optimization","author":"XS Yang","year":"2012","unstructured":"Yang XS (2012) Flower pollination algorithm for global optimization. Unconventional computation and natural computation. Springer, Berlin, pp 240\u2013249"},{"issue":"09","key":"4253_CR24","first-page":"109","volume":"34","author":"Z Yi","year":"2012","unstructured":"Yi Z, Sheng Z (2012) Optimization of urban public traffic route based on genetic algorithm. Comput Eng Sci 34(09):109\u2013112","journal-title":"Comput Eng Sci"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-019-04253-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-019-04253-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-019-04253-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,4]],"date-time":"2020-08-04T23:16:34Z","timestamp":1596582994000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-019-04253-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,6]]},"references-count":24,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2020,4]]}},"alternative-id":["4253"],"URL":"https:\/\/doi.org\/10.1007\/s00500-019-04253-3","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,8,6]]},"assertion":[{"value":"6 August 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"We declare that we have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}