{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T08:28:06Z","timestamp":1772785686846,"version":"3.50.1"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"16","license":[{"start":{"date-parts":[[2021,2,25]],"date-time":"2021-02-25T00:00:00Z","timestamp":1614211200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,2,25]],"date-time":"2021-02-25T00:00:00Z","timestamp":1614211200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput & Applic"],"published-print":{"date-parts":[[2021,8]]},"DOI":"10.1007\/s00521-021-05794-1","type":"journal-article","created":{"date-parts":[[2021,2,25]],"date-time":"2021-02-25T11:04:41Z","timestamp":1614251081000},"page":"10323-10334","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["A dynamic routing optimization problem considering joint delivery of passengers and parcels"],"prefix":"10.1007","volume":"33","author":[{"given":"Teng","family":"Ren","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhuo","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiangyu","family":"Cai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yongzhuo","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lining","family":"Xing","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuan","family":"Zhuang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhenping","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,2,25]]},"reference":[{"key":"5794_CR1","first-page":"141","volume":"S1","author":"C Shanshan","year":"2013","unstructured":"Shanshan C, Hong C, Jiasheng Ye (2013) Research on emergency merchandise distribution under the demand of e-commerce promotion blowout. China Manag Sci S1:141\u2013147","journal-title":"China Manag Sci"},{"key":"5794_CR2","doi-asserted-by":"publisher","first-page":"085008","DOI":"10.1088\/1748-9326\/Ab299b","volume":"14","author":"L Weiand","year":"2019","unstructured":"Weiand L et al (2019) \u201cErratum: climate change and air pollution: the connection between traffic intervention policies and public acceptance in a local context. Environ Res Lett 14:085008. https:\/\/doi.org\/10.1088\/1748-9326\/Ab299b","journal-title":"Environ Res Lett"},{"issue":"2","key":"5794_CR3","first-page":"89","volume":"1","author":"JF Cordeau","year":"2003","unstructured":"Cordeau JF, Laporte G (2003) The Dial-a-ride problem (DARP): variants, modeling issues and algorithms. Q J Belg Fr Ital Oper Res Soc 1(2):89\u2013101","journal-title":"Q J Belg Fr Ital Oper Res Soc"},{"key":"5794_CR4","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.ejor.2014.03.003","volume":"238","author":"B Li","year":"2014","unstructured":"Li B, Krushinsky D, Reijers HA, Van Woensel T (2014) The share-a-ride problem: people and parcels sharing taxis. Eur J Oper Res 238:31\u201340. https:\/\/doi.org\/10.1016\/j.ejor.2014.03.003","journal-title":"Eur J Oper Res"},{"issue":"1","key":"5794_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0377-2217(02)00915-3","volume":"151","author":"G Ghiani","year":"2003","unstructured":"Ghiani G, Guerriero F, Laporte G et al (2003) Real-time vehicle routing: solution concepts, algorithms and parallel computing strategies [J]. Eur J Oper Res 151(1):1\u201311","journal-title":"Eur J Oper Res"},{"issue":"2","key":"5794_CR6","first-page":"37","volume":"3","author":"A Trentini","year":"2010","unstructured":"Trentini A, Mahl\u00e9n\u00e9 N (2010) Toward a Shared Urban Transport System Ensuring Passengers & Goods Cohabitation [J]. Tema Journal of Land Use Mobility & Environment 3(2):37\u201344","journal-title":"Tema Journal of Land Use Mobility & Environment"},{"issue":"1","key":"5794_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2012.08.015","volume":"225","author":"V Pillac","year":"2013","unstructured":"Pillac V, Gendreau M, Gu\u00e9ret C et al (2013) A review of dynamic vehicle routing problems[J]. Eur J Op Res 225(1):1\u201311","journal-title":"Eur J Op Res"},{"key":"5794_CR8","first-page":"57","volume":"03","author":"Ge Xianlong","year":"2011","unstructured":"Xianlong Ge, Wang Xu, Ying D (2011) Vehicle scheduling problem with stochastic demand based on hybrid quantum genetic algorithm [J]. Syst Eng 03:57\u201363","journal-title":"Syst Eng"},{"key":"5794_CR9","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1016\/j.cor.2015.08.008","volume":"66","author":"B Li","year":"2016","unstructured":"Li B, Krushinsky D, Van Woensel T, Reijers HA (2016) An adaptive large neighborhood search heuristic for the share-a-ride problem. Comput Oper Res 66:170\u2013180","journal-title":"Comput Oper Res"},{"key":"5794_CR10","doi-asserted-by":"crossref","unstructured":"Nguyen NQ, Tuan KLE, Nghiem NVD et al (2015) People and parcels sharing a taxi for Tokyo city. ACM Int Conf Proceeding Ser 03\u201304-December-2015:90\u201397","DOI":"10.1145\/2833258.2833309"},{"issue":"8","key":"5794_CR11","first-page":"1","volume":"17","author":"Li Yanfeng","year":"2014","unstructured":"Yanfeng Li, Ziyou G, Jun Li (2014) Dynamic vehicle routing and dispatching problem% research on dynamic network vehicle routing and dispatching problem [J]. J Manag Sci 17(8):1\u20139","journal-title":"J Manag Sci"},{"key":"5794_CR12","first-page":"58","volume":"7","author":"Z Ting","year":"2015","unstructured":"Ting Z, Pingzhong L, Qinfei H et al (2015) Optimization of dynamic vehicle routing of urban distribution based on the real-time information [J]. Syst Eng 7:58\u201364","journal-title":"Syst Eng"},{"key":"5794_CR13","doi-asserted-by":"crossref","unstructured":"Zhou L et al. (2017) \"Solving dynamic vehicle routing problem via evolutionary search with learning capability,\" 2017 IEEE Congress on Evolutionary Computation (CEC), San Sebastian, pp. 890-896","DOI":"10.1109\/CEC.2017.7969403"},{"key":"5794_CR14","doi-asserted-by":"crossref","unstructured":"Van Son N, Babaki B, Dries A, Dung PQ, Xuan N (2017) \"Prediction-based optimization for online People and Parcels share a ride taxis,\"\u00a02017 9th International Conference on Knowledge and Systems Engineering (KSE), Hue, pp. 42\u201347","DOI":"10.1109\/KSE.2017.8119432"},{"key":"5794_CR15","doi-asserted-by":"crossref","unstructured":"NGUYEN VS, Dung PHAM Q, PHAN AT (2019) \"An adaptive large neighborhood search solving large people and parcel share-a-ride problem,\"\u00a02019 6th NAFOSTED Conference on Information and Computer Science (NICS), Hanoi, Vietnam, pp. 303\u2013308","DOI":"10.1109\/NICS48868.2019.9023893"},{"key":"5794_CR16","unstructured":"Fang Y, Chen K, Chu F, Wu P (2017) Model for the multiple depots heterogeneous dial-aride problem with flexible depots. 14th Int Conf Serv Syst Serv Manag ICSSSM 2017"},{"key":"5794_CR17","doi-asserted-by":"crossref","unstructured":"Huang H, Savkin AV, Huang C (2019) \"Control of a novel parcel delivery system consisting of a UAV and a Public Train,\"\u00a02019 IEEE 17th International Conference on Industrial Informatics (INDIN), Helsinki, Finland, 2019, pp. 1047\u20131050","DOI":"10.1109\/INDIN41052.2019.8972296"},{"issue":"Z2","key":"5794_CR18","first-page":"1","volume":"38","author":"KF Zhang","year":"2017","unstructured":"Zhang KF, Lu MM, Zheng L (2017) Big data based metro crowd delivery system. J Commun 38(Z2):1\u201314","journal-title":"J Commun"},{"key":"5794_CR19","first-page":"1547","volume":"37","author":"Pu Lv","year":"2017","unstructured":"Lv Pu, Xiangpei Hu (2017) Lu Bo (2017) research on high-speed rail express cooperation game model based on participating in relation network[J]. Syst Eng Theor Pract 37:1547","journal-title":"Syst Eng Theor Pract"},{"key":"5794_CR20","doi-asserted-by":"crossref","unstructured":"Liu Y, Khalifa IH, Kamel AE (2016) \"The multi-period and multi-depot dynamic vehicle routing problem with time windows,\" 2016 3rd International Conference on Logistics Operations Management (GOL), Fez, 2016, pp. 1\u20136","DOI":"10.1109\/GOL.2016.7731713"},{"issue":"6","key":"5794_CR21","first-page":"1146","volume":"25","author":"H Shilian","year":"2016","unstructured":"Shilian H (2016) Distribution routes clustering and optimization based on customer dynamic demand attributes [J]. J Syst Manag 25(6):1146\u20131153","journal-title":"J Syst Manag"},{"issue":"2","key":"5794_CR22","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/s10479-015-1949-7","volume":"236","author":"B Sarasola","year":"2016","unstructured":"Sarasola B, Doerner KF, Schmid V et al (2016) Variable neighborhood search for the stochastic and dynamic vehicle routing problem. Ann Oper Res 236(2):425\u2013461","journal-title":"Ann Oper Res"},{"issue":"9","key":"5794_CR23","doi-asserted-by":"publisher","first-page":"1173","DOI":"10.1057\/palgrave.jors.2602635","volume":"60","author":"K Fagerholt","year":"2009","unstructured":"Fagerholt K, Foss BA, Horgen OJ (2009) A decision support model for establishing an air taxi service: a case study [J]. J Oper Res Soc 60(9):1173\u20131182","journal-title":"J Oper Res Soc"},{"issue":"5","key":"5794_CR24","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/j.tre.2005.01.003","volume":"42E","author":"HK Chen","year":"2006","unstructured":"Chen HK, Hsueh CF, Chang MS (2006) The real-time time-dependent vehicle routing problem[J]. Transp Res E Logs Transp Rev 42E(5):383\u2013408","journal-title":"Transp Res E Logs Transp Rev"},{"key":"5794_CR25","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2020.103582","volume":"91","author":"X Xiang","year":"2020","unstructured":"Xiang X, Qiu J, Xiao J, Zhang X (2020) Demand coverage diversity based ant colony optimization for dynamic vehicle routing problems. Eng Appl Artif Intell 91:103582","journal-title":"Eng Appl Artif Intell"},{"key":"5794_CR26","doi-asserted-by":"crossref","unstructured":"Liu Y, Khalifa IH, Kamel AE, (2016) The multi-period and multi-depot dynamic vehicle routing problem with time windows [C] \/\/ International Conference on Logistics Operations Management. IEEE","DOI":"10.1109\/GOL.2016.7731713"},{"issue":"005","key":"5794_CR27","first-page":"589","volume":"019","author":"Z Qin","year":"2010","unstructured":"Qin Z, Hui Li (2010) An improved genetic algorithm for vehicle routing problems with time windows [J]. Chin J Syst Manag 019(005):589\u2013592600","journal-title":"Chin J Syst Manag"},{"key":"5794_CR28","unstructured":"Bouziyane B, Dkhissi B, Cherkaoui M (2016)  A hybrid genetic algorithm for the static and dynamic Vehicle Routing Problem with Soft Time Windows. In: Third IEEE international conference on logistics operations management, IEEE Press, Fes, MOROCCO, MAY 23\u201325, 2016"},{"key":"5794_CR29","doi-asserted-by":"crossref","unstructured":"Messaoud E, Alaoui AE (2017) Hybrid ant colony system algorithm for the vehicle routing problem with dynamic customers and traffic factors. In: Intelligent systems and computer vision (ISCV), IEEE Press, Fez, MOROCCO, APR 17-19, 2017","DOI":"10.1109\/ISACV.2017.8054979"},{"key":"5794_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.asoc.2017.01.047","volume":"55","author":"AMF AbdAllah","year":"2017","unstructured":"AbdAllah AMF, Essam DL, Sarker RA (2017) On solving periodic re-optimization dynamic vehicle routing problems[J]. Appl Soft Comput 55:1\u201312","journal-title":"Appl Soft Comput"},{"key":"5794_CR31","first-page":"107","volume":"1","author":"F Houming","year":"2020","unstructured":"Houming F, Jiaxin W, Jing G et al (2020) Vehicle routing problem with fuzzy demand and time window and hybrid genetic algorithm [J]. J Syst Manag 1:107\u2013118","journal-title":"J Syst Manag"},{"key":"5794_CR32","doi-asserted-by":"crossref","unstructured":"Yulei Y, Jin Z (2019) \"Vehicle Routing Problem with Soft Time Windows Based on Dynamic Demands,\" 2019 4th International Conference on Intelligent Transportation Engineering (ICITE), Singapore, 2019, pp. 222\u2013226","DOI":"10.1109\/ICITE.2019.8880257"},{"key":"5794_CR33","doi-asserted-by":"crossref","unstructured":"Golpayegani F, Clarke S (2018) \"Co-Ride: Collaborative preference-based taxi-sharing and taxi-dispatch,\" 2018 IEEE 30th International Conference on Tools with Artificial Intelligence (ICTAI), Volos, pp. 864\u2013871","DOI":"10.1109\/ICTAI.2018.00135"},{"key":"5794_CR34","unstructured":"Wang F, Zhu Y, Wang F, Liu J, Ma X, Fan X \"Car4Pac: Last mile parcel delivery through intelligent car trip sharing,\" in IEEE Transactions on Intelligent Transportation Systems"},{"issue":"2","key":"5794_CR35","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1109\/MNET.2019.1800228","volume":"33","author":"F Wang","year":"2019","unstructured":"Wang F, Wang F, Ma X, Liu J (2019) Demystifying the crowd intelligence in last mile parcel delivery for smart cities. IEEE Netw 33(2):23\u201329","journal-title":"IEEE Netw"},{"key":"5794_CR36","unstructured":"Xijun Z, Qirui Z, Lijuan Z et al (2019) Research on taxi shared route planning based on improved genetic algorithm [J].Transportation system engineering and information, 06: 127\u2013132"},{"key":"5794_CR37","doi-asserted-by":"crossref","unstructured":"Huang H, Savkin AV, Huang C (2019) \"Optimal Control of a Hybrid UAV\/Train Parcel Delivery System,\" 2019 Chinese Control Conference (CCC), Guangzhou, China, pp. 6606-6609","DOI":"10.23919\/ChiCC.2019.8866511"},{"key":"5794_CR38","doi-asserted-by":"crossref","unstructured":"Huang H, Savkin AV, Huang C (2019) \"Control of a novel parcel delivery system consisting of a UAV and a Public Train,\" 2019 IEEE 17th International Conference on Industrial Informatics (INDIN), Helsinki, Finland, pp. 1047\u20131050","DOI":"10.1109\/INDIN41052.2019.8972296"},{"key":"5794_CR39","doi-asserted-by":"publisher","first-page":"137668","DOI":"10.1109\/ACCESS.2019.2942947","volume":"7","author":"H Zhu","year":"2019","unstructured":"Zhu H, Dou S, Qiu Y (2019) Joint model for last-mile delivery service selection in China: evidence from a cross-nested logit study. IEEE Access 7:137668\u2013137679","journal-title":"IEEE Access"},{"issue":"3","key":"5794_CR40","first-page":"479","volume":"24","author":"F Wang","year":"2020","unstructured":"Wang F, Li YX, Zhou AM, Tang K (2020) An estimation of distribution algorithm for mixed-variable newsvendor problems. IEEE Trans Evol Comput 24(3):479\u2013493","journal-title":"IEEE Trans Evol Comput"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-021-05794-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00521-021-05794-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-021-05794-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,8]],"date-time":"2021-07-08T07:22:19Z","timestamp":1625728939000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00521-021-05794-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,2,25]]},"references-count":40,"journal-issue":{"issue":"16","published-print":{"date-parts":[[2021,8]]}},"alternative-id":["5794"],"URL":"https:\/\/doi.org\/10.1007\/s00521-021-05794-1","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,2,25]]},"assertion":[{"value":"10 November 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 February 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 February 2021","order":3,"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":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of interest"}}]}}