{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T08:12:05Z","timestamp":1761293525348},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2017,2,6]],"date-time":"2017-02-06T00:00:00Z","timestamp":1486339200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Nat Comput"],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1007\/s11047-016-9603-0","type":"journal-article","created":{"date-parts":[[2017,2,6]],"date-time":"2017-02-06T15:52:36Z","timestamp":1486396356000},"page":"769-784","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Hyperpath-based vehicle routing and scheduling method in time-varying networks for airport shuttle service"],"prefix":"10.1007","volume":"18","author":[{"given":"Wang","family":"Linqing","sequence":"first","affiliation":[]},{"given":"Zhao","family":"Jun","sequence":"additional","affiliation":[]},{"given":"Wang","family":"Wei","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,2,6]]},"reference":[{"issue":"2","key":"9603_CR1","first-page":"442","volume":"17","author":"Y Bao","year":"2011","unstructured":"Bao Y, Tang JF, Liu LL (2011) Clustering algorithm for minimizing vehicle number of airport pickup and delivery service. Comput Integr Manuf Syst 17(2):442\u2013447","journal-title":"Comput Integr Manuf Syst"},{"key":"9603_CR2","unstructured":"Black D, Eglese R, W\u00f8hlk S (2015) The time-dependent multiple-vehicle prize-collecting arc routing problem. (unpublished work)"},{"issue":"4","key":"9603_CR3","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/s10288-013-0232-5","volume":"11","author":"S Demeyer","year":"2013","unstructured":"Demeyer S et al (2013) Speeding up Martins\u2019 algorithm for multiple objective shortest path problems. 4OR-A Q J Oper Res 11(4):323\u2013348","journal-title":"4OR-A Q J Oper Res"},{"issue":"4","key":"9603_CR4","first-page":"437","volume":"23","author":"G Dong","year":"2008","unstructured":"Dong G et al (2008) Minimizing costs model and algorithm of free pickup and delivery customers to airport service. J Syst Eng 23(4):437\u2013443","journal-title":"J Syst Eng"},{"issue":"5","key":"9603_CR5","doi-asserted-by":"publisher","first-page":"789","DOI":"10.1007\/s10845-009-0311-9","volume":"22","author":"G Dong","year":"2011","unstructured":"Dong G et al (2011) An exact algorithm for vehicle routing and scheduling problem of free pickup and delivery service in flight ticket sales companies based on set-partitioning model. J Intell Manuf 22(5):789\u2013799","journal-title":"J Intell Manuf"},{"issue":"1","key":"9603_CR6","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/s11047-012-9324-y","volume":"12","author":"JL Fernandez-Marquez","year":"2013","unstructured":"Fernandez-Marquez JL, Serugendo GDM, Montagna S et al (2013) Description and composition of bio-inspired design patterns: a complete overview[J]. Nat Comput 12(1):43\u201367","journal-title":"Nat Comput"},{"issue":"5","key":"9603_CR7","doi-asserted-by":"publisher","first-page":"668","DOI":"10.1016\/j.trc.2009.08.005","volume":"18","author":"MA Figliozzi","year":"2010","unstructured":"Figliozzi MA (2010) An iterative route construction and improvement algorithm for the vehicle routing problem with soft time windows[J]. Transp Res Part C Emerg Technol 18(5):668\u2013679","journal-title":"Transp Res Part C Emerg Technol"},{"issue":"1","key":"9603_CR8","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/j.ejor.2009.10.002","volume":"204","author":"T Garaix","year":"2010","unstructured":"Garaix T et al (2010) Vehicle routing problems with alternative paths: an application to on-demand transportation. Eur J Oper Res 204(1):62\u201375","journal-title":"Eur J Oper Res"},{"key":"9603_CR9","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/j.cor.2015.06.001","volume":"64","author":"M Gendreau","year":"2015","unstructured":"Gendreau M, Ghiani G, Guerriero E (2015) Time-dependent routing problems: a review[J]. Comput Oper Res 64:189\u2013197","journal-title":"Comput Oper Res"},{"issue":"3","key":"9603_CR10","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1016\/j.ejor.2012.11.043","volume":"226","author":"C Lecluyse","year":"2013","unstructured":"Lecluyse C, S\u00f6rensen K, Peremans H (2013) A network-consistent time-dependent travel time layer for routing optimization problems[J]. Eur J Oper Res 226(3):395\u2013413","journal-title":"Eur J Oper Res"},{"issue":"1","key":"9603_CR11","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s11047-009-9136-x","volume":"9","author":"Y Marinakis","year":"2010","unstructured":"Marinakis Y, Marinaki M, Dounias G (2010) Honey bees mating optimization algorithm for large scale vehicle routing problems[J]. Nat Comput 9(1):5\u201327","journal-title":"Nat Comput"},{"issue":"2","key":"9603_CR12","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1016\/0377-2217(84)90077-8","volume":"16","author":"EQV Martins","year":"1984","unstructured":"Martins EQV (1984) On a multicriteria shortest path problem. Eur J Oper Res 16(2):236\u2013245","journal-title":"Eur J Oper Res"},{"issue":"2","key":"9603_CR13","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1287\/trsc.2014.0558","volume":"49","author":"S Mouthuy","year":"2015","unstructured":"Mouthuy S, Massen F, Deville Y et al (2015) A multistage very large-scale neighborhood search for the vehicle routing problem with soft time windows[J]. Transp Sci 49(2):223\u2013238","journal-title":"Transp Sci"},{"issue":"1","key":"9603_CR14","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1016\/j.ejor.2004.12.003","volume":"173","author":"S Opasanon","year":"2006","unstructured":"Opasanon S, Miller-Hooks E (2006) Multicriteria adaptive paths in stochastic, time-varying networks. Eur J Oper Res 173(1):72\u201391","journal-title":"Eur J Oper Res"},{"issue":"3","key":"9603_CR15","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/s10288-013-0229-0","volume":"11","author":"M Pascoal","year":"2013","unstructured":"Pascoal M et al (2013) Bicriteria path problem minimizing the cost and minimizing the number of labels. 4OR 11(3):275\u2013294","journal-title":"4OR"},{"issue":"1\u20132","key":"9603_CR16","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s12469-013-0060-1","volume":"5","author":"S Ravizza","year":"2013","unstructured":"Ravizza S et al (2013) The trade-off between taxi time and fuel consumption in airport ground movement. Public Transp 5(1\u20132):25\u201340","journal-title":"Public Transp"},{"issue":"6","key":"9603_CR17","first-page":"35","volume":"11","author":"J Tang","year":"2008","unstructured":"Tang J et al (2008) Multi-objective model and algorithm of free pickup customer and delivery to airport service. J Manag Sci China 11(6):35\u201342","journal-title":"J Manag Sci China"},{"issue":"5","key":"9603_CR18","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1016\/j.fss.2008.09.016","volume":"160","author":"J Tang","year":"2009","unstructured":"Tang J et al (2009) Vehicle routing problem with fuzzy time windows. Fuzzy Sets Syst 160(5):683\u2013695","journal-title":"Fuzzy Sets Syst"},{"key":"9603_CR19","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1016\/j.tre.2014.11.001","volume":"73","author":"J Tang","year":"2015","unstructured":"Tang J, Yu Y, Li J (2015) An exact algorithm for the multi-trip vehicle routing and scheduling problem of pickup and delivery of customers to the airport. Transp Res Part E Logist Transp Rev 73:114\u2013132","journal-title":"Transp Res Part E Logist Transp Rev"},{"issue":"2","key":"9603_CR20","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1016\/j.ejor.2015.07.048","volume":"248","author":"D Ta\u015f","year":"2016","unstructured":"Ta\u015f D, Gendreau M, Jabali O et al (2016) The traveling salesman problem with time-dependent service times[J]. Eur J Oper Res 248(2):372\u2013383","journal-title":"Eur J Oper Res"},{"key":"9603_CR21","doi-asserted-by":"crossref","unstructured":"Wang L, Tang J (2010) Application of BP Neural Network in Exhaust Emission Estimatation of CAPS. Lect Note Comput Sci 312\u2013320","DOI":"10.1007\/978-3-642-15597-0_35"},{"issue":"3","key":"9603_CR22","doi-asserted-by":"publisher","first-page":"915","DOI":"10.1016\/j.ejor.2013.10.044","volume":"236","author":"L Wen","year":"2014","unstructured":"Wen L, Catay B, Eglese R (2014) Finding a minimum cost path between a pair of nodes in a time-varying road network with a congestion charge. Eur J Oper Res 236(3):915\u2013923","journal-title":"Eur J Oper Res"},{"issue":"3B","key":"9603_CR23","doi-asserted-by":"publisher","first-page":"84","DOI":"10.4236\/ib.2013.53B018","volume":"05","author":"Z Xu","year":"2013","unstructured":"Xu Z, Tang J (2013) An algorithm to vehicle scheduling problem of airport pickup and delivery service. Ibusiness 05(3B):84\u201389","journal-title":"Ibusiness"},{"key":"9603_CR24","unstructured":"Xu Z, Tang J (2014) A coordination-based two-stage algorithm for pickup and delivery of customers to airport. Proceedings of the Seventh International Conference on Management Science and Engineering Management. J. Xu, J. A. Fry, B. Lev and A. Hajiyev, Springer Berlin Heidelberg. 242: 815\u2013826"},{"key":"9603_CR25","doi-asserted-by":"crossref","unstructured":"Xu Z, Tang J (2014) Customer point collaboration-based multi-trip vehicle scheduling algorithm to pickup and delivery service to airport. The 26th Chinese Control and Decision Conference (2014 CCDC), 4892\u20134896","DOI":"10.1109\/CCDC.2014.6853049"},{"issue":"6","key":"9603_CR26","doi-asserted-by":"publisher","first-page":"1075","DOI":"10.1016\/j.tre.2011.04.002","volume":"47","author":"J Xu","year":"2011","unstructured":"Xu J, Yan F, Li S (2011) Vehicle routing optimization with soft time windows in a fuzzy random environment. Transp Res Part E Logist Transp Rev 47(6):1075\u20131091","journal-title":"Transp Res Part E Logist Transp Rev"},{"issue":"2","key":"9603_CR27","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1016\/j.tre.2010.09.010","volume":"47","author":"B Yu","year":"2011","unstructured":"Yu B, Yang ZZ (2011) An ant colony optimization model: the period vehicle routing problem with time windows[J]. Transp Res Part E Logist Transp Rev 47(2):166\u2013181","journal-title":"Transp Res Part E Logist Transp Rev"},{"issue":"2","key":"9603_CR28","first-page":"103","volume":"27","author":"X Zang","year":"2010","unstructured":"Zang X, Zhou W (2010) Theoretic capacity model based on variable space headway. J Highw Transp Res Dev 27(2):103\u2013113","journal-title":"J Highw Transp Res Dev"}],"container-title":["Natural Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-016-9603-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11047-016-9603-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-016-9603-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,8]],"date-time":"2019-11-08T17:10:29Z","timestamp":1573233029000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11047-016-9603-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,2,6]]},"references-count":28,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["9603"],"URL":"https:\/\/doi.org\/10.1007\/s11047-016-9603-0","relation":{},"ISSN":["1567-7818","1572-9796"],"issn-type":[{"value":"1567-7818","type":"print"},{"value":"1572-9796","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,2,6]]},"assertion":[{"value":"6 February 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}