{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:17:47Z","timestamp":1740107867499,"version":"3.37.3"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T00:00:00Z","timestamp":1555718400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Science and Technology Plan Project of Beijing","award":["No. Z171100005117001"],"award-info":[{"award-number":["No. Z171100005117001"]}]},{"DOI":"10.13039\/100012492","name":"Beijing Outstanding Talent Training Foundation","doi-asserted-by":"crossref","award":["No. 2017000021063G008"],"award-info":[{"award-number":["No. 2017000021063G008"]}],"id":[{"id":"10.13039\/100012492","id-type":"DOI","asserted-by":"crossref"}]},{"name":"National Engineering Laboratory for Comprehensive Transportation Big Data Application Technology"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2020,5]]},"DOI":"10.1007\/s00500-019-03987-4","type":"journal-article","created":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T05:02:32Z","timestamp":1555736552000},"page":"6329-6344","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A dynamic line generation and vehicle scheduling method for airport bus line based on multi-source big travel data"],"prefix":"10.1007","volume":"24","author":[{"given":"Haitao","family":"Yu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weifeng","family":"Lv","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hangou","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoning","family":"Fu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0213-4307","authenticated-orcid":false,"given":"Randong","family":"Xiao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,4,20]]},"reference":[{"key":"3987_CR1","unstructured":"China Road Transport (2016) The 13th five-year plan for urban public transportation. 9:24\u201329"},{"key":"3987_CR2","unstructured":"Beijing Public Transport Corporation and Beijing Bus (2016) The 2016 social responsibility report. 6:40\u201341"},{"issue":"4","key":"3987_CR3","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/S0968-090X(99)00019-4","volume":"7","author":"M Dessouky","year":"1994","unstructured":"Dessouky M, Hall R, Nowroozi A (1994) Bus dispatching at timed transfer transit stations using bus tracking technology. Transp Res Part C Emerg Technol 7(4):187\u2013208","journal-title":"Transp Res Part C Emerg Technol"},{"key":"3987_CR4","unstructured":"Cayford R, Yim Y (2004) Personalized demand-responsive transit service. UCB-PRR-2004-12, California PATH, Berkeley"},{"issue":"1","key":"3987_CR5","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/j.trc.2002.08.001","volume":"12","author":"MET Horn","year":"2004","unstructured":"Horn MET (2004) Procedures for planning multi-leg journeys with fixed-route and demand-responsive passenger transport services. Transp Res Part C Emerg Technol 12(1):33\u201355","journal-title":"Transp Res Part C Emerg Technol"},{"issue":"2","key":"3987_CR6","first-page":"167","volume":"36","author":"MET Horn","year":"2002","unstructured":"Horn MET (2002) Multi-modal and demand-responsive passenger transport systems: a modelling framework with embedded control systems. Transp Res Part A 36(2):167\u2013188","journal-title":"Transp Res Part A"},{"issue":"9","key":"3987_CR7","doi-asserted-by":"publisher","first-page":"1450","DOI":"10.1016\/j.trb.2011.05.017","volume":"45","author":"N Agatz","year":"2011","unstructured":"Agatz N, Erera A, Savelsbergh MWP (2011) Dynamic ride-sharing: a simulation study in metro Atlanta. Transp Res Part B Methodol 45(9):1450\u20131464","journal-title":"Transp Res Part B Methodol"},{"issue":"11","key":"3987_CR8","doi-asserted-by":"crossref","first-page":"1181","DOI":"10.14778\/3402707.3402752","volume":"4","author":"E Zeitler","year":"2011","unstructured":"Zeitler E, Risch T (2011) Massive scale-out of expensive continuous queries. Proc Vldb Endow 4(11):1181\u20131188","journal-title":"Proc Vldb Endow"},{"issue":"6","key":"3987_CR9","first-page":"32","volume":"11","author":"A Fud","year":"2000","unstructured":"Fud A (2000) FDBSCAN: a fast DBSCAN algorithm. J Softw 11(6):32\u201334","journal-title":"J Softw"},{"issue":"10","key":"3987_CR10","doi-asserted-by":"publisher","first-page":"3224","DOI":"10.1016\/j.patcog.2008.03.023","volume":"41","author":"M Duckham","year":"2008","unstructured":"Duckham M, Kulik L, Worboys M (2008) Efficient generation of simple polygons for characterizing the shape of a set of points in the plane. Pattern Recognit 41(10):3224\u20133236","journal-title":"Pattern Recognit"},{"key":"3987_CR11","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1016\/j.patcog.2011.04.032","volume":"45","author":"FH Shang","year":"2012","unstructured":"Shang FH, Jiao LC, Shi JR (2012) Fast affinity propagation clustering: a multilevel approach. Pattern Recognit. 45:474\u2013486","journal-title":"Pattern Recognit."},{"issue":"7","key":"3987_CR12","first-page":"1100","volume":"39","author":"Z Zhang","year":"2013","unstructured":"Zhang Z, Wang BQ, Li XT (2013) Semi-supervised traffic identification based on affinity propagation. ACTA 39(7):1100\u20131109","journal-title":"ACTA"},{"issue":"11","key":"3987_CR13","doi-asserted-by":"publisher","first-page":"2803","DOI":"10.3724\/SP.J.1001.2008.02803","volume":"19","author":"Y Xiao","year":"2008","unstructured":"Xiao Y, Yu J (2008) Semi-Supervised clustering based on affinity propagation algorithm. J Softw 19(11):2803\u20132813","journal-title":"J Softw"},{"issue":"3","key":"3987_CR14","first-page":"469","volume":"31","author":"E Taillard","year":"1997","unstructured":"Taillard E, Badeau P, Gendreau M (1997) A tabu search heuristic for the vehicle routing problem with soft time windows. Transp Sci 31(3):469\u2013477","journal-title":"Transp Sci"},{"issue":"5","key":"3987_CR15","doi-asserted-by":"publisher","first-page":"787","DOI":"10.1016\/S0305-0548(02)00051-5","volume":"30","author":"BM Baker","year":"2003","unstructured":"Baker BM, Ayechew MA (2003) A genetic algorithm for the vehicle routing problem. Comput Oper Res 30(5):787\u2013800","journal-title":"Comput Oper Res"},{"issue":"12","key":"3987_CR16","doi-asserted-by":"publisher","first-page":"1985","DOI":"10.1016\/S0305-0548(03)00158-8","volume":"31","author":"C Prins","year":"2004","unstructured":"Prins C (2004) A simple and effective evolutionary algorithm for the vehicle routing problem. Comput Oper Res 31(12):1985\u20132002","journal-title":"Comput Oper Res"},{"issue":"2","key":"3987_CR17","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/BF02247879","volume":"45","author":"PM Pardalos","year":"1990","unstructured":"Pardalos PM, Rodgers GP (1990) Computational aspects of a branch and bound algorithm for quadratic zero-one programming. Computing 45(2):131\u2013144","journal-title":"Computing"},{"issue":"2","key":"3987_CR18","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1016\/j.ejor.2006.10.034","volume":"183","author":"A D\u2019Ariano","year":"2007","unstructured":"D\u2019Ariano A, Pacciarelli D, Pranzo M (2007) A branch and bound algorithm for scheduling trains in a railway network. Eur J Oper Res 183(2):643\u2013657","journal-title":"Eur J Oper Res"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-019-03987-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-019-03987-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-019-03987-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,6]],"date-time":"2020-12-06T23:23:52Z","timestamp":1607297032000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-019-03987-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4,20]]},"references-count":18,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2020,5]]}},"alternative-id":["3987"],"URL":"https:\/\/doi.org\/10.1007\/s00500-019-03987-4","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"type":"print","value":"1432-7643"},{"type":"electronic","value":"1433-7479"}],"subject":[],"published":{"date-parts":[[2019,4,20]]},"assertion":[{"value":"20 April 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":"All authors declare that they have no conflict of interest in this research.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Human and animal rights"}},{"value":"Informed consent was obtained from all individual participants included in the study.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Informed consent"}}]}}