{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:40:57Z","timestamp":1761896457964},"reference-count":55,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,1,9]],"date-time":"2017-01-09T00:00:00Z","timestamp":1483920000000},"content-version":"unspecified","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":[[2018,6]]},"DOI":"10.1007\/s11047-016-9606-x","type":"journal-article","created":{"date-parts":[[2017,1,9]],"date-time":"2017-01-09T09:53:43Z","timestamp":1483955623000},"page":"375-391","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Memetic algorithm based on extension step and statistical filtering for large-scale capacitated arc routing problems"],"prefix":"10.1007","volume":"17","author":[{"given":"Ronghua","family":"Shang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bingqi","family":"Du","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kaiyun","family":"Dai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Licheng","family":"Jiao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu","family":"Xue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,1,9]]},"reference":[{"key":"9606_CR1","unstructured":"Ahr D (2004) Contributions to multiple postmen problems. PHD thesis, Rupercht -Karls-Universitat, Heidelberg"},{"key":"9606_CR2","doi-asserted-by":"crossref","first-page":"4655","DOI":"10.1016\/j.asoc.2011.07.017","volume":"11","author":"P Arpaia","year":"2011","unstructured":"Arpaia P, Maisto D, Manna C (2011) A quantum-inspired evolutionary algorithm with a competitive variation operator for multiple-fault diagnosis. Appl Soft Comput 11:4655\u20134666","journal-title":"Appl Soft Comput"},{"key":"9606_CR3","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1002\/net.20091","volume":"47","author":"R Baldacci","year":"2006","unstructured":"Baldacci R, Maniezzo V (2006) Exact methods based on node routing formulations for arc routing problems. Networks 47:52\u201360","journal-title":"Networks"},{"issue":"12","key":"9606_CR4","doi-asserted-by":"crossref","first-page":"1599","DOI":"10.1057\/palgrave.jors.2602305","volume":"58","author":"T Bektas","year":"2007","unstructured":"Bektas T, Elmastas S (2007) Solving school bus routing problems through integer programming. J Oper Res Soc 58(12):1599\u20131604","journal-title":"J Oper Res Soc"},{"issue":"5","key":"9606_CR5","doi-asserted-by":"crossref","first-page":"705","DOI":"10.1016\/S0305-0548(02)00046-1","volume":"30","author":"JM Belenguer","year":"2003","unstructured":"Belenguer JM, Benavent E (2003) A cutting plane algorithm for the capacitated arc routing problem. Comput Oper Res 30(5):705\u2013728","journal-title":"Comput Oper Res"},{"issue":"1\u20133","key":"9606_CR6","first-page":"107","volume":"14","author":"E Benavent","year":"1990","unstructured":"Benavent E, Campos V, Corberan A, Mota E (1990) The capacitated arc routing problem. a heuristic algorithm. Qiiestiio 14(1\u20133):107\u2013122","journal-title":"Qiiestiio"},{"key":"9606_CR7","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1002\/net.3230220706","volume":"22","author":"E Benavent","year":"1992","unstructured":"Benavent E, Campos V, Corberan A, Mota E (1992) The capacitated arc routing problem: lower bounds. Networks 22:669\u2013690","journal-title":"Networks"},{"issue":"3","key":"9606_CR8","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1016\/S0377-2217(02)00334-X","volume":"147","author":"P Beullens","year":"2003","unstructured":"Beullens P, Muyldermans L, Cattrysse D, Oudheusden DV (2003) A guided local search heuristic for the capacitated arc routing problem. Eur J Oper Res 147(3):629\u2013643","journal-title":"Eur J Oper Res"},{"issue":"2","key":"9606_CR9","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/s11047-008-9098-4","volume":"8","author":"L Bianchi","year":"2009","unstructured":"Bianchi L, Dorigo M, Gambardella LM, Gutjahr WJ (2009) A survey on metaheuristics for stochastic combinatorial optimization. Nat Comput 8(2):239\u2013287","journal-title":"Nat Comput"},{"issue":"4","key":"9606_CR10","first-page":"112","volume":"35","author":"J Brand\u02dcao","year":"2008","unstructured":"Brand\u02dcao J, Eglese R (2008) A deterministic tabu search algorithm for the capacitated arc routing problem. Comput Oper Res 35(4):112\u20131126","journal-title":"Comput Oper Res"},{"key":"9606_CR11","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/978-1-4615-4495-1_10","volume-title":"Roadway snow and ice control. Arc routing: theory, solutions and applications","author":"JF Campbell","year":"2000","unstructured":"Campbell JF, Langevin A (2000) Roadway snow and ice control. Arc routing: theory, solutions and applications. Kluwer, Boston, pp 389\u2013418"},{"key":"9606_CR12","first-page":"420","volume":"3172","author":"KF Doerner","year":"2004","unstructured":"Doerner KF, Hartl RF, Maniezzo V, Reimann M (2004) Applying ant colony optimization to the capacitated arc routing problem. Soft Comput 3172:420\u2013421","journal-title":"Soft Comput"},{"key":"9606_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-88051-6","volume-title":"Multi-objective memetic algorithms","author":"CK Goh","year":"2009","unstructured":"Goh CK, Ong YS, Tan KC (2009) Multi-objective memetic algorithms. Springer, Berlin"},{"issue":"3","key":"9606_CR14","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1002\/net.3230110308","volume":"11","author":"BL Golden","year":"1981","unstructured":"Golden BL, Wong RT (1981) Capacitated arc routing problems. Networks 11(3):305\u2013316","journal-title":"Networks"},{"issue":"1","key":"9606_CR15","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0305-0548(83)90026-6","volume":"10","author":"BL Golden","year":"1983","unstructured":"Golden BL, DeArmon JS, Baker EK (1983) Computational experiments with algorithms for a class of routing Problems. Comput Oper Res 10(1):47\u201359","journal-title":"Comput Oper Res"},{"key":"9606_CR16","doi-asserted-by":"crossref","unstructured":"Grover LK (1996) A fast quantum mechanical algorithm for database search. In: Proceeding of the 28th acm symposium on theory of computing, pp. 212\u2013219","DOI":"10.1145\/237814.237866"},{"key":"9606_CR17","unstructured":"Handa H, Chapman L, Yao X (2006) Robust salting route optimization using evolutionary algorithms. In: Proceedings of the 2006 IEEE congress on evolutionay computation, vol. 1, pp. 10455\u201310456"},{"issue":"1","key":"9606_CR18","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1109\/MCI.2006.1597056","volume":"1","author":"H Handa","year":"2006","unstructured":"Handa H, Chapman L, Yao X (2006b) Robust route optimization for gritting\/salting trucks: a CERCIA experienee. IEEE Comput Intell Mag 1(1):6\u20139","journal-title":"IEEE Comput Intell Mag"},{"issue":"4","key":"9606_CR19","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1287\/trsc.35.4.425.10431","volume":"35","author":"A Hertz","year":"2001","unstructured":"Hertz A, Mittaz M (2001) A variable neighborhood descent algorithm for the undirected capacitated arc routing problem. Trans Sci 35(4):425\u2013434","journal-title":"Trans Sci"},{"issue":"1","key":"9606_CR20","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1287\/opre.48.1.129.12455","volume":"48","author":"A Hertz","year":"2000","unstructured":"Hertz A, Laporte G, Mittaz M (2000) A tabu search heuristic for the capacitated arc routing problem. Oper Res 48(1):129\u2013135","journal-title":"Oper Res"},{"key":"9606_CR21","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1016\/j.cor.2015.02.001","volume":"59","author":"ME Keskin","year":"2015","unstructured":"Keskin ME, Altinel iK, Aras N (2015) Combining simulated annealing with Lagrangian relaxation and weighted Dantzig-Wolfe decomposition for integrated design decisions in wireless sensor. Comput Oper Res 59:132\u2013143","journal-title":"Comput Oper Res"},{"key":"9606_CR22","doi-asserted-by":"crossref","unstructured":"Lacomme P, Prins C, Ramdane-Cherif W (2001) A genetic algorithm for the capacitated arc routing problem and its extensions. In: Proceedings of evolutionary workshops on application evolutionary computation Como, pp. 473\u2013483","DOI":"10.1007\/3-540-45365-2_49"},{"issue":"1\u20134","key":"9606_CR23","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1023\/B:ANOR.0000039517.35989.6d","volume":"131","author":"P Lacomme","year":"2004","unstructured":"Lacomme P, Prins C, Ramdane-Cherif W (2004) Competitive memetic algorithms for arc routing problem. Ann Oper Res 131(1\u20134):159\u2013185","journal-title":"Ann Oper Res"},{"key":"9606_CR24","doi-asserted-by":"crossref","first-page":"3473","DOI":"10.1016\/j.cor.2005.02.017","volume":"33","author":"P Lacomme","year":"2006","unstructured":"Lacomme P, Prins C, Sevaux M (2006) A genetic algorithm for a bi-objective capacitated arc routing problem. Comput Oper Res 33:3473\u20133493","journal-title":"Comput Oper Res"},{"issue":"3","key":"9606_CR25","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/s12293-009-0016-9","volume":"1","author":"MN Le","year":"2009","unstructured":"Le MN, Ong YS, Jin Y, Sendhoff B (2009) Lamarckian memetic algorithms: local optimum and connectivity structure analysis. Meme Comput J 1(3):175\u2013190","journal-title":"Meme Comput J"},{"key":"9606_CR26","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1016\/j.asoc.2014.11.039","volume":"28","author":"YY Li","year":"2015","unstructured":"Li YY, He HY, Wang Y, Xu X, Jiao LC (2015) An improved multiobjective estimation of distribution algorithm for environmental economic dispatch of hydrothermal power systems. Appl Soft Comput 28:559\u2013568","journal-title":"Appl Soft Comput"},{"issue":"6","key":"9606_CR27","doi-asserted-by":"crossref","first-page":"1823","DOI":"10.1016\/j.cor.2004.11.020","volume":"33","author":"H Longo","year":"2006","unstructured":"Longo H, De Aragao MP, Uchoa E (2006) Solving capacitated arc routing problems using a transformation to the CARP. Comput Oper Res 33(6):1823\u20131837","journal-title":"Comput Oper Res"},{"issue":"1","key":"9606_CR28","doi-asserted-by":"crossref","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. Nat Comput 9(1):5\u201327","journal-title":"Nat Comput"},{"key":"9606_CR29","doi-asserted-by":"crossref","unstructured":"Mei Y, Tang K, Yao X (2009) Improved memetic algorithm for capacitated arc routing problem. In: Proceedings of the 2009 IEEE congress on evolutionary computation, pp. 1699-1706","DOI":"10.1109\/CEC.2009.4983146"},{"issue":"2","key":"9606_CR30","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1109\/TEVC.2010.2051446","volume":"15","author":"Y Mei","year":"2011","unstructured":"Mei Y, Tang K, Yao X (2011a) Decomposition-based memetic algorithm for multi-objective capacitated arc routing problems. IEEE Trans Evol Comput 15(2):151\u2013165","journal-title":"IEEE Trans Evol Comput"},{"issue":"6","key":"9606_CR31","doi-asserted-by":"crossref","first-page":"1654","DOI":"10.1109\/TSMCB.2011.2158307","volume":"41","author":"Y Mei","year":"2011","unstructured":"Mei Y, Tang K, Yao X (2011b) A memetic algorithm for periodic capacitated arc routing problem. IEEE Trans Syst Man Cybern 41(6):1654\u20131667","journal-title":"IEEE Trans Syst Man Cybern"},{"key":"9606_CR32","doi-asserted-by":"crossref","unstructured":"Mei Y, Li X D, Yao X (2013) Decomposing large-scale capacitated arc routing problems using a random route grouping method. In: Proceedings of the 2013 IEEE congress on evolutionary computation (CEC2013), Cancun, Mexico: pp. 20\u201323","DOI":"10.1109\/CEC.2013.6557678"},{"key":"9606_CR33","first-page":"377","volume":"490","author":"Y Mei","year":"2013","unstructured":"Mei Y, Tang K, Yao X (2013b) Evolutionary computation for dynamic capacitated arc routing problem. Soft Comput 490:377\u2013401","journal-title":"Soft Comput"},{"issue":"3","key":"9606_CR34","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1109\/TEVC.2013.2281503","volume":"18","author":"Y Mei","year":"2014","unstructured":"Mei Y, Li XD, Yao X (2014) Cooperative co-evolution with route distance grouping for large-scale capacitated arc routing problems. IEEE Trans Evol Comput 18(3):435\u2013449","journal-title":"IEEE Trans Evol Comput"},{"issue":"3","key":"9606_CR35","doi-asserted-by":"crossref","first-page":"856","DOI":"10.1016\/j.ejor.2008.04.025","volume":"196","author":"MC Mour\u00e3o","year":"2009","unstructured":"Mour\u00e3o MC, Nunes AC, Prins C (2009) Heuristic methods for the sectoring arc routing problem. Eur J Oper Res 196(3):856\u2013868","journal-title":"Eur J Oper Res"},{"issue":"3","key":"9606_CR36","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1016\/S0377-2217(01)00184-9","volume":"139","author":"L Muyldermans","year":"2002","unstructured":"Muyldermans L, Cattrysse D, VanOudheusden D, Lotan T (2002) Districting for salt spreading operations. Eur J Oper Res 139(3):521\u2013532","journal-title":"Eur J Oper Res"},{"issue":"3","key":"9606_CR37","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1109\/TEVC.2013.2281543","volume":"18","author":"MN Omidvar","year":"2014","unstructured":"Omidvar MN, Li XD, Mei Y, Yao X (2014) Cooperative co-evolution with differential grouping for large scale optimization. IEEE Trans Evol Comput 18(3):378\u2013393","journal-title":"IEEE Trans Evol Comput"},{"key":"9606_CR38","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1287\/ijoc.12.3.164.12639","volume":"12","author":"M Prais","year":"2000","unstructured":"Prais M, Ribeiro CC (2000) Reactive GRASP: an application to a matrix decomposition problem in TDMA traffic assignment. INFORMS J Comput 12:164\u2013176","journal-title":"INFORMS J Comput"},{"key":"9606_CR39","doi-asserted-by":"crossref","unstructured":"Resende MGC, Ribeiro CC (2005) GRASP with path-relinking: recent advances and applications. In: Meta-heuristics: progress as real problem solvers, Springer, Berlin, pp. 29\u201363","DOI":"10.1007\/0-387-25383-1_2"},{"key":"9606_CR40","doi-asserted-by":"crossref","first-page":"2632","DOI":"10.1016\/j.cor.2008.11.005","volume":"36","author":"L Santos","year":"2009","unstructured":"Santos L, Coutinho-Rodrigues J, Current JR (2009) An improved heuristic for the capacitated arc routing problem. Comput Oper Res 36:2632\u20132637","journal-title":"Comput Oper Res"},{"issue":"1","key":"9606_CR41","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1109\/TEVC.2010.2046328","volume":"16","author":"RH Shang","year":"2012","unstructured":"Shang RH, Jiao LC, Liu F, Ma WP (2012) A Novel Immune Clonal Algorithm for MO Problems. IEEE Trans Evol Comput 16(1):35\u201349","journal-title":"IEEE Trans Evol Comput"},{"key":"9606_CR42","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/j.asoc.2014.03.005","volume":"19","author":"RH Shang","year":"2014","unstructured":"Shang RH, Wang J, Jiao LC, Wang YY (2014a) An improved decomposition-based memetic algorithm for multi-objective capacitated arc routing problem. Appl Soft Comput 19:343\u2013361","journal-title":"Appl Soft Comput"},{"issue":"7","key":"9606_CR43","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1016\/j.ins.2014.03.008","volume":"27","author":"RH Shang","year":"2014","unstructured":"Shang RH, Wang YY, Wang J, Jiao LC, Wang S, Qi LP (2014b) A multi-population cooperative coevolutionary algorithm for multi-objective capacitated arc routing problem. Inf Sci 27(7):609\u2013642","journal-title":"Inf Sci"},{"issue":"3","key":"9606_CR44","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1007\/s11047-014-9415-z","volume":"13","author":"RH Shang","year":"2014","unstructured":"Shang RH, Jiao LC, Ren YJ, Wang J, Li YY (2014c) Immune clonal coevolutionary algorithm for dynamic multiobjective optimization. Nat Comput 13(3):421\u2013445","journal-title":"Nat Comput"},{"issue":"4","key":"9606_CR45","doi-asserted-by":"crossref","first-page":"1000","DOI":"10.1109\/TCYB.2015.2419276","volume":"6","author":"RH Shang","year":"2016","unstructured":"Shang RH, Dai KY, Jiao LC, Stolkin R (2016) Improved memetic algorithm based on route distance grouping for multi-objective large scale capacitated arc routing problems. IEEE Trans Cybern 6(4):1000\u20131013","journal-title":"IEEE Trans Cybern"},{"issue":"3","key":"9606_CR46","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1016\/j.ins.2014.11.036","volume":"298","author":"XN Shen","year":"2015","unstructured":"Shen XN, Yao X (2015) Mathematical modeling and multi-objective evolutionary algorithms applied to dynamic flexible job shop scheduling problems. Inf Sci 298(3):198\u2013224","journal-title":"Inf Sci"},{"issue":"1","key":"9606_CR47","first-page":"171","volume":"16","author":"J Shen","year":"2015","unstructured":"Shen J, Tan HW, Wang J, Wang JW, Lee SY (2015) A novel routing protocol providing good transmission reliability in underwater sensor networks. J Internet Technol 16(1):171\u2013178","journal-title":"J Internet Technol"},{"issue":"5","key":"9606_CR48","doi-asserted-by":"crossref","first-page":"1151","DOI":"10.1109\/TEVC.2009.2023449","volume":"13","author":"K Tang","year":"2009","unstructured":"Tang K, Mei Y, Yao X (2009) Memetic algorithm with extended neighborhood search for capacitated arc routing problems. IEEE Trans Evol Comput 13(5):1151\u20131166","journal-title":"IEEE Trans Evol Comput"},{"key":"9606_CR49","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2016.2590558","author":"K Tang","year":"2016","unstructured":"Tang K, Wang J, Li X, Yao X (2016) A scalable approach to capacitated arc routing problems based on hierarchical decomposition. IEEE Trans Cybern. doi: 10.1109\/TCYB.2016.2590558","journal-title":"IEEE Trans Cybern"},{"issue":"3","key":"9606_CR50","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1016\/0377-2217(85)90252-8","volume":"22","author":"G Ulusoy","year":"1985","unstructured":"Ulusoy G (1985) The fleet size and mix problem for capacitated arc routing. Eur J Oper Res 22(3):329\u2013337","journal-title":"Eur J Oper Res"},{"issue":"13","key":"9606_CR51","first-page":"19","volume":"38","author":"JG Villegas","year":"2011","unstructured":"Villegas JG, Prins C, Prodhon C, Medaglia AL, Velasco N (2011) A GRASP with evolutionary path relinking for the truck and trailer routing problem. Comput Oper Res 38(13):19\u201334","journal-title":"Comput Oper Res"},{"issue":"1","key":"9606_CR52","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1109\/TEVC.2015.2428616","volume":"20","author":"J Wang","year":"2016","unstructured":"Wang J, Tang K, Lozano JA, Yao X (2016) Estimation of the distribution algorithm with a stochastic local search for uncertain capacitated arc routing problems. IEEE Trans Evol Comput 20(1):96\u2013109","journal-title":"IEEE Trans Evol Comput"},{"issue":"1","key":"9606_CR53","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1016\/j.ins.2014.10.040","volume":"295","author":"XZ Wen","year":"2015","unstructured":"Wen XZ, Shao L, Xue Y, Fang W (2015) A rapid learning algorithm for vehicle classification. Inf Sci 295(1):395\u2013406","journal-title":"Inf Sci"},{"issue":"2","key":"9606_CR54","first-page":"340","volume":"27","author":"ZH Xia","year":"2015","unstructured":"Xia ZH, Wang XH, Sun XM, Wang Q (2015) A secure and dynamic multi-keyword ranked search scheme over encrypted cloud data. IEEE Trans Parallel Distrib Syst 27(2):340\u2013352","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"2","key":"9606_CR55","doi-asserted-by":"crossref","first-page":"961","DOI":"10.3233\/IFS-141378","volume":"28","author":"YH Zheng","year":"2015","unstructured":"Zheng YH, Jeon B, Xu DH, Wu QMJ, Zhang H (2015) Image segmentation by generalized hierarchical fuzzy C-means algorithm. J Intell Fuzzy Syst 28(2):961\u2013973","journal-title":"J Intell Fuzzy Syst"}],"container-title":["Natural Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11047-016-9606-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-016-9606-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-016-9606-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,28]],"date-time":"2020-09-28T18:38:44Z","timestamp":1601318324000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11047-016-9606-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1,9]]},"references-count":55,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,6]]}},"alternative-id":["9606"],"URL":"https:\/\/doi.org\/10.1007\/s11047-016-9606-x","relation":{},"ISSN":["1567-7818","1572-9796"],"issn-type":[{"value":"1567-7818","type":"print"},{"value":"1572-9796","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,1,9]]}}}