{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,18]],"date-time":"2025-10-18T21:02:25Z","timestamp":1760821345770,"version":"3.37.3"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2022,7,30]],"date-time":"2022-07-30T00:00:00Z","timestamp":1659139200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,7,30]],"date-time":"2022-07-30T00:00:00Z","timestamp":1659139200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["No. 61672122","No. 61602077"],"award-info":[{"award-number":["No. 61672122","No. 61602077"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["NO.61906027"],"award-info":[{"award-number":["NO.61906027"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2022,10]]},"DOI":"10.1007\/s10115-022-01722-4","type":"journal-article","created":{"date-parts":[[2022,7,30]],"date-time":"2022-07-30T07:02:45Z","timestamp":1659164565000},"page":"2713-2736","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A multi-objective optimization approach to package delivery by the crowd of occupied taxis"],"prefix":"10.1007","volume":"64","author":[{"given":"Zhifeng","family":"Zhou","sequence":"first","affiliation":[]},{"given":"Rong","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Jian","family":"Gao","sequence":"additional","affiliation":[]},{"given":"Hu","family":"Xing","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,7,30]]},"reference":[{"issue":"3","key":"1722_CR1","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1007\/s10696-016-9273-3","volume":"30","author":"W Chen","year":"2018","unstructured":"Chen W, Mes M, Schutten M (2018) Multi-hop driver-parcel matching problem with time windows. Flex Serv Manuf J 30(3):517\u2013553","journal-title":"Flex Serv Manuf J"},{"key":"1722_CR2","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.cor.2016.01.018","volume":"72","author":"V Ghilas","year":"2016","unstructured":"Ghilas V, Demir E, Van Woensel T (2016) An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows and scheduled lines. Comput Oper Res 72:12\u201330","journal-title":"Comput Oper Res"},{"issue":"3","key":"1722_CR3","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1016\/j.ejor.2013.10.038","volume":"235","author":"A Rais","year":"2014","unstructured":"Rais A, Alvelos F, Carvalho MS (2014) New mixed integer-programming model for the pickup-and-delivery problem with transshipment. Eur J Oper Res 235(3):530\u2013539","journal-title":"Eur J Oper Res"},{"issue":"1","key":"1722_CR4","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1287\/trsc.2017.0803","volume":"53","author":"A Arslan","year":"2019","unstructured":"Arslan A, Agatz N, Kroon L et al (2019) Crowdsourced delivery: a dynamic pickup and delivery problem with ad hoc drivers. Transp Sci 53(1):67\u201399","journal-title":"Transp Sci"},{"issue":"7","key":"1722_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/00207543.2016.1173258","volume":"55","author":"C Chen","year":"2017","unstructured":"Chen C, Pan S, Wang Z et al (2017) Using taxis to collect city wide e-commerce reverse flows: a crowdsourcing solution. Int J Prod Res 55(7):1\u201312","journal-title":"Int J Prod Res"},{"issue":"6","key":"1722_CR6","first-page":"1478","volume":"18","author":"C Chen","year":"2017","unstructured":"Chen C, Zhang D, Ma X et al (2017) CrowdDeliver: planning city-wide package delivery paths leveraging the crowds of taxis. IEEE Trans Intell Transp Syst 18(6):1478\u20131496","journal-title":"IEEE Trans Intell Transp Syst"},{"issue":"2","key":"1722_CR7","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1109\/TEVC.2008.925798","volume":"13","author":"H Li","year":"2009","unstructured":"Li H, Zhang Q (2009) Multi-objective optimization problems with complicated pareto sets, MOEA\/D and NSGA-II. IEEE Trans Evol Comput 13(2):284\u2013302","journal-title":"IEEE Trans Evol Comput"},{"issue":"2","key":"1722_CR8","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb K, Pratap A, Agarwal S et al (2002) A fast and elitist multi-objective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6(2):182\u2013197","journal-title":"IEEE Trans Evol Comput"},{"key":"1722_CR9","doi-asserted-by":"crossref","unstructured":"Mokbel M, Alarabi L, Bao J, et al (2014) A demonstration of MNTG\u2014a web-based road network traffic generator. In: IEEE international conference on data engineering, pp\u00a01246\u20131249","DOI":"10.1109\/ICDE.2014.6816752"},{"key":"1722_CR10","unstructured":"McInerney J, Rogers A, Jennings N (2014) Crowdsourcing physical package delivery using the existing routine mobility of a local population. In: D4D challenge, Boston, pp\u00a0447\u2013456"},{"key":"1722_CR11","unstructured":"Sadilek A, Krumm J, Horvitz E (2013) Crowdphysics: planned and opportunistic crowdsourcing for physical tasks. In: ICWSM, pp\u00a0536\u2013545"},{"key":"1722_CR12","doi-asserted-by":"crossref","unstructured":"Xu Y, Tong Y, Shi Y, et al (2019) An efficient insertion operator in dynamic ridesharing services. In: The 35th international conference on data engineering (ICDE), Macau, pp\u00a01022\u20131033","DOI":"10.1109\/ICDE.2019.00095"},{"key":"1722_CR13","doi-asserted-by":"crossref","unstructured":"Wang J, Ren W, Zhang Z, et al (2018) A hybrid multiobjective memetic algorithm for multiobjective periodic vehicle routing problem with time windows. IEEE Trans Syst Man Cybern 50(11):4732\u20134745","DOI":"10.1109\/TSMC.2018.2861879"},{"key":"1722_CR14","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/j.trb.2016.12.022","volume":"99","author":"N Kafle","year":"2017","unstructured":"Kafle N, Zou B, Lin J (2017) Design and modeling of a crowdsource enabled system for urban parcel relay and delivery. Transp Res Part B Methodol 99:62\u201382","journal-title":"Transp Res Part B Methodol"},{"issue":"6","key":"1722_CR15","doi-asserted-by":"publisher","first-page":"1288","DOI":"10.1109\/TMC.2018.2861864","volume":"18","author":"Y Liu","year":"2019","unstructured":"Liu Y, Guo B, Chen C et al (2019) FooDNet: Toward an optimized food delivery network based on spatial crowdsourcing. IEEE Trans Mob Comput 18(6):1288\u20131301","journal-title":"IEEE Trans Mob Comput"},{"key":"1722_CR16","unstructured":"Chen C, Zhang D, Wang L, et al (2014) TaxiExp: a novel framework for city-wide package express shipping via taxi crowd sourcing. In: IEEE international conference on scalable computing and communications and ITS associated workshops, pp\u00a0244\u2013251"},{"issue":"2","key":"1722_CR17","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1016\/j.ejor.2016.02.040","volume":"253","author":"T Crainic","year":"2016","unstructured":"Crainic T, Gobbato L, Perboli G et al (2016) Logistics capacity planning: a stochastic bin packing formulation and a progressive hedging metaheuristic. Eur J Oper Res 253(2):404\u2013417","journal-title":"Eur J Oper Res"},{"issue":"3","key":"1722_CR18","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1023\/A:1015053600842","volume":"8","author":"H Gehring","year":"2002","unstructured":"Gehring H, Homberger J (2002) Parallelization of a two-phase metaheuristic for routing problems with time windows. J. Heuristics 8(3):251\u2013276","journal-title":"J. Heuristics"},{"issue":"4","key":"1722_CR19","doi-asserted-by":"publisher","first-page":"1096","DOI":"10.1016\/j.asoc.2010.04.001","volume":"10","author":"K Ghoseiri","year":"2006","unstructured":"Ghoseiri K, Ghannadpour SF (2006) Multi-objective vehicle routing problem with time windows using goal programming and genetic algorithm. Appl Soft Comput 10(4):1096\u20131107","journal-title":"Appl Soft Comput"},{"issue":"3","key":"1722_CR20","doi-asserted-by":"publisher","first-page":"1100","DOI":"10.1109\/JSYST.2014.2300201","volume":"9","author":"Y Zhou","year":"2015","unstructured":"Zhou Y, Wang J (2015) A local search-based multiobjective optimization algorithm for multiobjective vehicle routing problem with time windows. IEEE Syst J 9(3):1100\u20131113","journal-title":"IEEE Syst J"},{"issue":"4","key":"1722_CR21","doi-asserted-by":"publisher","first-page":"742","DOI":"10.2507\/IJSIMM15(4)CO19","volume":"15","author":"DQ Wu","year":"2016","unstructured":"Wu DQ, Dong M, Li HY et al (2016) Vehicle routing problem with time windows using multi-objective co-evolutionary approach. Int J Simul Model 15(4):742\u2013753","journal-title":"Int J Simul Model"},{"key":"1722_CR22","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1016\/j.ins.2015.04.001","volume":"316","author":"J Luo","year":"2015","unstructured":"Luo J, Li X, Chen MR et al (2015) A novel hybrid shuffied frog leaping algorithm for vehicle routing problem with time windows. Inf Sci 316:266\u2013292","journal-title":"Inf Sci"},{"key":"1722_CR23","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1016\/j.cie.2017.09.034","volume":"113","author":"YE Taha","year":"2017","unstructured":"Taha YE, Ayob M, Zakree Ahmad Nazri M et al (2017) An adaptive hybrid algorithm for vehicle routing problems with time windows. Comput Ind Eng 113:382\u2013391","journal-title":"Comput Ind Eng"},{"key":"1722_CR24","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1016\/j.swevo.2017.11.001","volume":"39","author":"W Dong","year":"2018","unstructured":"Dong W, Zhou K, Qi H et al (2018) A tissue p system based evolutionary algorithm for multi-objective vrptw. Swarm Evol Comput 39:310\u2013322","journal-title":"Swarm Evol Comput"},{"issue":"3","key":"1722_CR25","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1016\/j.ejor.2013.04.044","volume":"230","author":"R Liu","year":"2013","unstructured":"Liu R, Xie X, Augusto V et al (2013) Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care. Eur J Oper Res 230(3):475\u2013486","journal-title":"Eur J Oper Res"},{"issue":"1","key":"1722_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.swevo.2017.06.002","volume":"38","author":"B Qu","year":"2018","unstructured":"Qu B, Zhu Y, Jiao YC et al (2018) A survey on multi-objective evolutionary algorithms for the solution of the environmental\/economic dispatch problems. Swarm Evol Comput 38(1):1\u201311","journal-title":"Swarm Evol Comput"},{"issue":"12","key":"1722_CR27","doi-asserted-by":"publisher","first-page":"2406","DOI":"10.1109\/TFUZZ.2019.2899809","volume":"27","author":"R Chen","year":"2019","unstructured":"Chen R, Guo S, Wang X et al (2019) Fusion of multi-RSMOTE with fuzzy integral to classify bug reports with an imbalanced severity distribution. IEEE Trans Fuzzy Syst 27(12):2406\u20132420","journal-title":"IEEE Trans Fuzzy Syst"},{"issue":"3","key":"1722_CR28","first-page":"582","volume":"46","author":"J Wang","year":"2016","unstructured":"Wang J, Zhou Y, Wang Y et al (2016) Multiobjective vehicle routing problems with simultaneous delivery and pickup and time windows: formulation, instances, and algorithms. IEEE Trans Syst Man Cybern 46(3):582\u2013594","journal-title":"IEEE Trans Syst Man Cybern"},{"key":"1722_CR29","unstructured":"Pohl I (2014) Bi-directional search. IBM TJ Watson Research Center 1970"},{"key":"1722_CR30","doi-asserted-by":"crossref","unstructured":"Wu L, Xiao X, Deng D, et al (2012) Shortest path and distance queries on road networks: an experimental evaluation. In: PVLDB, pp 406\u2013417","DOI":"10.14778\/2140436.2140438"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-022-01722-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10115-022-01722-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-022-01722-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,12]],"date-time":"2022-09-12T03:16:28Z","timestamp":1662952588000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10115-022-01722-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,30]]},"references-count":30,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2022,10]]}},"alternative-id":["1722"],"URL":"https:\/\/doi.org\/10.1007\/s10115-022-01722-4","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"type":"print","value":"0219-1377"},{"type":"electronic","value":"0219-3116"}],"subject":[],"published":{"date-parts":[[2022,7,30]]},"assertion":[{"value":"28 November 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 June 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 July 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 July 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}