{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,27]],"date-time":"2025-11-27T20:55:09Z","timestamp":1764276909662,"version":"3.37.3"},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"14","license":[{"start":{"date-parts":[[2018,5,24]],"date-time":"2018-05-24T00:00:00Z","timestamp":1527120000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100004586","name":"Funda\u00e7\u00e3o Carlos Chagas Filho de Amparo \u00e0 Pesquisa do Estado do Rio de Janeiro","doi-asserted-by":"publisher","award":["E-26\/203.271\/2017"],"award-info":[{"award-number":["E-26\/203.271\/2017"]}],"id":[{"id":"10.13039\/501100004586","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["312989\/2017-2"],"award-info":[{"award-number":["312989\/2017-2"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1007\/s00500-018-3250-6","type":"journal-article","created":{"date-parts":[[2018,5,24]],"date-time":"2018-05-24T12:39:22Z","timestamp":1527165562000},"page":"5865-5882","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Cargo theft weighted vehicle routing problem: modeling and application to the pharmaceutical distribution sector"],"prefix":"10.1007","volume":"23","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9458-3048","authenticated-orcid":false,"given":"Hugo M.","family":"Repolho","sequence":"first","affiliation":[]},{"given":"Janaina F.","family":"Marchesi","sequence":"additional","affiliation":[]},{"given":"Orivalde S. Silva","family":"J\u00fanior","sequence":"additional","affiliation":[]},{"given":"Rodrigo R. R.","family":"Bezerra","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,5,24]]},"reference":[{"key":"3250_CR1","unstructured":"ABTC - Associa\u00e7\u00e3o Brasileira de Log\u00edstica e Transporte de Carga (2010 ) Reportagem especial: roubo de cargas. Bras\u00edlia. http:\/\/www.abtc.org.br\/paginas\/noticia.aspx?n=3 . Accessed in 23 Sep 2014"},{"key":"3250_CR2","volume-title":"Pesquisa Operacional","author":"M Arenales","year":"2007","unstructured":"Arenales M, Armentano V, Morabito R, Yanasse H (2007) Pesquisa Operacional. Elsevier, Editora Campus, Rio de Janeiro"},{"key":"3250_CR3","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/s10107-007-0178-5","volume":"115","author":"R Baldacci","year":"2008","unstructured":"Baldacci R, Christofides N, Mingozzi A (2008) An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts. Math Program Ser A 115:351\u2013385","journal-title":"Math Program Ser A"},{"key":"3250_CR4","volume-title":"Business logistics\/supply chain management: planning, organizing, and controlling the supply chain","author":"RH Ballou","year":"2004","unstructured":"Ballou RH (2004) Business logistics\/supply chain management: planning, organizing, and controlling the supply chain. Pearson Prentice Hall, New Jersey"},{"key":"3250_CR5","doi-asserted-by":"publisher","first-page":"954","DOI":"10.1016\/j.cor.2010.10.011","volume":"38","author":"SR Balseiro","year":"2011","unstructured":"Balseiro SR, Loiseau I, Ramonet J (2011) An Ant Colony algorithm hybridized with insertion heuristics for the Time Dependent Vehicle Routing Problem with Time Windows. Comput Oper Res 38:954\u2013966","journal-title":"Comput Oper Res"},{"key":"3250_CR6","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/0305-0548(83)90030-8","volume":"10","author":"LD Bodin","year":"1983","unstructured":"Bodin LD, Golden D, Assad A, Ball M (1983) Routing and scheduling of vehicles and crews: the state of the art. Comput Oper Res 10:63\u2013201","journal-title":"Comput Oper Res"},{"key":"3250_CR7","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1016\/0377-2217(94)00064-J","volume":"86","author":"AV Breedam","year":"1995","unstructured":"Breedam AV (1995) Improvement heuristics for the vehicle routing problem based on simulated annealing. Euro J Oper Res 86:480\u2013490","journal-title":"Euro J Oper Res"},{"key":"3250_CR8","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1016\/j.ejor.2013.06.012","volume":"236","author":"D Cattaruza","year":"2014","unstructured":"Cattaruza D, Absi N, Feillet D, Vidal T (2014) A memetic algorithm for the multi trip vehicle routing problem. Eur J Oper Res 236:833\u2013848","journal-title":"Eur J Oper Res"},{"key":"3250_CR9","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/BF02601637","volume":"63","author":"WC Chiang","year":"1996","unstructured":"Chiang WC, Russell RA (1996) Simulated annealing metaheuristics for the vehicle routing problem with time windows. Ann Oper Res 63:3\u201327","journal-title":"Ann Oper Res"},{"key":"3250_CR10","doi-asserted-by":"publisher","first-page":"2080","DOI":"10.1016\/j.cor.2005.08.002","volume":"34","author":"E Choi","year":"2007","unstructured":"Choi E, Tcha DW (2007) A column generation approach to the heterogeneous fleet vehicle routing problem. Comput Oper Res 34:2080\u20132095","journal-title":"Comput Oper Res"},{"key":"3250_CR11","unstructured":"Chopra S, Meindl P (2010) Supply chain management. Pearson Education, Inc., Prentice Hall, 4th Edition"},{"key":"3250_CR12","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1287\/opre.6.6.791","volume":"6","author":"G Croes","year":"1958","unstructured":"Croes G (1958) A method for solving traveling salesman problems. Oper Res 6:791\u2013812","journal-title":"Oper Res"},{"key":"3250_CR13","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1287\/opre.45.3.488","volume":"45","author":"ML Fisher","year":"1997","unstructured":"Fisher ML, J\u00d6rnsten KO, Madsen OBGA (1997) Vehicle routing with time windows: two optimization algorithms. Oper Res 45:488\u2013492","journal-title":"Oper Res"},{"key":"3250_CR14","unstructured":"G1 (2014) RJ concentra 20% do total de roubos de cargas registrados em todo o pa\u00eds. Rio de Janeiro. http:\/\/glo.bo\/1ylFN7U . Accessed 23 Sep 2014"},{"key":"3250_CR15","unstructured":"G1 (2018) \u00cdndices de viol\u00eancia sobem no Estado do Rio. https:\/\/oglobo.globo.com\/rio\/indices-de-violencia-sobem-no-estado-do-rio-22407369 . Accessed 28 Feb 2018"},{"issue":"3","key":"3250_CR16","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/j.jtrangeo.2003.12.004","volume":"12","author":"M Hesse","year":"2004","unstructured":"Hesse M, Rodrigue JP (2004) The transport geography of logistics and freight distribution. J Transp Geogr 12(3):171\u2013184","journal-title":"J Transp Geogr"},{"key":"3250_CR17","doi-asserted-by":"publisher","first-page":"548","DOI":"10.1016\/j.engappai.2007.06.001","volume":"21","author":"W Ho","year":"2008","unstructured":"Ho W, Ho GTS, Ji P, Lau HCW (2008) A hybrid genetic algorithm for the multi-depot vehicle routing problem. Eng Appl Artif Intell 21:548\u2013557","journal-title":"Eng Appl Artif Intell"},{"key":"3250_CR18","unstructured":"ISP - Instituto de Seguran\u00e7a P\u00fablica (2014) Comparativo das incid\u00eancias publicadas no di\u00e1rio oficial do Estado. http:\/\/arquivos.proderj.rj.gov.br\/isp_imagens\/Uploads\/ResumoOut14.pdf . Accessed 24 Nov 2014"},{"key":"3250_CR19","doi-asserted-by":"publisher","first-page":"3748","DOI":"10.1016\/j.eswa.2013.11.029","volume":"41","author":"J Jiang","year":"2014","unstructured":"Jiang J, Ng KM, Poh KL, Teo KM (2014) Vehicle routing problem with a heterogeneous fleet and time windows. Expert Syst Appl 41:3748\u20133760","journal-title":"Expert Syst Appl"},{"key":"3250_CR20","doi-asserted-by":"publisher","first-page":"2307","DOI":"10.1016\/j.cor.2006.11.006","volume":"35","author":"B Kallehauge","year":"2008","unstructured":"Kallehauge B (2008) Formulations and exact algorithms for the vehicle routing problem with time windows. Comput Oper Res 35:2307\u20132330","journal-title":"Comput Oper Res"},{"key":"3250_CR21","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick S, Gellat DC, Vecchi MP (1983) Optimization by simulated annealing. Science 220:675\u2013680","journal-title":"Science"},{"key":"3250_CR22","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1287\/trsc.33.1.101","volume":"33","author":"N Kohl","year":"1999","unstructured":"Kohl N, Desrosiers J, Madsen OBG, Solomon MM, Soumis F (1999) 2-path cuts for the vehicle routing problem with time windows. Transp Sci 33:101\u2013116","journal-title":"Transp Sci"},{"key":"3250_CR23","first-page":"173","volume-title":"Combinatorial programming: methods and applications","author":"J Krarup","year":"1975","unstructured":"Krarup J (1975) The peripatetic salesman and some related unsolved problems. In: Roy B (ed) Combinatorial programming: methods and applications. Reidel, Dordrecht, pp 173\u2013178"},{"key":"3250_CR24","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1016\/j.jtrangeo.2013.04.006","volume":"30","author":"PF Kuo","year":"2013","unstructured":"Kuo PF, Lord D, Walden TD (2013) Using geographical information systems to organize police patrol routes effectively by grouping hotspots of crash and crime data. J Transp Geogr 30:138\u2013148","journal-title":"J Transp Geogr"},{"key":"3250_CR25","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/j.cie.2010.03.012","volume":"59","author":"Y Kuo","year":"2010","unstructured":"Kuo Y (2010) Using simulated annealing to minimize fuel consumption for the time-dependent vehicle routing problem. Comput Ind Eng 59:157\u2013165","journal-title":"Comput Ind Eng"},{"key":"3250_CR26","doi-asserted-by":"crossref","unstructured":"Laporte G (2007) What you should know about the vehicle routing problem. Canada Research Chair in Distribution Management, HEC Montr\u00e9al 3000, Chemin de la C\u00f4te-Sainte-Catherine, Montre\u00e1l, Canada H3T 2A7, pp 1\u20132","DOI":"10.1002\/nav.20261"},{"key":"3250_CR27","doi-asserted-by":"publisher","first-page":"2245","DOI":"10.1002\/j.1538-7305.1965.tb04146.x","volume":"44","author":"S Lin","year":"1965","unstructured":"Lin S (1965) Computer solutions of the traveling salesman problem. Bell Syst Tech J 44:2245\u20132269","journal-title":"Bell Syst Tech J"},{"key":"3250_CR28","doi-asserted-by":"publisher","first-page":"1683","DOI":"10.1016\/j.cor.2008.04.005","volume":"36","author":"SW Lin","year":"2009","unstructured":"Lin SW, Yu VF, Chou SY (2009) Solving the truck and trailer routing problem based on a simulated annealing heuristic. Comput Oper Res 36:1683\u20131692","journal-title":"Comput Oper Res"},{"key":"3250_CR29","unstructured":"Mauri GR (2006) Uma nova abordagem para o problema de roteiriza\u00e7\u00e3o de ve\u00edculos e programa\u00e7\u00e3o de ve\u00edculos. S\u00e3o Jos\u00e9 dos Campos. Monografia (Exame de Qualifica\u00e7\u00e3o do Curso Doutorado em Computa\u00e7\u00e3o Aplicada) \u2013 Instituto Nacional de Pesquisas Espaciais, S\u00e3o Jos\u00e9 dos Campos"},{"key":"3250_CR30","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.1063\/1.1699114","volume":"21","author":"N Metropolis","year":"1953","unstructured":"Metropolis N, Rosenbluth AW, Rosenbluth MN, Teller AH, Teller E (1953) Equation of state calculations by fast computing machines. J Chem Phys 21:1087\u20131092","journal-title":"J Chem Phys"},{"key":"3250_CR31","doi-asserted-by":"publisher","unstructured":"Ngueveu SU, Prins C, Calvo RW (2009) A Hybrid Tabu Search for the m-Peripatetic Vehicle Routing Problem. In book: Matheuristics, pp 253\u2013266. https:\/\/doi.org\/10.1007\/978-1-4419-1306-7_11","DOI":"10.1007\/978-1-4419-1306-7_11"},{"issue":"4","key":"3250_CR32","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/s10288-010-0148-2","volume":"8","author":"SU Ngueveu","year":"2010","unstructured":"Ngueveu SU, Prins C, Calvo RW (2010) Lower and upper bounds for the m-peripatetic vehicle routing problem. 4OR Q J Oper Res 8(4):387\u2013406. https:\/\/doi.org\/10.1007\/s10288-010-0148-2","journal-title":"4OR Q J Oper Res"},{"key":"3250_CR33","unstructured":"Novaes AGN (2015) Log\u00edstica e gerenciamento da cadeia de distribui\u00e7\u00e3o, vol 1, 4th edn. Elsevier Editora Ltd., Rio de Janeiro, p 404"},{"key":"3250_CR34","unstructured":"Or I (1976) Traveling salesman-type combinatorial problems and their relation to the logistics of regional blood banking. Ph.D. Thesis, Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, IL"},{"issue":"1\u20134","key":"3250_CR35","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/BF02023004","volume":"41","author":"I Osman","year":"1993","unstructured":"Osman I (1993) Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Ann Oper Res 41(1\u20134):421\u2013451","journal-title":"Ann Oper Res"},{"issue":"2","key":"3250_CR36","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1287\/trsc.31.2.170","volume":"31","author":"E Taillard","year":"1997","unstructured":"Taillard E, Badeau P, Gendreau M, Guertin F, Potvin J (1997) A Tabu search heuristic for the vehicle routing problem with soft time windows. Transp Sci 31(2):170\u2013186","journal-title":"Transp Sci"},{"issue":"2","key":"3250_CR37","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1016\/j.ejor.2015.01.040","volume":"244","author":"L Talarico","year":"2015","unstructured":"Talarico L, S\u00f6rensen K, Springael J (2015) Metaheuristics for the risk-constrained cash-in-transit vehicle routing problem. Eur J Oper Res 244(2):457\u2013470","journal-title":"Eur J Oper Res"},{"key":"3250_CR38","unstructured":"Subramanian A (2012) Heuristic, exact and hybrid approaches for vehicle routing problem. Doctoral Thesis, Universidade Federal Fluminense, Niter\u00f3i"},{"issue":"6","key":"3250_CR39","doi-asserted-by":"publisher","first-page":"4073","DOI":"10.1016\/j.eswa.2009.11.027","volume":"37","author":"J Tang","year":"2010","unstructured":"Tang J, Zhang J, Pan Z (2010) A scatter search algorithm for solving vehicle routing problem with loading cost. Expert Syst Appl 37(6):4073\u20134083","journal-title":"Expert Syst Appl"},{"issue":"18","key":"3250_CR40","doi-asserted-by":"publisher","first-page":"7468","DOI":"10.1016\/j.eswa.2013.06.068","volume":"40","author":"J Tang","year":"2013","unstructured":"Tang J, Ma Y, Guan J, Yan C (2013) A max\u2013min ant system for the split delivery weighted vehicle routing problem. Expert Syst Appl 40(18):7468\u20137477","journal-title":"Expert Syst Appl"},{"key":"3250_CR41","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.cor.2014.07.005","volume":"52","author":"D Tas","year":"2014","unstructured":"Tas D, Jabali O, Woensel TV (2014) A vehicle routing problem with flexible time windows. Comput Oper Res 52:39\u201354","journal-title":"Comput Oper Res"},{"key":"3250_CR42","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1016\/j.amc.2005.09.040","volume":"176","author":"R Tavakkoli-Moghaddam","year":"2006","unstructured":"Tavakkoli-Moghaddam R, Safaei N, Gholipour Y (2006) A hybrid simulated annealing for capacitated vehicle routing problems with the independent route length. Appl Math Comput 176:445\u2013454","journal-title":"Appl Math Comput"},{"issue":"2","key":"3250_CR43","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.jmsy.2011.04.005","volume":"30","author":"R Tavakkoli-Moghaddam","year":"2011","unstructured":"Tavakkoli-Moghaddam R, Gazanfari M, Alinaghian M, Salamatbakhsh A, Norouzi N (2011) A new mathematical model for a competitive vehicle routing problem with time windows solved by simulated annealing. J Manuf Syst 30(2):83\u201392","journal-title":"J Manuf Syst"},{"key":"3250_CR44","unstructured":"TON (Times of News) (2017) Brazil has 6th highest cargo transport risk rate in world. Brazil has 6th highest cargo transport risk rate in world. http:\/\/brazil.timesofnews.com\/brazil-has-6th-highest-cargo-transport-risk-rate-in-world.html . Accessed 14 Mar 2017"},{"issue":"3\u20134","key":"3250_CR45","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1016\/S0360-8352(97)00171-X","volume":"33","author":"A Torki","year":"1997","unstructured":"Torki A, Somhon S, Enkawa T (1997) A competitive neural network algorithm for solving vehicle routing problem. Comput Ind Eng 33(3\u20134):473\u2013476","journal-title":"Comput Ind Eng"},{"key":"3250_CR46","doi-asserted-by":"publisher","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"},{"issue":"3","key":"3250_CR47","doi-asserted-by":"publisher","first-page":"843","DOI":"10.1016\/j.ejor.2017.08.035","volume":"265","author":"L Wei","year":"2018","unstructured":"Wei L, Zhang Z, Zhang D, Leung SCH (2018) A simulated annealing algorithm for the capacitated vehicle routing problem with two-dimensional loading constraints. Eur J Oper Res 265(3):843\u2013859","journal-title":"Eur J Oper Res"},{"key":"3250_CR48","doi-asserted-by":"publisher","first-page":"1419","DOI":"10.1016\/j.cor.2011.08.013","volume":"39","author":"YY Xiao","year":"2012","unstructured":"Xiao YY, Zhao QH, Kaku I, Xu YC (2012) Development of a fuel consumption optimization model for the capacitated vehicle routing problem. Comput Oper Res 39:1419\u20131431","journal-title":"Comput Oper Res"},{"key":"3250_CR49","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1016\/j.eswa.2010.06.082","volume":"38","author":"B Yu","year":"2011","unstructured":"Yu B, Yang ZZ, Yao BZ (2011) A hybrid algorithm for vehicle routing problem with time windows. Expert Syst Appl 38:435\u2013441","journal-title":"Expert Syst Appl"},{"issue":"2","key":"3250_CR50","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1016\/j.cie.2009.10.007","volume":"58","author":"VF Yu","year":"2010","unstructured":"Yu VF, Lin S-W, Lee W, Ting C-J (2010) A simulated annealing heuristic for the capacitated location routing problem. Comput Ind Eng 58(2):288\u2013299","journal-title":"Comput Ind Eng"},{"key":"3250_CR51","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1016\/j.asoc.2014.06.024","volume":"24","author":"VF Yu","year":"2014","unstructured":"Yu VF, Lin S-W (2014) Multi-start simulated annealing heuristic for the location routing problem with simultaneous pickup and delivery. Appl Soft Comput 24:284\u2013290","journal-title":"Appl Soft Comput"},{"key":"3250_CR52","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1016\/j.cor.2014.10.009","volume":"62","author":"VF Yu","year":"2015","unstructured":"Yu VF, Lin S-Y (2015) A simulated annealing heuristic for the open location-routing problem. Comput Oper Res 62:184\u2013196","journal-title":"Comput Oper Res"},{"key":"3250_CR53","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/j.asoc.2016.12.027","volume":"53","author":"VF Yu","year":"2017","unstructured":"Yu VF, Redi AANP, Hidayat YA, Wibowo OJ (2017) A simulated annealing heuristic for the hybrid vehicle routing problem. Appl Soft Comput 53:119\u2013132","journal-title":"Appl Soft Comput"},{"issue":"2","key":"3250_CR54","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/j.ejor.2012.01.035","volume":"220","author":"Z Zang","year":"2012","unstructured":"Zang Z, Qin H, Zhu W, Lim A (2012) The single vehicle routing problem with toll-by-weight scheme: a branch-and-bound approach. Eur J Oper Res 220(2):295\u2013304","journal-title":"Eur J Oper Res"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-018-3250-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-018-3250-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-018-3250-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,2]],"date-time":"2020-11-02T11:16:14Z","timestamp":1604315774000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-018-3250-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,24]]},"references-count":54,"journal-issue":{"issue":"14","published-print":{"date-parts":[[2019,7]]}},"alternative-id":["3250"],"URL":"https:\/\/doi.org\/10.1007\/s00500-018-3250-6","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"type":"print","value":"1432-7643"},{"type":"electronic","value":"1433-7479"}],"subject":[],"published":{"date-parts":[[2018,5,24]]},"assertion":[{"value":"24 May 2018","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":"The authors declare that there is no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}