{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T11:11:32Z","timestamp":1778325092854,"version":"3.51.4"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T00:00:00Z","timestamp":1557705600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T00:00:00Z","timestamp":1557705600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["71471062"],"award-info":[{"award-number":["71471062"]}],"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":["71431004"],"award-info":[{"award-number":["71431004"]}],"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":["71632008"],"award-info":[{"award-number":["71632008"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"National Social Science Foundation of China","award":["16ZDA083"],"award-info":[{"award-number":["16ZDA083"]}]},{"name":"the Ministry of Education Humanities and Social Science Research Planning Fund Project","award":["18YJAZH046"],"award-info":[{"award-number":["18YJAZH046"]}]},{"DOI":"10.13039\/100007219","name":"Natural Science Foundation of Shanghai","doi-asserted-by":"publisher","award":["18ZR1409400"],"award-info":[{"award-number":["18ZR1409400"]}],"id":[{"id":"10.13039\/100007219","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2020,2]]},"DOI":"10.1007\/s00500-019-04053-9","type":"journal-article","created":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T01:31:26Z","timestamp":1557797486000},"page":"2201-2213","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["Peer-induced fairness capacitated vehicle routing scheduling using a hybrid optimization ACO\u2013VNS algorithm"],"prefix":"10.1007","volume":"24","author":[{"given":"Yifan","family":"Wu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fan","family":"Pan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0075-5457","authenticated-orcid":false,"given":"Shuxia","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhen","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ming","family":"Dong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,5,13]]},"reference":[{"issue":"2","key":"4053_CR1","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1080\/15472450802023329","volume":"12","author":"B Balcik","year":"2008","unstructured":"Balcik B, Beamon BM, Smilowitz K (2008) Last mile distribution in humanitarian relief. J Intell Transp Syst 12(2):51\u201363","journal-title":"J Intell Transp Syst"},{"issue":"1","key":"4053_CR2","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1057\/palgrave.jors.2601652","volume":"55","author":"G Barbarosoglu","year":"2004","unstructured":"Barbarosoglu G, Arda Y (2004) A two-stage stochastic programming framework for transportation planning in disaster response. J Oper Res Soc 55(1):43\u201353","journal-title":"J Oper Res Soc"},{"issue":"1","key":"4053_CR3","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1016\/S0377-2217(01)00222-3","volume":"140","author":"G Barbarosoglu","year":"2002","unstructured":"Barbarosoglu G, Ozdamar L, Cevik A (2002) An interactive approach for hierarchical analysis of helicopter logistics in disaster relief operations. Eur J Oper Res 140(1):118\u2013133","journal-title":"Eur J Oper Res"},{"issue":"1","key":"4053_CR4","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/s11134-006-7587-7","volume":"53","author":"T Bonald","year":"2006","unstructured":"Bonald T, Massouli\u00e9 L, Prouti\u00e8re A, Virtamo J (2006) A queueing analysis of max-min fairness, proportional fairness and balanced fairness. Queueing Syst 53(1):65\u201384","journal-title":"Queueing Syst"},{"issue":"1","key":"4053_CR500","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1287\/trsc.1030.0057","volume":"39","author":"I Br\u00e4ysy","year":"2005","unstructured":"Br\u00e4ysy I, Gendreau M (2005) Vehicle routing problem with time windows, part II: metaheuristics. Transp Sci 39(1):119\u2013139","journal-title":"Transp Sci"},{"issue":"5","key":"4053_CR5","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/s10732-007-9046-y","volume":"14","author":"J Brimberg","year":"2008","unstructured":"Brimberg J, Mladenovic N, Urosevic D (2008) Local and variable neighborhood search for the k-cardinality subgraph problem. J Heuristics 14(5):501\u2013517","journal-title":"J Heuristics"},{"issue":"9","key":"4053_CR501","doi-asserted-by":"publisher","first-page":"2439","DOI":"10.1007\/s00500-016-2406-5","volume":"21","author":"F Carrabs","year":"2017","unstructured":"Carrabs F, Cerulli R, Sciomachen A (2017) An exact approach for the grocery delivery problem in urban areas. Soft Comput 21(9):2439\u20132450","journal-title":"Soft Comput"},{"issue":"4","key":"4053_CR6","first-page":"429","volume":"33","author":"YP Chan","year":"1999","unstructured":"Chan YP (1999) Facility location: a survey of applications and methods. Transp Sci 33(4):429\u2013430","journal-title":"Transp Sci"},{"key":"4053_CR7","volume-title":"SIAM monographs on discrete mathematics and applications","author":"JF Cordeau","year":"2002","unstructured":"Cordeau JF, Desaulniers G, Desrosiers J et al (2002) The vehicle routing problem. In: Toth P, Vigo D (eds) SIAM monographs on discrete mathematics and applications, vol 9. Society for Industrial and Applied Mathematics, Philidelphia"},{"key":"4053_CR8","unstructured":"Dorigo M (1992) Optimization, learning and natural algorithms, Ph.D. Thesis, Dipartimento diElettronica, Politecnico di Milano, Italy (in Italian)"},{"issue":"3","key":"4053_CR9","doi-asserted-by":"publisher","first-page":"1265","DOI":"10.1016\/j.ejor.2006.06.052","volume":"185","author":"M Drazic","year":"2008","unstructured":"Drazic M, Lavor C, Maculan N, Mladenovic N (2008) A continuous variable neighborhood search heuristic for finding the three-dimensional structure of a molecule. Eur J Oper Res 185(3):1265\u20131273","journal-title":"Eur J Oper Res"},{"issue":"4","key":"4053_CR10","doi-asserted-by":"publisher","first-page":"1472","DOI":"10.1016\/j.cie.2009.05.009","volume":"57","author":"B Eksioglu","year":"2009","unstructured":"Eksioglu B, Vural AV, Reisman A (2009) The vehicle routing problem: A taxonomic review. Comput Ind Eng 57(4):1472\u20131483","journal-title":"Comput Ind Eng"},{"issue":"1","key":"4053_CR11","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/S0377-2217(96)00085-9","volume":"97","author":"L Equi","year":"1997","unstructured":"Equi L, Gallo G, Marziale S, Weintraub A (1997) A combined transportation and scheduling problem. Eur J Oper Res 97(1):94\u2013104","journal-title":"Eur J Oper Res"},{"issue":"1\u20133","key":"4053_CR12","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/S0925-7535(00)00021-7","volume":"35","author":"F Fiedrich","year":"2000","unstructured":"Fiedrich F, Gehbauer F, Rickers U (2000) Optimized resource allocation for emergency response after earthquake disasters. Saf Sci 35(1\u20133):41\u201357","journal-title":"Saf Sci"},{"key":"4053_CR13","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/s10732-005-1997-2","volume":"11","author":"B Funke","year":"2005","unstructured":"Funke B, Grunert T, Irnich S (2005) Local search for vehicle routing and scheduling problems: review and conceptual integration. J Heuristics 11:267\u2013306","journal-title":"J Heuristics"},{"issue":"9","key":"4053_CR14","doi-asserted-by":"publisher","first-page":"2892","DOI":"10.1016\/j.cor.2007.01.001","volume":"35","author":"J Gao","year":"2008","unstructured":"Gao J, Sun LY, Gen MS (2008) A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems. Comput Oper Res 35(9):2892\u20132907","journal-title":"Comput Oper Res"},{"issue":"12","key":"4053_CR15","doi-asserted-by":"publisher","first-page":"3549","DOI":"10.1016\/j.cor.2005.03.032","volume":"33","author":"CG Garcia","year":"2006","unstructured":"Garcia CG, Perez-Brito D, Campos V, Marti R (2006) Variable neighborhood search for the linear ordering problem. Comput Oper Res 33(12):3549\u20133565","journal-title":"Comput Oper Res"},{"issue":"1","key":"4053_CR16","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1243\/09544054JEM560","volume":"221","author":"AF Guneri","year":"2007","unstructured":"Guneri AF (2007) Physical distribution activities and vehicle routing problems in logistics management: a case study. Proc Inst Mech Eng Part B J Eng Manuf 221(1):123\u2013133","journal-title":"Proc Inst Mech Eng Part B J Eng Manuf"},{"issue":"3","key":"4053_CR17","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0965-8564(95)00020-8","volume":"30A","author":"A Haghani","year":"1996","unstructured":"Haghani A, Oh S (1996) Formulation and solution of a multi-commodity, multi-modal network flow model for disaster relief operations. Transp Res Part A (Policy and Practice) 30A(3):231\u2013250","journal-title":"Transp Res Part A (Policy and Practice)"},{"issue":"1","key":"4053_CR18","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s10951-009-0127-7","volume":"14","author":"JW Herrmann","year":"2011","unstructured":"Herrmann JW (2011) Using aggregation to reduce response time variability in cyclic fair sequences. J Sched 14(1):39\u201355","journal-title":"J Sched"},{"issue":"3","key":"4053_CR19","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1080\/0740817X.2011.602660","volume":"44","author":"JW Herrmann","year":"2012","unstructured":"Herrmann JW (2012) Finding optimally balanced words for production planning and maintenance scheduling. IIE Trans 44(3):215\u2013229","journal-title":"IIE Trans"},{"issue":"5","key":"4053_CR20","doi-asserted-by":"publisher","first-page":"2022","DOI":"10.1257\/aer.99.5.2022","volume":"99","author":"TH Ho","year":"2009","unstructured":"Ho TH, Su X (2009) Peer-induced fairness in games. Am Econ Rev 99(5):2022\u20132049","journal-title":"Am Econ Rev"},{"issue":"5","key":"4053_CR21","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/s10732-007-9047-x","volume":"14","author":"B Hu","year":"2008","unstructured":"Hu B, Leitner M, Raidl GR (2008) Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem. J Heuristics 14(5):473\u2013499","journal-title":"J Heuristics"},{"key":"4053_CR22","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.tre.2011.05.004","volume":"48","author":"M Huang","year":"2012","unstructured":"Huang M, Smilowitz K, Balcik B (2012) Models for relief routing: equity, efficiency and efficacy. Transp Res Part E 48:2\u201318","journal-title":"Transp Res Part E"},{"key":"4053_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tre.2014.11.007","volume":"75","author":"K Huang","year":"2015","unstructured":"Huang K, Jiang Y, Yuan Y, Zhao L (2015) Modeling multiple humanitarian objectives in emergency response to large-scale disasters. Transp Res Part E 75:1\u201317","journal-title":"Transp Res Part E"},{"issue":"4","key":"4053_CR24","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1111\/itor.12101","volume":"22","author":"AA Juan","year":"2015","unstructured":"Juan AA, Pascual I, Guimarans D, Barrios B (2015) Combining biased randomization with iterated local search for solving the multidepot vehicle routing problem. Int Trans Oper Res 22(4):647\u2013667","journal-title":"Int Trans Oper Res"},{"issue":"2","key":"4053_CR25","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1016\/j.cor.2012.08.020","volume":"40","author":"L Ke","year":"2013","unstructured":"Ke L, Feng Z (2013) A two-phase metaheuristic for the cumulative capacitated vehicle routing problem. Comput Oper Res 40(2):633\u2013638","journal-title":"Comput Oper Res"},{"issue":"6","key":"4053_CR26","doi-asserted-by":"publisher","first-page":"1055","DOI":"10.1016\/j.cor.2009.09.010","volume":"37","author":"J Lazic","year":"2010","unstructured":"Lazic J, Hanafi S, Mladenovic N, Urosevic D (2010) Variable neighbourhood decomposition search for 0-1 mixed integer programs. Comput Oper Res 37(6):1055\u20131067","journal-title":"Comput Oper Res"},{"issue":"4","key":"4053_CR27","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0167-6377(91)90057-V","volume":"10","author":"H Luss","year":"1991","unstructured":"Luss H (1991) A nonlinear minimax allocation problem with multiple knapsack constraints. Oper Res Lett 10(4):183\u2013187","journal-title":"Oper Res Lett"},{"issue":"4","key":"4053_CR28","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1287\/mnsc.37.4.467","volume":"37","author":"MB Mandell","year":"1991","unstructured":"Mandell MB (1991) Modelling effectiveness-equity trade-offs in public service delivery systems. Manag Sci 37(4):467\u2013482","journal-title":"Manag Sci"},{"key":"4053_CR29","doi-asserted-by":"publisher","first-page":"965","DOI":"10.1111\/poms.12101","volume":"23","author":"JH McCoy","year":"2014","unstructured":"McCoy JH, Lee HL (2014) Using fairness models to improve equity in health delivery fleet management. Prod Oper Manag 23:965\u2013977","journal-title":"Prod Oper Manag"},{"issue":"11","key":"4053_CR30","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovic","year":"1997","unstructured":"Mladenovic N, Hansen P (1997) Variable neighborhood search. Comput Oper Res 24(11):1097\u20131100","journal-title":"Comput Oper Res"},{"issue":"3","key":"4053_CR31","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1016\/j.ejor.2006.12.064","volume":"191","author":"N Mladenovic","year":"2008","unstructured":"Mladenovic N, Drazic M, Kovacevic-Vujcic V, Cangalovic M (2008) General variable neighborhood search for the continuous optimization. Eur J Oper Res 191(3):753\u2013770","journal-title":"Eur J Oper Res"},{"issue":"11","key":"4053_CR32","doi-asserted-by":"publisher","first-page":"1877","DOI":"10.1016\/j.cor.2009.06.014","volume":"37","author":"SU Ngueveu","year":"2010","unstructured":"Ngueveu SU, Prins C, Wolfler-Calvo R (2010) An effective memetic algorithm for the cumulative capacitated vehicle routing problem. Comput Oper Res 37(11):1877\u20131885","journal-title":"Comput Oper Res"},{"key":"4053_CR33","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1016\/j.tre.2011.11.003","volume":"48","author":"L \u00d6zdamar","year":"2012","unstructured":"\u00d6zdamar L, Demir O (2012) A hierarchical clustering and routing procedure for large scale disaster relief logistics planning. Transp Res Part E 48:591\u2013602","journal-title":"Transp Res Part E"},{"key":"4053_CR34","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, Medaglia AL (2013) A review of dynamic vehicle routing problems. Eur J Oper Res 225:1\u201311","journal-title":"Eur J Oper Res"},{"issue":"5","key":"4053_CR35","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/s10732-007-9050-2","volume":"14","author":"M Polacek","year":"2008","unstructured":"Polacek M, Doerner KF, Hartl RF, Maniezzo V (2008) A variable neighborhood search for the capacitated arc routing problem with intermediate facilities. J Heuristics 14(5):405\u2013423","journal-title":"J Heuristics"},{"issue":"4","key":"4053_CR36","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1287\/ijoc.1080.0312","volume":"21","author":"J Potvin","year":"2009","unstructured":"Potvin J (2009) State-of-the art review-evolutionary algorithms for vehicle routing. INFORMS J Comput 21(4):518\u2013548","journal-title":"INFORMS J Comput"},{"issue":"2\u20133","key":"4053_CR37","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/s10107-002-0323-0","volume":"94","author":"TK Ralphs","year":"2003","unstructured":"Ralphs TK, Kopman L, Pulleyblank WR, Trotter LE (2003) On the capacitated vehicle routing problem. Math Program 94(2\u20133):343\u2013359","journal-title":"Math Program"},{"key":"4053_CR38","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1016\/j.tre.2013.12.006","volume":"62","author":"SJ Rennemo","year":"2014","unstructured":"Rennemo SJ, R\u00f8 KF, Hvattum LM, Tirado G (2014) A three-stage stochastic facility routing model for disaster response planning. Transp Res Part E 62:116\u2013135","journal-title":"Transp Res Part E"},{"issue":"3","key":"4053_CR39","doi-asserted-by":"publisher","first-page":"728","DOI":"10.1016\/j.cor.2011.05.005","volume":"39","author":"G Ribeiro","year":"2012","unstructured":"Ribeiro G, Laporte G (2012) An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem. Comput Oper Res 39(3):728\u2013735","journal-title":"Comput Oper Res"},{"issue":"1","key":"4053_CR600","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/j.ejor.2018.07.039","volume":"273","author":"M Salavati-Khoshghalb","year":"2019","unstructured":"Salavati-Khoshghalb M, Gendreau M, Jabali O, Rei W (2019) An exact algorithm to solve the vehicle routing problem with stochastic demands under an optimal restocking policy. Eur J Oper Res 273(1):175\u2013189","journal-title":"Eur J Oper Res"},{"issue":"2","key":"4053_CR40","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1287\/ijoc.4.2.146","volume":"4","author":"MWP Savelsbergh","year":"1992","unstructured":"Savelsbergh MWP (1992) The vehicle routing problem with time windows: minimizing route duration. ORSA J Comput 4(2):146\u2013154","journal-title":"ORSA J Comput"},{"key":"4053_CR41","volume-title":"Vehicle routing: problems, methods, and applications","year":"2015","unstructured":"Toth P, Vigo D (eds) (2015) Vehicle routing: problems, methods, and applications. Society for Industrial and Applied Mathematics, Pennsylvania"},{"key":"4053_CR42","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1016\/j.tre.2006.10.012","volume":"43","author":"G Tzeng","year":"2007","unstructured":"Tzeng G, Cheng H, Huang T (2007) Multi-objective optimal planning for designing relief delivery systems. Transp Res Part E 43:673\u2013686","journal-title":"Transp Res Part E"},{"key":"4053_CR43","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2013.02.053","volume":"231","author":"T Vidal","year":"2013","unstructured":"Vidal T, Crainic TG, Gendreau M, Prins C (2013) Heuristics for multi-attribute vehicle routing problems: A survey and synthesis. Eur J Oper Res 231:1\u201321","journal-title":"Eur J Oper Res"},{"issue":"4","key":"4053_CR44","doi-asserted-by":"publisher","first-page":"562","DOI":"10.1080\/0305215X.2013.791813","volume":"46","author":"Y Xiao","year":"2014","unstructured":"Xiao Y, Zhao Q, Kaku I, Mladenovic N (2014) Variable neighbourhood simulated annealing algorithm for capacitated vehicle routing problems. Eng Optim 46(4):562\u2013579","journal-title":"Eng Optim"},{"key":"4053_CR45","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.ssci.2012.12.003","volume":"54","author":"X Zhang","year":"2013","unstructured":"Zhang X, Zhang Z, Zhang Y, Wei D, Deng Y (2013) Route selection for emergency logistics management: a bio-inspired algorithm. Saf Sci 54:87\u201391","journal-title":"Saf Sci"},{"key":"4053_CR46","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1016\/j.asoc.2014.09.041","volume":"27","author":"Y Zheng","year":"2015","unstructured":"Zheng Y, Chen S, Ling H (2015) Evolutionary optimization for disaster relief operations: A survey. Appl Soft Comput 27:553\u2013566","journal-title":"Appl Soft Comput"},{"key":"4053_CR47","doi-asserted-by":"publisher","first-page":"4667","DOI":"10.1016\/j.asoc.2011.07.016","volume":"11","author":"Q Zhu","year":"2011","unstructured":"Zhu Q, Hu J, Cai W, Henschen L (2011) A new robot navigation algorithm for dynamic unknown environments based on dynamic path re-computation and an improved scout ant algorithm. Appl Soft Comput 11:4667\u20134676","journal-title":"Appl Soft Comput"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-019-04053-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-019-04053-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-019-04053-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,11]],"date-time":"2020-05-11T23:07:53Z","timestamp":1589238473000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-019-04053-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5,13]]},"references-count":50,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,2]]}},"alternative-id":["4053"],"URL":"https:\/\/doi.org\/10.1007\/s00500-019-04053-9","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,5,13]]},"assertion":[{"value":"13 May 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":"Author Yifan Wu declares that he has no conflict of interest. Author Fan Pan declares that he has no conflict of interest. Author Shuxia Li declares that she has no conflict of interest. Author Zhen Chen declares that he has no conflict of interest. Author Ming Dong declares that he has 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 or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}