{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,28]],"date-time":"2026-06-28T16:06:26Z","timestamp":1782662786744,"version":"3.54.5"},"reference-count":59,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2020,11,4]],"date-time":"2020-11-04T00:00:00Z","timestamp":1604448000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,11,4]],"date-time":"2020-11-04T00:00:00Z","timestamp":1604448000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2021,3]]},"DOI":"10.1007\/s00500-020-05406-5","type":"journal-article","created":{"date-parts":[[2020,11,4]],"date-time":"2020-11-04T09:08:38Z","timestamp":1604480918000},"page":"3775-3794","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":72,"title":["Bi-heuristic ant colony optimization-based approaches for traveling salesman problem"],"prefix":"10.1007","volume":"25","author":[{"given":"Nizar","family":"Rokbani","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Raghvendra","family":"Kumar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ajith","family":"Abraham","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Adel M.","family":"Alimi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hoang Viet","family":"Long","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ishaani","family":"Priyadarshini","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Le Hoang","family":"Son","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,11,4]]},"reference":[{"issue":"1","key":"5406_CR1","first-page":"31","volume":"3","author":"K AL-Wagih","year":"2015","unstructured":"AL-Wagih K (2015) An improved flower pollination algorithm for solving integer programming problems. Appl Math Inf Sci Lett 3(1):31\u201337","journal-title":"Appl Math Inf Sci Lett"},{"key":"5406_CR2","unstructured":"Ariyaratne A, Fernando TGI, Weerakoon S (2016) A self-tuning firefly algorithm to tune the parameters of ant colony system (ACSFA)"},{"key":"5406_CR3","doi-asserted-by":"publisher","unstructured":"Bidar M, Kanan HR (2013) Modified firefly algorithm using fuzzy tuned parameters. 13th Iranian Conference on Fuzzy Systems (IFSC). DOI:https:\/\/doi.org\/10.1109\/IFSC.2013.6675634","DOI":"10.1109\/IFSC.2013.6675634"},{"issue":"6","key":"5406_CR4","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1287\/opre.6.6.791","volume":"6","author":"GA Croes","year":"1958","unstructured":"Croes GA (1958) A method for solving traveling-salesman problems. Oper Res 6(6):791\u2013812. https:\/\/doi.org\/10.1287\/opre.6.6.791","journal-title":"Oper Res"},{"issue":"1","key":"5406_CR5","doi-asserted-by":"publisher","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 Evol Comput 1(1):3\u201318","journal-title":"Swarm Evol Comput"},{"key":"5406_CR6","doi-asserted-by":"crossref","unstructured":"Dhiman G (2019) ESA: a hybrid bio-inspired metaheuristic optimization approach for engineering problems. Eng Comput, pp 1\u201331","DOI":"10.1007\/s00366-019-00826-w"},{"issue":"5","key":"5406_CR7","doi-asserted-by":"publisher","first-page":"5006","DOI":"10.1016\/j.eswa.2011.10.012","volume":"39","author":"G Dong","year":"2012","unstructured":"Dong G, Guo WW, Tickle K (2012) Solving the traveling salesman problem using cooperative genetic ant systems. Expert Syst Appl 39(5):5006\u20135011","journal-title":"Expert Syst Appl"},{"key":"5406_CR8","doi-asserted-by":"publisher","first-page":"1462","DOI":"10.4249\/scholarpedia.1462","volume":"2","author":"M Dorigo","year":"2007","unstructured":"Dorigo M, Birattari M (2007) Swarm intelligence. Scholarpedia 2:1462","journal-title":"Scholarpedia"},{"issue":"2","key":"5406_CR9","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/S0303-2647(97)01708-5","volume":"43","author":"M Dorigo","year":"1997","unstructured":"Dorigo M, Gambardella LM (1997) Ant colonies for the travelling salesman problem. Biosystems 43(2):73\u201381","journal-title":"Biosystems"},{"key":"5406_CR10","doi-asserted-by":"crossref","unstructured":"Dorigo M, Stutzle T (2004) Ant Colony Optimization, Massachusetts Institute of Technology","DOI":"10.7551\/mitpress\/1290.001.0001"},{"key":"5406_CR11","doi-asserted-by":"crossref","unstructured":"Elloumi W, Rokbani N, Alimi AM (2009) \u201cAnt supervised by PSO\u201d. In: Proceedings of International symposium on Computational Intelligence and Intelligent Informatics, pp 161\u2013166","DOI":"10.1109\/ISCIII.2009.5342263"},{"issue":"5","key":"5406_CR12","doi-asserted-by":"publisher","first-page":"1669","DOI":"10.1007\/s00500-016-2432-3","volume":"22","author":"\u0179 G\u00fclc\u00fc","year":"2018","unstructured":"G\u00fclc\u00fc \u0179, Mahi M, Baykan \u00d6K, KodazH. (2018) A parallel cooperative hybrid method based on ant colony optimization and 3-Opt algorithm for solving traveling salesman problem. Soft Comput. 22(5):1669\u20131685","journal-title":"Soft Comput."},{"issue":"1","key":"5406_CR13","doi-asserted-by":"publisher","first-page":"103","DOI":"10.3906\/elk-1210-147","volume":"23","author":"M G\u00fcnd\u00fcz","year":"2015","unstructured":"G\u00fcnd\u00fcz M, Kiran MS, \u00d6zceylan E (2015) A hierarchic approach based on swarm intelligence to solve the traveling salesman problem. Turk J Electr Eng Comput Sci 23(1):103\u2013117. https:\/\/doi.org\/10.3906\/elk-1210-147","journal-title":"Turk J Electr Eng Comput Sci"},{"key":"5406_CR14","doi-asserted-by":"crossref","unstructured":"Hassanien AE, Rizk-Allah RM, Elhoseny M (2018) A hybrid crow search algorithm based on rough searching scheme for solving engineering optimization problems.\u00a0J Ambient Intell Humaniz Comput, pp 1\u201325","DOI":"10.1007\/s12652-018-0924-y"},{"key":"5406_CR15","doi-asserted-by":"crossref","unstructured":"Helsgaun, k. (2009). \u201cAn effective implementation of K-opt moves for the Lin-Kernighan TSP Heuristic\u201d, Math Progr Comput, pp 119\u2013163","DOI":"10.1007\/s12532-009-0004-6"},{"key":"5406_CR16","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/j.egypro.2012.02.101","volume":"17","author":"K Jun-man","year":"2012","unstructured":"Jun-man K, Yi Z (2012) Application of an improved ant colony optimization on generalized traveling salesman problem. Energy Procedia 17:319\u2013325","journal-title":"Energy Procedia"},{"key":"5406_CR17","doi-asserted-by":"crossref","unstructured":"Junqiang W, Aijia O (2012) A hybrid algorithm of ACO and delete-cross method for TSP. In: Proceedings of the 2012 International Conference on Industrial Control and Electronics Engineering, pp. 1694\u20131696, IEEE","DOI":"10.1109\/ICICEE.2012.448"},{"key":"5406_CR18","unstructured":"Karaboga D (2005) An idea based on honey bee swarm for numerical optimization, Technical Report-TR06"},{"key":"5406_CR58","doi-asserted-by":"crossref","unstructured":"Karaboga D, Gorkemli B (2011) A combinatorial artificial bee colony algorithm for traveling salesman problem. In: 2011 International symposium on innovations in intelligent systems and applications, IEEE, pp 50\u201353","DOI":"10.1109\/INISTA.2011.5946125"},{"key":"5406_CR19","doi-asserted-by":"crossref","unstructured":"Kave A, Ghazaan MI (2019) A new VPS-based algorithm for multi-objective optimization problems. Eng Comput, pp 1\u201312.","DOI":"10.1007\/s00366-019-00747-8"},{"key":"5406_CR20","doi-asserted-by":"crossref","unstructured":"Kefi S, Rokbani N, Kr\u00f6mer P, Alimi AM (2016) \u201cAnt supervised by PSO and 2-opt algorithm, AS-PSO-2Opt, applied to traveling salesman problem\u201d. IEEE International conference on System Man and Cybernetics SMC","DOI":"10.1109\/SMC.2016.7844999"},{"key":"5406_CR21","doi-asserted-by":"crossref","unstructured":"Kefi S, Rokbani N, Alimi AM (2016) Impact of ant size on ant supervised by PSO, AS-PSO, performances. In:\u00a0International Conference on Hybrid Intelligent Systems, pp 567\u2013577. Springer, Cham","DOI":"10.1007\/978-3-319-52941-7_56"},{"key":"5406_CR22","doi-asserted-by":"crossref","unstructured":"Kennedy J, Eberhart R (1995) Particle swarm optimization. In: IEEE International Conference on Neural Networks, pp 1942\u20131948","DOI":"10.1109\/ICNN.1995.488968"},{"issue":"1","key":"5406_CR23","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1016\/j.ijcac.2015.12.001","volume":"2","author":"P Kora","year":"2016","unstructured":"Kora P, Rama Krishna KS (2016) Hybrid firefly and particle swarm optimization algorithm for the detection of bundle branch block. Int J Cardiovasc Acad 2(1):44\u201348. https:\/\/doi.org\/10.1016\/j.ijcac.2015.12.001","journal-title":"Int J Cardiovasc Acad"},{"key":"5406_CR24","first-page":"53","volume":"2","author":"SN Kumbharana","year":"2013","unstructured":"Kumbharana SN, Pandey PGM (2013) Solving travelling salesman problem using firefly algorithm. Int J Res Sci Adv Technol 2:53\u201357","journal-title":"Int J Res Sci Adv Technol"},{"issue":"Supplement C","key":"5406_CR25","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1016\/j.asoc.2015.01.068","volume":"30","author":"M Mahi","year":"2015","unstructured":"Mahi M, Baykan \u00d6K, Kodaz H (2015) A new hybrid method based on particle swarm optimization, ant colony optimization and 3-Opt algorithms for traveling salesman problem. Appl Soft Comput 30(Supplement C):484\u2013490","journal-title":"Appl Soft Comput"},{"key":"5406_CR26","doi-asserted-by":"crossref","unstructured":"Matai R, Singh S, Mittal ML (2010) Traveling Salesman Problem: an Overview of Applications, Formulations, and Solution Approaches (D. Davendra Ed.): Traveling Salesman Problem, Theory and Applications","DOI":"10.5772\/12909"},{"key":"5406_CR27","unstructured":"MATLAB Statistics Toolbox User\u2019s Guide (2014). The MathWorksInc. http:www.mathworks.com\/help\/pdf_doc\/stats\/stats.pdf"},{"issue":"3\u20134","key":"5406_CR28","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1007\/s00521-013-1525-5","volume":"25","author":"S Mirjalili","year":"2014","unstructured":"Mirjalili S, Mirjalili SM, Yang XS (2014) Binary bat algorithm. Neural Comput Appl 25(3\u20134):663\u2013681","journal-title":"Neural Comput Appl"},{"key":"5406_CR29","doi-asserted-by":"publisher","DOI":"10.1155\/2016\/8932896","author":"AM Mohsen","year":"2016","unstructured":"Mohsen AM (2016) Annealing ant colony optimization with mutation operator for solving TSP. Comput Intell Neurosci. https:\/\/doi.org\/10.1155\/2016\/8932896","journal-title":"Comput Intell Neurosci"},{"key":"5406_CR30","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1016\/j.eswa.2016.03.047","volume":"57","author":"E Nabil","year":"2016","unstructured":"Nabil E (2016) A modified flower pollination algorithm for global optimization. Expert Syst Appl 57:192\u2013203","journal-title":"Expert Syst Appl"},{"key":"5406_CR31","first-page":"2347","volume":"5","author":"N Nekouie","year":"2015","unstructured":"Nekouie N, Yaghoobi M (2015) MFASA: A new memetic firefly algorithm based on simulated annealing. Int J Mech Electr Comput Technol 5:2347\u20132354","journal-title":"Int J Mech Electr Comput Technol"},{"key":"5406_CR32","doi-asserted-by":"crossref","unstructured":"Olief I, Farisi R, Setiyono B, Danandjojo RI (2016) A Hybrid firefly algorithm\u2013ant colony optimization for traveling salesman problem open journal systems, p 7","DOI":"10.24002\/jbi.v7i1.484"},{"key":"5406_CR33","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.engappai.2015.10.006","volume":"48","author":"E Osaba","year":"2016","unstructured":"Osaba E, Yang XS, Diaz F, Lopez-Garcia P, Carballedo R (2016) An improved discrete bat algorithm for symmetric and asymmetric traveling salesman problems. Eng Appl Artif Intell 48:59\u201371","journal-title":"Eng Appl Artif Intell"},{"key":"5406_CR34","doi-asserted-by":"publisher","first-page":"618","DOI":"10.1016\/j.asoc.2009.08.029","volume":"10","author":"MEH Pedersen","year":"2010","unstructured":"Pedersen MEH, Chipperfield AJ (2010) Simplifying particle swarm optimization. Appl Soft Comput 10:618\u2013628","journal-title":"Appl Soft Comput"},{"issue":"1","key":"5406_CR35","doi-asserted-by":"publisher","first-page":"2015","DOI":"10.3906\/elk-1109-44","volume":"21","author":"M Peker","year":"2013","unstructured":"Peker M, \u015een B, Kumru PY (2013) An efficient solving of the traveling salesman problem: the ant colony system having parameters optimized by the Taguchi method. Turk J Electr Eng Comput Sci 21(1):2015\u20132036","journal-title":"Turk J Electr Eng Comput Sci"},{"key":"5406_CR36","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.3.4.376","author":"G Reinelt","year":"1991","unstructured":"Reinelt G (1991) TSPLIB\u2014A traveling salesman problem library. ORSA J Comput. https:\/\/doi.org\/10.1287\/ijoc.3.4.376","journal-title":"ORSA J Comput"},{"issue":"1","key":"5406_CR37","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s40747-017-0050-z","volume":"4","author":"RM Rizk-Allah","year":"2018","unstructured":"Rizk-Allah RM, Hassanien AE (2018) New binary bat algorithm for solving 0\u20131 knapsack problem. Complex Intell Syste 4(1):31\u201353","journal-title":"Complex Intell Syste"},{"key":"5406_CR38","first-page":"473","volume":"224","author":"RM Rizk-Allah","year":"2013","unstructured":"Rizk-Allah RM, Zaki EM, El-Sawy AA (2013) Hybridizing ant colony optimization with firefly algorithm for unconstrained optimization problems. Appl Math Comput 224:473\u2013483","journal-title":"Appl Math Comput"},{"issue":"3","key":"5406_CR39","doi-asserted-by":"publisher","first-page":"1235","DOI":"10.1007\/s11227-016-1806-8","volume":"73","author":"RM Rizk-Allah","year":"2017","unstructured":"Rizk-Allah RM, El-Sehiemy RA, Deb S, Wang GG (2017) A novel fruit fly framework for multi-objective shape design of tubular linear synchronous motor. J Supercomput 73(3):1235\u20131256","journal-title":"J Supercomput"},{"key":"5406_CR40","doi-asserted-by":"publisher","first-page":"1161","DOI":"10.1016\/j.asoc.2018.03.019","volume":"71","author":"RM Rizk-Allah","year":"2018","unstructured":"Rizk-Allah RM, Hassanien AE, Bhattacharyya S (2018) Chaotic crow search algorithm for fractional optimization problems. Appl Soft Comput 71:1161\u20131175","journal-title":"Appl Soft Comput"},{"key":"5406_CR41","doi-asserted-by":"crossref","unstructured":"Rokbani N, Abraham A, Alimi AM (2013) Fuzzy ant supervised by PSO and simplified ant supervised PSO applied to TSP\u201d. In: The 13th International conference on hybrid intelligent systems (HIS), pp 251\u2013255","DOI":"10.1109\/HIS.2013.6920491"},{"key":"5406_CR42","first-page":"148","volume":"4","author":"N Rokbani","year":"2013","unstructured":"Rokbani N, Momasso AL, Alimi AM (2013) \u2018\u2018AS-PSO ant supervised by PSO meta-heuristic with application to TSP. Proc Eng Technol 4:148\u2013152","journal-title":"Proc Eng Technol"},{"key":"5406_CR43","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/978-3-319-11017-2_15","volume-title":"Computational intelligence applications in modeling and control","author":"N Rokbani","year":"2015","unstructured":"Rokbani N, Casals A, Alimi AM (2015) IK-FA, a New heuristic inverse kinematics solver using firefly algorithm. In: Azar AT, Vaidyanathan S (eds) Computational intelligence applications in modeling and control. Springer International Publishing, Cham, pp 369\u2013395"},{"issue":"1","key":"5406_CR44","doi-asserted-by":"publisher","first-page":"17","DOI":"10.3233\/HIS-180258","volume":"15","author":"N Rokbani","year":"2019","unstructured":"Rokbani N, Abraham A, Twir I, Haqiq A (2019) Solving the travelling salesman problem using fuzzy and simplified variants of ant supervised by PSO with local search policy, FAS-PSO-LS, SAS-PSO-LS. Int J Hybrid Intell Syst 15(1):17\u201326","journal-title":"Int J Hybrid Intell Syst"},{"issue":"4","key":"5406_CR45","first-page":"384","volume":"7","author":"N Rokbani","year":"2019","unstructured":"Rokbani N, Kromer P, Twir I, Alimi AM (2019) A new hybrid gravitational particle swarm optimisation-ACO with local search mechanism, PSOGSA-ACO-Ls for TSP. Int J Intell Eng Inf 7(4):384\u2013398","journal-title":"Int J Intell Eng Inf"},{"issue":"7","key":"5406_CR46","doi-asserted-by":"publisher","first-page":"1853","DOI":"10.1007\/s00521-015-1978-9","volume":"27","author":"Y Saji","year":"2016","unstructured":"Saji Y, Riffi ME (2016) A novel discrete bat algorithm for solving the travelling salesman problem. Neural Comput Appl 27(7):1853\u20131866","journal-title":"Neural Comput Appl"},{"key":"5406_CR47","unstructured":"Saraei M, Analouei R, Mansouri P (2015) Solving of travelling salesman problem using firefly algorithm with greedy approach. In: Proceeding of the international conference on non-linear system and optimization in computer and electrical engineering"},{"key":"5406_CR48","doi-asserted-by":"crossref","unstructured":"Taengtang T, Sitthivet W, Paithoonwattanakij K (2013)\u201cFermicidae swarm system\u201d. In: Proceedings of the 2013 international conference on information technology and electrical engineering (ICITEE), pp 124\u2013126","DOI":"10.1109\/ICITEED.2013.6676224"},{"issue":"1","key":"5406_CR49","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.ins.2003.11.008","volume":"166","author":"C-F Tsai","year":"2004","unstructured":"Tsai C-F, Tsai C-W, Tseng C-C (2004) A new hybrid heuristic approach for solving large traveling salesman problem. Inf Sci 166(1):67\u201381","journal-title":"Inf Sci"},{"key":"5406_CR57","doi-asserted-by":"crossref","unstructured":"Twir I, Rokbani N, Alimi A (2018) Ant supervised by firefly algorithm with a local search mechanism, ASFA-2Opt. In: 2018 International conference on control, automation and diagnosis (ICCAD), IEEE, pp 1\u20135","DOI":"10.1109\/CADIAG.2018.8751328"},{"key":"5406_CR50","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/978-3-319-47054-2_24","volume-title":"Nature-inspired design of hybrid intelligent systems","author":"L Valenzuela","year":"2017","unstructured":"Valenzuela L, Valdez F, Melin P (2017) Flower pollination algorithm with fuzzy approach for solving optimization problems. In: Melin P, Castillo O, Kacprzyk J (eds) Nature-inspired design of hybrid intelligent systems. Springer, Berlin, pp 357\u2013369"},{"key":"5406_CR51","doi-asserted-by":"crossref","unstructured":"Wang M-b, Fu Q, Tong N, Li M, Zhao Y (2016) An improved firefly algorithm for traveling salesman problems. In: Proceeding of the 4th national conference on electrical, electronics and computer engineering (NCEECE 2015)","DOI":"10.2991\/nceece-15.2016.193"},{"key":"5406_CR52","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/978-1-84882-983-1_15","volume-title":"Research and development in intelligent systems XXVI","author":"XS Yang","year":"2010","unstructured":"Yang XS (2010) Firefly algorithm, Levy flights and global optimization. Research and development in intelligent systems XXVI. Springer, London, pp 209\u2013218"},{"key":"5406_CR53","doi-asserted-by":"publisher","DOI":"10.1080\/0305215X.2013.832237","author":"XS Yang","year":"2013","unstructured":"Yang XS (2013) Flower pollination algorithm: A novel approach for multi- objective optimization. Eng Optim. https:\/\/doi.org\/10.1080\/0305215X.2013.832237","journal-title":"Eng Optim"},{"key":"5406_CR54","doi-asserted-by":"crossref","unstructured":"Yang XS, Gandomi AH (2012) Bat algorithm: a novel approach for global engineering optimization.\u00a0Engineering computations","DOI":"10.1108\/02644401211235834"},{"issue":"7\u20138","key":"5406_CR55","doi-asserted-by":"publisher","first-page":"2051","DOI":"10.1007\/s00521-013-1498-4","volume":"23","author":"XS Yang","year":"2013","unstructured":"Yang XS, Deb S, Loomes M, Karamanoglu M (2013) A framework for self-tuning optimization algorithm. Neural Comput Appl 23(7\u20138):2051\u20132057","journal-title":"Neural Comput Appl"},{"key":"#cr-split#-5406_CR56.1","doi-asserted-by":"crossref","unstructured":"Zhang M, Dai J, Zheng J, Zhang G (2016) 'An improved flower pollination algorithm, In","DOI":"10.1155\/2016\/7343794"},{"key":"#cr-split#-5406_CR56.2","unstructured":"Proceedings of the 2016 13th Web information systems and applications conference (WISA) pp 179-183, IEEE"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-020-05406-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-020-05406-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-020-05406-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,26]],"date-time":"2021-02-26T15:19:00Z","timestamp":1614352740000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-020-05406-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11,4]]},"references-count":59,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2021,3]]}},"alternative-id":["5406"],"URL":"https:\/\/doi.org\/10.1007\/s00500-020-05406-5","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,11,4]]},"assertion":[{"value":"4 November 2020","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 we have no financial and personal relationships with other people or organizations that can inappropriately influence our work; there is no professional or other personal interest of any nature or kind in any product, service and\/or company that could be construed as influencing the position presented in, or the review of, the manuscript entitled.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}