{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T17:55:01Z","timestamp":1770486901138,"version":"3.49.0"},"reference-count":59,"publisher":"Springer Science and Business Media LLC","issue":"18","license":[{"start":{"date-parts":[[2016,3,18]],"date-time":"2016-03-18T00:00:00Z","timestamp":1458259200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"European Union\u2019s Horizon 2020 research and innovation programme","award":["636220"],"award-info":[{"award-number":["636220"]}]},{"name":"Spanish Ministry of Economy and Competitiveness","award":["TEC2013-45585-C2-2-R"],"award-info":[{"award-number":["TEC2013-45585-C2-2-R"]}]},{"DOI":"10.13039\/501100003086","name":"Eusko Jaurlaritza","doi-asserted-by":"publisher","award":["PC2013-71A"],"award-info":[{"award-number":["PC2013-71A"]}],"id":[{"id":"10.13039\/501100003086","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2017,9]]},"DOI":"10.1007\/s00500-016-2114-1","type":"journal-article","created":{"date-parts":[[2016,3,18]],"date-time":"2016-03-18T14:53:32Z","timestamp":1458312812000},"page":"5295-5308","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":113,"title":["A discrete firefly algorithm to solve a rich vehicle routing problem modelling a newspaper distribution system with recycling policy"],"prefix":"10.1007","volume":"21","author":[{"given":"Eneko","family":"Osaba","sequence":"first","affiliation":[]},{"given":"Xin-She","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Fernando","family":"Diaz","sequence":"additional","affiliation":[]},{"given":"Enrique","family":"Onieva","sequence":"additional","affiliation":[]},{"given":"Antonio D.","family":"Masegosa","sequence":"additional","affiliation":[]},{"given":"Asier","family":"Perallos","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,3,18]]},"reference":[{"issue":"2","key":"2114_CR1","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1007\/s11750-012-0266-4","volume":"22","author":"P Amorim","year":"2014","unstructured":"Amorim P, Parragh SN, Sperandio F, Almada-Lobo B (2014) A rich vehicle routing problem dealing with perishable food: a case study. Top 22(2):489\u2013508","journal-title":"Top"},{"issue":"2","key":"2114_CR2","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/j.ejor.2013.04.039","volume":"230","author":"C Archetti","year":"2013","unstructured":"Archetti C, Doerner KF, Tricoire F (2013) A heuristic algorithm for the free newspaper delivery problem. Eur J Oper Res 230(2):245\u2013257","journal-title":"Eur J Oper Res"},{"key":"2114_CR3","doi-asserted-by":"crossref","unstructured":"Atashpaz-Gargari E, Lucas C (2007) Imperialist competitive algorithm: an algorithm for optimization inspired by imperialistic competition. In: IEEE congress on evolutionary computation, pp 4661\u20134667","DOI":"10.1109\/CEC.2007.4425083"},{"issue":"1","key":"2114_CR4","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1287\/opre.2013.1227","volume":"62","author":"M Battarra","year":"2014","unstructured":"Battarra M, Erdogan G, Vigo D (2014) Exact algorithms for the clustered vehicle routing problem. Oper Res 62(1):58\u201371","journal-title":"Oper Res"},{"key":"2114_CR5","unstructured":"Boonkleaw A, Suthikarnnarunai N, Srinon R (2009) Strategic planning and vehicle routing algorithm for newspaper delivery problem: case study of morning newspaper, Bangkok, Thailand. In: Proceedings of the world congress on engineering and computer science, 2:1067\u20131071"},{"issue":"1","key":"2114_CR6","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1016\/j.ejor.2014.12.001","volume":"243","author":"A Bortfeldt","year":"2015","unstructured":"Bortfeldt A, Hahn T, M\u00e4nnel D, M\u00f6nch L (2015) Hybrid algorithms for the vehicle routing problem with clustered backhauls and 3d loading constraints. Eur J Oper Res 243(1):82\u201396","journal-title":"Eur J Oper Res"},{"issue":"2","key":"2114_CR7","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1145\/2666003","volume":"47","author":"J Caceres-Cruz","year":"2014","unstructured":"Caceres-Cruz J, Arias P, Guimarans D, Riera D, Juan AA (2014) Rich vehicle routing problem: survey. ACM Comput Surv (CSUR) 47(2):32","journal-title":"ACM Comput Surv (CSUR)"},{"key":"2114_CR8","doi-asserted-by":"crossref","unstructured":"Campbell A, Clarke L, Kleywegt A, Savelsbergh M (1998) The inventory routing problem. In: Fleet management and logistics. Springer, New York, pp 95\u2013113","DOI":"10.1007\/978-1-4615-5755-5_4"},{"issue":"4","key":"2114_CR9","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1007\/s10732-015-9285-2","volume":"21","author":"B Cao","year":"2015","unstructured":"Cao B, Glover F, Rego C (2015) A tabu search algorithm for cohesive clustering problems. J Heurist 21(4):457\u2013477","journal-title":"J Heurist"},{"issue":"2","key":"2114_CR10","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0305-0548(75)90015-5","volume":"2","author":"JA Chisman","year":"1975","unstructured":"Chisman JA (1975) The clustered traveling salesman problem. Comput Oper Res 2(2):115\u2013119","journal-title":"Comput Oper Res"},{"key":"2114_CR11","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/j.engappai.2015.03.009","volume":"42","author":"J Armas de","year":"2015","unstructured":"de Armas J, Meli\u00e1n-Batista B, Moreno-P\u00e9rez JA, Brito J (2015) Gvns for a real-world rich vehicle routing problem with time windows. Eng Appl Artif Intell 42:45\u201356","journal-title":"Eng Appl Artif Intell"},{"key":"2114_CR12","unstructured":"De Jong K (1975) Analysis of the behavior of a class of genetic adaptive systems. PhD thesis, University of Michigan, Michigan"},{"issue":"1","key":"2114_CR13","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.swevo.2011.02.002","volume":"1","author":"J Derrac","year":"2011","unstructured":"Derrac J, Garc\u00eda S, Molina D, Herrera F (2011) A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm Evolut Comput 1(1):3\u201318","journal-title":"Swarm Evolut Comput"},{"issue":"2","key":"2114_CR14","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/j.tcs.2005.05.020","volume":"344","author":"M Dorigo","year":"2005","unstructured":"Dorigo M, Blum C (2005) Ant colony optimization theory: a survey. Theor Comput Sci 344(2):243\u2013278","journal-title":"Theor Comput Sci"},{"key":"2114_CR15","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1016\/j.swevo.2013.06.001","volume":"13","author":"I Fister","year":"2013","unstructured":"Fister I, Fister I Jr, Yang XS, Brest J (2013) A comprehensive review of firefly algorithms. Swarm Evolut Comput 13:34\u201346","journal-title":"Swarm Evolut Comput"},{"key":"2114_CR16","doi-asserted-by":"crossref","unstructured":"Fister I, Yang XS, Fister D, Fister Jr. I (2014) Firefly algorithm: a brief review of the expanding literature. In: Cuckoo search and firefly algorithm. Springer, New York, pp 347\u2013360","DOI":"10.1007\/978-3-319-02141-6_17"},{"issue":"2","key":"2114_CR17","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1177\/003754970107600201","volume":"76","author":"ZW Geem","year":"2001","unstructured":"Geem ZW, Kim JH, Loganathan G (2001) A new heuristic optimization algorithm: harmony search. Simulation 76(2):60\u201368","journal-title":"Simulation"},{"issue":"3","key":"2114_CR18","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F Glover","year":"1989","unstructured":"Glover F (1989) Tabu search, part i. ORSA J Comput 1(3):190\u2013206","journal-title":"ORSA J Comput"},{"key":"2114_CR19","volume-title":"Genetic algorithms in search, optimization, and machine learning","author":"D Goldberg","year":"1989","unstructured":"Goldberg D (1989) Genetic algorithms in search, optimization, and machine learning. Addison-Wesley Professional, Boston"},{"issue":"1","key":"2114_CR20","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1287\/opre.35.1.6","volume":"35","author":"BL Golden","year":"1987","unstructured":"Golden BL, Wasil EA (1987) Or practice computerized vehicle routing in the soft drink industry. Oper Res 35(1):6\u201317","journal-title":"Oper Res"},{"issue":"11","key":"2114_CR21","doi-asserted-by":"crossref","first-page":"2959","DOI":"10.1016\/j.cor.2004.04.013","volume":"32","author":"A Haghani","year":"2005","unstructured":"Haghani A, Jung S (2005) A dynamic vehicle routing problem with time-dependent travel times. Comput Oper Res 32(11):2959\u20132986","journal-title":"Comput Oper Res"},{"issue":"1","key":"2114_CR22","first-page":"58","volume":"6","author":"R Herrero","year":"2014","unstructured":"Herrero R, Rodr\u00edguez A, C\u00e1ceres-Cruz J, Juan AA (2014) Solving vehicle routing problems with asymmetric costs and heterogeneous fleets. Int J Adv Oper Manag 6(1):58\u201380","journal-title":"Int J Adv Oper Manag"},{"key":"2114_CR23","first-page":"85","volume":"17","author":"AP Hurter","year":"1996","unstructured":"Hurter AP, Van Buer MG (1996) The newspaper production\/distribution problem. J Bus Log 17:85\u2013107","journal-title":"J Bus Log"},{"key":"2114_CR24","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/j.asoc.2014.11.060","volume":"28","author":"T \u0130nkaya","year":"2015","unstructured":"\u0130nkaya T, Kayal\u0131gil S, \u00d6zdemirel NE (2015) Ant colony optimization based clustering methodology. Appl Soft Comput 28:301\u2013311","journal-title":"Appl Soft Comput"},{"key":"2114_CR25","doi-asserted-by":"crossref","unstructured":"Jati GK et al (2011) Evolutionary discrete firefly algorithm for travelling salesman problem, Volume 6943. Springer, New York","DOI":"10.1007\/978-3-642-23857-4_38"},{"key":"2114_CR26","volume-title":"Vehicle routing problem with time windows","author":"B Kallehauge","year":"2005","unstructured":"Kallehauge B, Larsen J, Madsen OB, Solomon MM (2005) Vehicle routing problem with time windows. Springer, New York"},{"key":"2114_CR27","doi-asserted-by":"crossref","unstructured":"Kennedy J, Eberhart R et al (1995) Particle swarm optimization. In: Proceedings of IEEE international conference on neural networks. Volume 4, Perth, pp 1942\u20131948","DOI":"10.1109\/ICNN.1995.488968"},{"issue":"4598","key":"2114_CR28","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick S, Gellat C, Vecchi M (1983) Optimization by simmulated annealing. Science 220(4598):671\u2013680","journal-title":"Science"},{"issue":"1","key":"2114_CR29","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2014.07.048","volume":"241","author":"R Lahyani","year":"2015","unstructured":"Lahyani R, Khemakhem M, Semet F (2015) Rich vehicle routing problems: from a taxonomy to a definition. Eur J Oper Res 241(1):1\u201314","journal-title":"Eur J Oper Res"},{"key":"2114_CR30","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.omega.2014.08.007","volume":"51","author":"R Lahyani","year":"2015","unstructured":"Lahyani R, Coelho LC, Khemakhem M, Laporte G, Semet F (2015) A multi-compartment vehicle routing problem arising in the collection of olive oil in tunisia. Omega 51:1\u201310","journal-title":"Omega"},{"issue":"1","key":"2114_CR31","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1002\/net.3230160104","volume":"16","author":"G Laporte","year":"1986","unstructured":"Laporte G, Mercure H, Nobert Y (1986) An exact algorithm for the asymmetrical capacitated vehicle routing problem. Networks 16(1):33\u201346","journal-title":"Networks"},{"issue":"7","key":"2114_CR32","doi-asserted-by":"crossref","first-page":"3551","DOI":"10.1016\/j.eswa.2014.12.004","volume":"42","author":"J Li","year":"2015","unstructured":"Li J, Pardalos PM, Sun H, Pei J, Zhang Y (2015) Iterated local search embedded adaptive neighborhood selection approach for the multi-depot vehicle routing problem with simultaneous deliveries and pickups. Exp Syst Appl 42(7):3551\u20133561","journal-title":"Exp Syst Appl"},{"key":"2114_CR33","doi-asserted-by":"crossref","first-page":"1088","DOI":"10.1016\/j.ijepes.2014.09.008","volume":"64","author":"RH Liang","year":"2015","unstructured":"Liang RH, Wang JC, Chen YT, Tseng WT (2015) An enhanced firefly algorithm to multi-objective optimal active\/reactive power dispatch with uncertainties consideration. Int J Electr Power Energy Syst 64:1088\u20131097","journal-title":"Int J Electr Power Energy Syst"},{"key":"2114_CR34","doi-asserted-by":"crossref","unstructured":"Marinakis Y, Marinaki M, Spanou P (2015) A memetic differential evolution algorithm for the vehicle routing problem with stochastic demands. In: Adaptation and hybridization in computational intelligence. Springer, New York, pp 185\u2013204","DOI":"10.1007\/978-3-319-14400-9_9"},{"key":"2114_CR35","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1016\/j.neucom.2015.01.028","volume":"159","author":"Y Ma","year":"2015","unstructured":"Ma Y, Zhao Y, Wu L, He Y, Yang XS (2015) Navigability analysis of magnetic map with projecting pursuit-based selection method by using firefly algorithm. Neurocomputing 159:288\u2013297","journal-title":"Neurocomputing"},{"issue":"3","key":"2114_CR36","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1016\/j.cor.2004.07.009","volume":"33","author":"FAT Montan\u00e9","year":"2006","unstructured":"Montan\u00e9 FAT, Galvao RD (2006) A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service. Comput Oper Res 33(3):595\u2013619","journal-title":"Comput Oper Res"},{"key":"2114_CR37","doi-asserted-by":"crossref","unstructured":"Moscato P, Cotta C (2003) A gentle introduction to memetic algorithms. In: Handbook of metaheuristics. Springer, New York, pp 105\u2013144","DOI":"10.1007\/0-306-48056-5_5"},{"issue":"4","key":"2114_CR38","doi-asserted-by":"crossref","first-page":"724","DOI":"10.1016\/j.cor.2009.06.022","volume":"37","author":"Y Nagata","year":"2010","unstructured":"Nagata Y, Br\u00e4ysy O, Dullaert W (2010) A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows. Comput Oper Res 37(4):724\u2013737","journal-title":"Comput Oper Res"},{"issue":"5","key":"2114_CR39","doi-asserted-by":"crossref","first-page":"812","DOI":"10.1007\/s10766-014-0343-4","volume":"43","author":"J Nalepa","year":"2015","unstructured":"Nalepa J, Blocho M (2015a) Co-operation in the parallel memetic algorithm. Int J Parall Progr 43(5):812\u2013839","journal-title":"Int J Parall Progr"},{"key":"2114_CR40","doi-asserted-by":"publisher","unstructured":"Nalepa J, BlochoM (2015b) Adaptive memetic algorithm for minimizing distance in the vehicle routing problem with time windows. Soft Comput. doi:\n                        10.1007\/s00500-015-1642-4","DOI":"10.1007\/s00500-015-1642-4"},{"key":"2114_CR41","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/j.cor.2015.04.009","volume":"62","author":"Y Qi","year":"2015","unstructured":"Qi Y, Hou Z, Li H, Huang J, Li X (2015) A decomposition based memetic algorithm for multi-objective vehicle routing problem with time windows. Compute Oper Res 62:61\u201377","journal-title":"Compute Oper Res"},{"issue":"3","key":"2114_CR42","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1016\/0360-8352(96)00013-7","volume":"30","author":"S Ree","year":"1996","unstructured":"Ree S, Yoon BS (1996) A two-stage heuristic approach for the newspaper delivery problem. Comput Ind Eng 30(3):501\u2013509","journal-title":"Comput Ind Eng"},{"key":"2114_CR43","doi-asserted-by":"crossref","unstructured":"Rodriguez A, Gutierrez A, Rivera L, Ramirez L (2015) Rwa: comparison of genetic algorithms and simulated annealing in dynamic traffic. In: Advanced computer and communication engineering technology. Springer, New York, pp 3\u201314","DOI":"10.1007\/978-3-319-07674-4_1"},{"issue":"3","key":"2114_CR44","doi-asserted-by":"crossref","first-page":"528","DOI":"10.1016\/S0377-2217(98)00086-1","volume":"113","author":"P Toth","year":"1999","unstructured":"Toth P, Vigo D (1999) A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls. Eur J Oper Res 113(3):528\u2013543","journal-title":"Eur J Oper Res"},{"key":"2114_CR45","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898718515","volume-title":"The vehicle routing problem","author":"P Toth","year":"2002","unstructured":"Toth P, Vigo D (2002) The vehicle routing problem. Society for Industrial and Applied Mathematics, Philadelphia"},{"issue":"2","key":"2114_CR46","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/S0377-2217(98)00300-2","volume":"115","author":"MG Buer Van","year":"1999","unstructured":"Van Buer MG, Woodruff DL, Olson RT (1999) Solving the medium newspaper production\/distribution problem. Eur J Oper Res 115(2):237\u2013253","journal-title":"Eur J Oper Res"},{"issue":"3","key":"2114_CR47","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1287\/opre.1120.1048","volume":"60","author":"T Vidal","year":"2012","unstructured":"Vidal T, Crainic TG, Gendreau M, Lahrichi N, Rei W (2012) A hybrid genetic algorithm for multidepot and periodic vehicle routing problems. Oper Res 60(3):611\u2013624","journal-title":"Oper Res"},{"issue":"1","key":"2114_CR48","doi-asserted-by":"crossref","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):1\u201321","journal-title":"Eur J Oper Res"},{"issue":"1","key":"2114_CR49","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1016\/j.cor.2012.07.018","volume":"40","author":"T Vidal","year":"2013","unstructured":"Vidal T, Crainic TG, Gendreau M, Prins C (2013) A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows. Comput Oper Res 40(1):475\u2013489","journal-title":"Comput Oper Res"},{"key":"2114_CR50","unstructured":"Vidal T, Battarra M, Subramanian A, Erdogan G (2014) Hybrid metaheuristics for the clustered vehicle routing problem. Comput Oper Res 58(1):87\u201399"},{"issue":"1","key":"2114_CR51","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/j.ejor.2004.01.032","volume":"165","author":"D Villeneuve","year":"2005","unstructured":"Villeneuve D, Desaulniers G (2005) The shortest path problem with forbidden paths. Eur J Oper Res 165(1):97\u2013107","journal-title":"Eur J Oper Res"},{"key":"2114_CR52","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/j.cie.2015.02.005","volume":"83","author":"C Wang","year":"2015","unstructured":"Wang C, Mu D, Zhao F, Sutherland JW (2015) A parallel simulated annealing method for the vehicle routing problem with simultaneous pickup-delivery and time windows. Comput Ind Eng 83:111\u2013122","journal-title":"Comput Ind Eng"},{"key":"2114_CR53","doi-asserted-by":"crossref","unstructured":"Yang XS (2009) Firefly algorithms for multimodal optimization. In: Stochastic algorithms: foundations and applications. Springer, New York, pp 169\u2013178","DOI":"10.1007\/978-3-642-04944-6_14"},{"key":"2114_CR54","doi-asserted-by":"crossref","unstructured":"Yang XS (2010) A new metaheuristic bat-inspired algorithm. In: Nature inspired cooperative strategies for optimization. Springer, New York, pp 65\u201374","DOI":"10.1007\/978-3-642-12538-6_6"},{"key":"2114_CR55","volume-title":"Nature-inspired metaheuristic algorithms","author":"XS Yang","year":"2008","unstructured":"Yang XS (2008) Nature-inspired metaheuristic algorithms. Luniver press, London"},{"issue":"2","key":"2114_CR56","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1109\/72.363466","volume":"6","author":"PP Yip","year":"1995","unstructured":"Yip PP, Pao YH (1995) Combinatorial optimization with use of guided evolutionary simulated annealing. IEEE Trans Neural Netw 6(2):290\u2013295","journal-title":"IEEE Trans Neural Netw"},{"issue":"3","key":"2114_CR57","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1016\/j.ejor.2012.11.059","volume":"229","author":"Z Zhang","year":"2013","unstructured":"Zhang Z, Che O, Cheang B, Lim A, Qin H (2013) A memetic algorithm for the multiperiod vehicle routing problem with profit. Eur J Oper Res 229(3):573\u2013584","journal-title":"Eur J Oper Res"},{"key":"2114_CR58","doi-asserted-by":"crossref","unstructured":"Zhou L, Ding L, Qiang X (2014) A multi-population discrete firefly algorithm to solve tsp. In: Bio-inspired computing-theories and applications. Springer, New York, pp 648\u2013653","DOI":"10.1007\/978-3-662-45049-9_106"},{"key":"2114_CR59","doi-asserted-by":"publisher","unstructured":"Zouache D, Nouioua F, Moussaoui A (2015) Quantum-inspired firefly algorithm with particle swarm optimization for discrete optimization problems. Soft Comput. doi:\n                        10.1007\/s00500-015-1681-x","DOI":"10.1007\/s00500-015-1681-x"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-016-2114-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-016-2114-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-016-2114-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-016-2114-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T21:46:16Z","timestamp":1559079976000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-016-2114-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,3,18]]},"references-count":59,"journal-issue":{"issue":"18","published-print":{"date-parts":[[2017,9]]}},"alternative-id":["2114"],"URL":"https:\/\/doi.org\/10.1007\/s00500-016-2114-1","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,3,18]]}}}