{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T11:50:06Z","timestamp":1768650606983,"version":"3.49.0"},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2018,3,19]],"date-time":"2018-03-19T00:00:00Z","timestamp":1521417600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,3,19]],"date-time":"2018-03-19T00:00:00Z","timestamp":1521417600000},"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":["Oper Res Int J"],"published-print":{"date-parts":[[2020,9]]},"DOI":"10.1007\/s12351-018-0392-3","type":"journal-article","created":{"date-parts":[[2018,3,19]],"date-time":"2018-03-19T15:51:36Z","timestamp":1521474696000},"page":"1321-1352","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["A genetic algorithm based approach to solve multi-resource multi-objective knapsack problem for vegetable wholesalers in fuzzy environment"],"prefix":"10.1007","volume":"20","author":[{"given":"Chiranjit","family":"Changdar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rajat Kumar","family":"Pal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ghanshaym Singha","family":"Mahapatra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abhinandan","family":"Khan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,3,19]]},"reference":[{"issue":"2","key":"392_CR1","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1016\/j.ijpe.2011.12.011","volume":"141","author":"F Aisopos","year":"2013","unstructured":"Aisopos F, Tserpes K, Varvarigou T (2013) Resource management in software as a service using the knapsack problem model. Int J Prod Econ 141(2):465\u2013477","journal-title":"Int J Prod Econ"},{"issue":"3","key":"392_CR2","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1016\/0377-2217(94)00285-1","volume":"89","author":"A Bagchi","year":"1996","unstructured":"Bagchi A, Bhattacharyya N, Chakravarti N (1996) LP relaxation of the two dimensional knapsack problem with box and GUB constraints. Eur J Oper Res 89(3):609\u2013617","journal-title":"Eur J Oper Res"},{"issue":"4","key":"392_CR3","first-page":"603","volume":"18","author":"M Balasubbareddy","year":"2015","unstructured":"Balasubbareddy M, Sivanagaraju S, Suresh CV (2015) Multi-objective optimization in the presence of practical constraints using non-dominated sorting hybrid cuckoo search algorithm. Eng Sci Technol Int J 18(4):603\u2013615","journal-title":"Eng Sci Technol Int J"},{"issue":"1","key":"392_CR4","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/j.ejor.2006.02.058","volume":"186","author":"S Balev","year":"2008","unstructured":"Balev S, Yanev N, Freville A, Andonov R (2008) A dynamic programming based reduction procedure for the multidimensional 0\u20131 knapsack problem. Eur J Oper Res 186(1):63\u201376","journal-title":"Eur J Oper Res"},{"issue":"6","key":"392_CR5","doi-asserted-by":"crossref","first-page":"1771","DOI":"10.1016\/j.cor.2005.05.032","volume":"34","author":"T Bektas","year":"2007","unstructured":"Bektas T, Oguz O (2007) On separating cover inequalities for the multidimensional knapsack problem. Comput Oper Res 34(6):1771\u20131776","journal-title":"Comput Oper Res"},{"issue":"2","key":"392_CR6","first-page":"229","volume":"12","author":"MR Bonyadi","year":"2012","unstructured":"Bonyadi MR, Li X (2012) A new discrete electromagnetism-based meta-heuristic for solving the multidimensional knapsack problem using genetic operators. Oper Res 12(2):229\u2013252","journal-title":"Oper Res"},{"issue":"3","key":"392_CR7","doi-asserted-by":"crossref","first-page":"658","DOI":"10.1016\/j.ejor.2007.06.068","volume":"199","author":"V Boyer","year":"2009","unstructured":"Boyer V, Elkihel M, Baz DE (2009) Heuristics for the 0\u20131 multidimensional knapsack problem. Eur J Oper Res 199(3):658\u2013664","journal-title":"Eur J Oper Res"},{"key":"392_CR8","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/j.amc.2013.07.077","volume":"223","author":"C Changdar","year":"2013","unstructured":"Changdar C, Mahapatra GS, Pal RK (2013a) An ant colony optimization approach for binary knapsack problem under fuzziness. Appl Math Comput 223:243\u2013253","journal-title":"Appl Math Comput"},{"issue":"3\/4","key":"392_CR9","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1504\/IJCISTUDIES.2013.057638","volume":"2","author":"C Changdar","year":"2013","unstructured":"Changdar C, Mahapatra GS, Pal RK (2013b)\u00a0Solving 0-1 knapsack problem by continuous ACO algorithm. Int J Comput Intell Stud 2(3\/4): 333\u2013349","journal-title":"Int J Comput Intell Stud"},{"key":"392_CR10","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/j.swevo.2013.11.001","volume":"15","author":"C Changdar","year":"2014","unstructured":"Changdar C, Mahapatra GS, Pal RK (2014) An efficient genetic algorithm for multi objective solid travelling salesman problem under fuzziness. Swarm Evol Comput 15:27\u201337","journal-title":"Swarm Evol Comput"},{"issue":"4","key":"392_CR11","doi-asserted-by":"crossref","first-page":"2276","DOI":"10.1016\/j.eswa.2014.09.006","volume":"42","author":"C Changdar","year":"2015","unstructured":"Changdar C, Mahapatra GS, Pal RK (2015) An improved genetic algorithm based approach to solve constrained knapsack problem in fuzzy environment. Expert Syst Appl 42(4):2276\u20132286","journal-title":"Expert Syst Appl"},{"issue":"20","key":"392_CR12","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1016\/j.ins.2015.07.018","volume":"325","author":"C Dai","year":"2015","unstructured":"Dai C, Wang Y, Ye M (2015) A new multi-objective particle swarm optimization algorithm based on decomposition. Inf Sci 325(20):541\u2013557","journal-title":"Inf Sci"},{"issue":"4","key":"392_CR13","doi-asserted-by":"crossref","first-page":"1627","DOI":"10.1016\/j.asoc.2013.01.014","volume":"13","author":"KK Damghani","year":"2013","unstructured":"Damghani KK, Nojavan M, Tavana M (2013) Solving fuzzy multidimensional multiple-choice knapsack problems: the multi-start partial bound enumeration method versus the efficient epsilon-constraint method. Appl Soft Comput 13(4):1627\u20131638","journal-title":"Appl Soft Comput"},{"issue":"2","key":"392_CR14","first-page":"192","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb K, Pratap A, Agarwal S, Meyarivan T (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6(2):192\u2013197","journal-title":"IEEE Trans Evol Comput"},{"issue":"1","key":"392_CR15","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1016\/j.asoc.2007.02.009","volume":"8","author":"S Dehuri","year":"2008","unstructured":"Dehuri S, Patnaik S, Ghosh A, Mall R (2008) Application of elitist multi-objective genetic algorithm for classification rule generation. Appl Soft Comput 8(1):477\u2013487","journal-title":"Appl Soft Comput"},{"key":"392_CR16","first-page":"24","volume":"5","author":"S Dey","year":"2014","unstructured":"Dey S, Roy TK (2014) A fuzzy programming technique for solving multi-objective structural problem. Int J Eng Manuf 5:24\u201342","journal-title":"Int J Eng Manuf"},{"issue":"1","key":"392_CR17","doi-asserted-by":"crossref","first-page":"2028","DOI":"10.1186\/s40064-016-3685-0","volume":"5","author":"JM Dhodiya","year":"2016","unstructured":"Dhodiya JM, Tailor AR (2016) Genetic algorithm based hybrid approach to solve fuzzy multi-objective assignment problem using exponential membership function. SpringerPlus 5(1):2028","journal-title":"SpringerPlus"},{"key":"392_CR18","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1016\/j.foodcont.2015.08.042","volume":"60","author":"AA Fallah","year":"2016","unstructured":"Fallah AA, Makhtumi Y, Pirali-Kheirabadi K (2016) Seasonal study of parasitic contamination in fresh salad vegetables marketed in Shahrekord, Iran. Food Control 60:538\u2013542","journal-title":"Food Control"},{"issue":"5","key":"392_CR19","doi-asserted-by":"crossref","first-page":"1602","DOI":"10.1016\/j.cor.2008.03.003","volume":"36","author":"K Fleszar","year":"2009","unstructured":"Fleszar K, Hindi KS (2009) Fast, effective heuristics for the 0\u20131 multi-dimensional knapsack problem. Comput Oper Res 36(5):1602\u20131607","journal-title":"Comput Oper Res"},{"key":"392_CR20","unstructured":"Fonseca CM, Fleming PJ (1993) Genetic algorithms for multi-objective optimization: formulation, discussion and generalization. In: Proceedings of the fifth international conference on genetic algorithms, Forrest Ed. 1993, pp 416\u2013423"},{"issue":"2","key":"392_CR21","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1016\/j.cie.2010.12.001","volume":"60","author":"T Ghasemi","year":"2011","unstructured":"Ghasemi T, Razzazi M (2011) Development of core to solve the multidimensional multiple-choice knapsack problem. Comput Ind Eng 60(2):349\u2013360","journal-title":"Comput Ind Eng"},{"issue":"6","key":"392_CR22","doi-asserted-by":"crossref","first-page":"849","DOI":"10.1287\/opre.9.6.849","volume":"9","author":"PC Gilmore","year":"1961","unstructured":"Gilmore PC, Gomory RE (1961) A linear-programming approach to the cutting-stock problem. Oper Res 9(6):849\u2013859","journal-title":"Oper Res"},{"key":"392_CR23","unstructured":"Graffham A, Karehu E, MacGregor J (2007) Fresh insights 6: Impact of EurepGAP on small-scale vegetable growers in Kenya. DFID, IIED, London, UK, pp ix + 78"},{"key":"392_CR24","first-page":"51","volume":"3","author":"AD Guritno","year":"2015","unstructured":"Guritno AD, Fujianti R, Kusumasari D (2015) Assessment of the supply chain factors and classification of inventory management in suppliers\u2019 level of fresh vegetables. Agric Agric Sci Proc 3:51\u201355","journal-title":"Agric Agric Sci Proc"},{"issue":"1","key":"392_CR25","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1016\/j.cor.2009.04.006","volume":"37","author":"B Han","year":"2010","unstructured":"Han B, Leblet J, Simon G (2010) Hard multidimensional multiple choice knapsack problems, an empirical study. Comput Oper Res 37(1):172\u2013181","journal-title":"Comput Oper Res"},{"issue":"6","key":"392_CR26","doi-asserted-by":"crossref","first-page":"768","DOI":"10.1002\/eco.267","volume":"5","author":"JC Han","year":"2012","unstructured":"Han JC, Huang GH, Zhang H, Zhuge YS, He L (2012) Fuzzy constrained optimization of eco-friendly reservoir operation using self-adaptive genetic algorithm: a case study of a cascade reservoir system in the Yalong River, China. Ecohydrology 5(6):768\u2013778","journal-title":"Ecohydrology"},{"key":"392_CR27","unstructured":"Horn J, Nafpliotis N, Goldberge DE (1994) A niched pareto genetic algorithm for multi-objective optimization. In: Proceedings of the first IEEE conference on evolutionary computation (ICEC,94), IEEE Service Centre, Piscataway, NJ, 1994, pp 82\u201387"},{"key":"392_CR28","first-page":"1975","volume-title":"Adaptation in neural and artificial system","author":"J Holland","year":"1975","unstructured":"Holland J (1975) Adaptation in neural and artificial system. University of Michigan press, Ann Arbor, p 1975"},{"key":"392_CR29","unstructured":"Hu ZH (2015) Multi-objective genetic algorithm for berth allocation problem considering daytime preference. Comput Ind Eng, Available online 16 May 2015"},{"key":"392_CR30","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/j.cie.2014.12.001","volume":"86","author":"J Huang","year":"2015","unstructured":"Huang J, Suer GA (2015) A dispatching rule-based genetic algorithm for multi-objective job shop scheduling using fuzzy satisfaction levels. Comput Ind Eng 86:29\u201342","journal-title":"Comput Ind Eng"},{"issue":"3","key":"392_CR31","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/BF02936353","volume":"1","author":"A Karagiannidis","year":"2001","unstructured":"Karagiannidis A, Perkoulidis G, Moussiopoulos N (2001) Multi-objective ranking of pareto-optimal scenarios for regional solid waste management in Central Greece. Oper Res Int J 1(3):225\u2013240","journal-title":"Oper Res Int J"},{"key":"392_CR32","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-24777-7","volume-title":"Knapsack problems","author":"H Kellerer","year":"2004","unstructured":"Kellerer H, Pferschy U, Pisinger D (2004) Knapsack problems. Springer, Berlin"},{"issue":"16","key":"392_CR33","doi-asserted-by":"crossref","first-page":"1827","DOI":"10.1016\/j.dam.2010.04.006","volume":"159","author":"S Kosuch","year":"2010","unstructured":"Kosuch S, Lisser A (2010) On two-stage stochastic knapsack problems. Discrete Appl Math 159(16):1827\u20131841","journal-title":"Discrete Appl Math"},{"issue":"3","key":"392_CR34","doi-asserted-by":"crossref","first-page":"711","DOI":"10.1016\/j.asoc.2009.08.037","volume":"10","author":"R Kumar","year":"2010","unstructured":"Kumar R, Singh PK (2010) Assessing solution quality of biobjective 0\u20131 knapsack problem using evolutionary and heuristic algorithms. Appl Soft Comput 10(3):711\u2013718","journal-title":"Appl Soft Comput"},{"key":"392_CR35","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/j.cor.2015.09.002","volume":"67","author":"H Lei","year":"2016","unstructured":"Lei H, Wang R, Laporte G (2016) Solving a multi-objective dynamic stochastic districting and routing problem with a co-evolutionary algorithm. Comput Oper Res 67:12\u201324","journal-title":"Comput Oper Res"},{"issue":"5","key":"392_CR36","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1016\/j.orl.2014.06.007","volume":"42","author":"R Levi","year":"2014","unstructured":"Levi R, Perakis G, Romero G (2014) A continuous knapsack problem with separable convex utilities: approximation algorithms and applications. Oper Res Lett 42(5):367\u2013373","journal-title":"Oper Res Lett"},{"key":"392_CR37","doi-asserted-by":"crossref","unstructured":"Liu B (2009) Theory and practice of uncertain programming, vol 239. Springer, Berlin","DOI":"10.1007\/978-3-540-89484-1"},{"issue":"1","key":"392_CR38","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1016\/j.patrec.2015.08.023","volume":"68","author":"F Lobato","year":"2015","unstructured":"Lobato F, Sales C, Araujo I, Tadaiesky V, Dias L, Ramos L, Santana A (2015) Multi-objective genetic algorithm for missing data imputation. Pattern Recogn Lett 68(1):126\u2013131","journal-title":"Pattern Recogn Lett"},{"key":"392_CR39","volume-title":"Knapsack problems: algorithms and computer implementations","author":"S Martello","year":"1990","unstructured":"Martello S, Toth P (1990) Knapsack problems: algorithms and computer implementations. Wiley, Chichester"},{"issue":"2","key":"392_CR40","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/j.2158-1592.2001.tb00001.x","volume":"22","author":"JT Mentzer","year":"2001","unstructured":"Mentzer JT, DeWitt W, Keebler J, Min S, Nix N, Smith C, Zacharia Z (2001) Defining supply chain management. J Bus Logist 22(2):1\u201325","journal-title":"J Bus Logist"},{"key":"392_CR41","unstructured":"Mousavi SM, Mahdavi I, Rezaeian J, Zandieh M (2016) An efficient bi-objective algorithm to solve re-entrant hybrid flow shop scheduling with learning effect and setup times. Oper Res 1\u201336"},{"key":"392_CR42","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/j.sbspro.2012.09.444","volume":"52","author":"TK Perdana","year":"2012","unstructured":"Perdana TK (2012) The triple helix model for fruits and vegetables supply chain management development involving small farmers in order to fulfil the global market demand: a case study in \u201cvalue chain center (vcc) universitas padjadjaran\u201d. Proc Soc Behav Sci 52:80\u201389","journal-title":"Proc Soc Behav Sci"},{"key":"392_CR43","unstructured":"Puchinger, J. (2006). Combining metaheuristics and integer programming for solving cutting and packing problems. Ph.D. thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms"},{"issue":"15","key":"392_CR44","doi-asserted-by":"crossref","first-page":"2200","DOI":"10.1016\/j.dam.2005.04.013","volume":"154","author":"B Thiongane","year":"2006","unstructured":"Thiongane B, Nagih A, Plateau G (2006) Lagrangean heuristics combined with reoptimization for the 0\u20131 bidimensional knapsack problem. Discrete Appl Math 154(15):2200\u20132211","journal-title":"Discrete Appl Math"},{"key":"392_CR46","doi-asserted-by":"crossref","unstructured":"Sillani S, Nassivera F (2015) Consumer behavior in choice of minimally processed vegetables and implications for marketing strategies. Trends Food Sci Technol, Accepted, available online 10 July 2015","DOI":"10.1016\/j.tifs.2015.07.004"},{"key":"392_CR47","unstructured":"Soto-Silva WE, Nadal-Roig E, Gonzalez-Araya MC, Pla-Aragones LM (2015) Operational research models applied to the fresh fruit supply chain. Accepted, available online 8 Sept 2015"},{"issue":"3","key":"392_CR48","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1162\/evco.1994.2.3.221","volume":"2","author":"N Srinivas","year":"1994","unstructured":"Srinivas N, Deb K (1994) Multi-objective function optimization using non-dominated sorting genetic algorithms. J Evol Comput 2(3):221\u2013248","journal-title":"J Evol Comput"},{"issue":"35","key":"392_CR49","first-page":"0974","volume":"9","author":"AR Tailor","year":"2016","unstructured":"Tailor AR, Dhodiya JM (2016a) A genetic algorithm based hybrid approach to solve multi-objective interval assignment problem by estimation theory. Indian J Sci Technol 9(35):0974\u20135645","journal-title":"Indian J Sci Technol"},{"issue":"2","key":"392_CR50","doi-asserted-by":"crossref","first-page":"1","DOI":"10.9734\/BJMCS\/2016\/26988","volume":"17","author":"AR Tailor","year":"2016","unstructured":"Tailor AR, Dhodiya JM (2016b) Genetic algorithm based hybrid approach to solve optimistic, most-likely and pessimistic scenarios of fuzzy multi-objective assignment problem using exponential membership function. Br J Math Comput Sci 17(2):1\u201319","journal-title":"Br J Math Comput Sci"},{"issue":"3","key":"392_CR51","doi-asserted-by":"crossref","first-page":"1109","DOI":"10.1016\/j.ejor.2005.12.047","volume":"183","author":"G Wascher","year":"2007","unstructured":"Wascher G, Hau\u00dfner H, Schumann H (2007) An improved typology of cutting and packing problems. Eur J Oper Res 183(3):1109\u20131130","journal-title":"Eur J Oper Res"},{"key":"392_CR52","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/j.jrurstud.2014.04.002","volume":"35","author":"SCO Wertheim-Heck","year":"2014","unstructured":"Wertheim-Heck SCO, Spaargaren G, Vellema S (2014) Food safety in everyday life: shopping for vegetables in a rural city in Vietnam. J Rural Stud 35:37\u201348","journal-title":"J Rural Stud"},{"key":"392_CR53","doi-asserted-by":"crossref","first-page":"766","DOI":"10.1016\/j.asoc.2015.06.033","volume":"35","author":"Y Xiang","year":"2015","unstructured":"Xiang Y, Zhou Y (2015) A dynamic multi-colony artificial bee colony algorithm for multi-objective optimization. Appl Soft Comput 35:766\u2013785","journal-title":"Appl Soft Comput"},{"key":"392_CR54","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0165-0114(78)90029-5","volume":"1","author":"LA Zadeh","year":"1978","unstructured":"Zadeh LA (1978) Fuzzy sets as a basis for a theory of possibility. Fuzzy Sets Syst 1:3\u201328","journal-title":"Fuzzy Sets Syst"},{"issue":"1","key":"392_CR55","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/j.ins.2015.09.006","volume":"329","author":"Z Zhu","year":"2016","unstructured":"Zhu Z, Xiao J, He S, Ji Z, Sun Y (2016) A multi-objective memetic algorithm based on locality-sensitive hashing for one-to-many-to-one dynamic pickup-and-delivery problem. Inf Sci 329(1):73\u201389","journal-title":"Inf Sci"}],"container-title":["Operational Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-018-0392-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12351-018-0392-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-018-0392-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,29]],"date-time":"2020-10-29T16:30:33Z","timestamp":1603989033000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12351-018-0392-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3,19]]},"references-count":54,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,9]]}},"alternative-id":["392"],"URL":"https:\/\/doi.org\/10.1007\/s12351-018-0392-3","relation":{},"ISSN":["1109-2858","1866-1505"],"issn-type":[{"value":"1109-2858","type":"print"},{"value":"1866-1505","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,3,19]]},"assertion":[{"value":"13 December 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 November 2017","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 March 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 March 2018","order":4,"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 have no potential conflict of interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"All authors have equally contributed towards the current version of the manuscript.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Author Contributions"}}]}}