{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T14:53:49Z","timestamp":1776956029564,"version":"3.51.4"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,9,20]],"date-time":"2020-09-20T00:00:00Z","timestamp":1600560000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,9,20]],"date-time":"2020-09-20T00:00:00Z","timestamp":1600560000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100002322","name":"Coordena\u00e7\u00e3o de Aperfei\u00e7oamento de Pessoal de N\u00edvel Superior","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002322","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2021,6]]},"DOI":"10.1007\/s10732-020-09457-7","type":"journal-article","created":{"date-parts":[[2020,9,20]],"date-time":"2020-09-20T10:02:27Z","timestamp":1600596147000},"page":"267-301","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":22,"title":["A non-dominated sorting based customized random-key genetic algorithm for the bi-objective traveling thief problem"],"prefix":"10.1007","volume":"27","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7965-8419","authenticated-orcid":false,"given":"Jonatas B. C.","family":"Chagas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2227-6476","authenticated-orcid":false,"given":"Julian","family":"Blank","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3124-0061","authenticated-orcid":false,"given":"Markus","family":"Wagner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7141-357X","authenticated-orcid":false,"given":"Marcone J. F.","family":"Souza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7402-9939","authenticated-orcid":false,"given":"Kalyanmoy","family":"Deb","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,9,20]]},"reference":[{"key":"9457_CR1","doi-asserted-by":"publisher","DOI":"10.1515\/9781400841103","volume-title":"The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics)","author":"DL Applegate","year":"2007","unstructured":"Applegate, D.L., Bixby, R.E., Chvatal, V., Cook, W.J.: The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics). Princeton University Press, Princeton (2007)"},{"key":"9457_CR2","doi-asserted-by":"crossref","unstructured":"Auger, A., Bader, J., Brockhoff, D., Zitzler, E.: Investigating and exploiting the bias of the weighted hypervolume to articulate user preferences. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 563\u2013570. ACM (2009)","DOI":"10.1145\/1569901.1569980"},{"key":"9457_CR3","first-page":"46","volume-title":"Solving the Bi-objective Traveling Thief Problem with Multi-objective Evolutionary Algorithms","author":"J Blank","year":"2017","unstructured":"Blank, J., Deb, K., Mostaghim, S.: Solving the Bi-objective Traveling Thief Problem with Multi-objective Evolutionary Algorithms, pp. 46\u201360. Springer, Berlin (2017)"},{"key":"9457_CR4","doi-asserted-by":"crossref","unstructured":"Bonyadi, M.R., Michalewicz, Z., Barone, L.: The travelling thief problem: the first step in the transition from theoretical problems to realistic problems. In: 2013 IEEE Congress on Evolutionary Computation, pp. 1037\u20131044. IEEE (2013)","DOI":"10.1109\/CEC.2013.6557681"},{"key":"9457_CR5","doi-asserted-by":"crossref","unstructured":"Bonyadi, M.R., Michalewicz, Z., Przybylek, M.R., Wierzbicki, A.: Socially inspired algorithms for the TTP. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 421\u2013428. ACM (2014)","DOI":"10.1145\/2576768.2598367"},{"key":"9457_CR6","first-page":"13","volume-title":"Evolutionary Computation for Multicomponent Problems: Opportunities and Future Directions","author":"MR Bonyadi","year":"2019","unstructured":"Bonyadi, M.R., Michalewicz, Z., Wagner, M., Neumann, F.: Evolutionary Computation for Multicomponent Problems: Opportunities and Future Directions, pp. 13\u201330. Springer, Berlin (2019)"},{"key":"9457_CR7","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/j.artint.2012.09.005","volume":"195","author":"K Bringmann","year":"2013","unstructured":"Bringmann, K., Friedrich, T.: Approximation quality of the hypervolume indicator. Artif. Intell. 195, 265\u2013290 (2013)","journal-title":"Artif. Intell."},{"issue":"2","key":"9457_CR8","first-page":"35","volume":"20","author":"S Chand","year":"2015","unstructured":"Chand, S., Wagner, M.: Evolutionary many-objective optimization: a quick-start guide. Surv. Oper. Res. Manag. Sci. 20(2), 35\u201342 (2015)","journal-title":"Surv. Oper. Res. Manag. Sci."},{"key":"9457_CR9","doi-asserted-by":"crossref","unstructured":"Chand, S., Wagner, M.: Fast heuristics for the multiple traveling thieves problem. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 293\u2013300. ACM (2016)","DOI":"10.1145\/2908812.2908841"},{"issue":"2","key":"9457_CR10","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6(2), 182\u2013197 (2002)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"9457_CR11","doi-asserted-by":"crossref","unstructured":"El\u00a0Yafrani, M., Ahiod, B.: Population-based vs. single-solution heuristics for the travelling thief problem. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 317\u2013324. ACM (2016)","DOI":"10.1145\/2908812.2908847"},{"key":"9457_CR12","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/j.ins.2017.12.011","volume":"432","author":"M El Yafrani","year":"2018","unstructured":"El Yafrani, M., Ahiod, B.: Efficiently solving the traveling thief problem using hill climbing and simulated annealing. Inf. Sci. 432, 231\u2013244 (2018)","journal-title":"Inf. Sci."},{"issue":"1","key":"9457_CR13","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/s10710-017-9308-x","volume":"19","author":"M El Yafrani","year":"2018","unstructured":"El Yafrani, M., Martins, M., Wagner, M., Ahiod, B., Delgado, M., L\u00fcders, R.: A hyperheuristic approach based on low-level heuristics for the travelling thief problem. Genet. Program. Evolvable Mach. 19(1), 121\u2013150 (2018)","journal-title":"Genet. Program. Evolvable Mach."},{"key":"9457_CR14","doi-asserted-by":"crossref","unstructured":"Faulkner, H., Polyakovskiy, S., Schultz, T., Wagner, M.: Approximate approaches to the traveling thief problem. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 385\u2013392. ACM (2015)","DOI":"10.1145\/2739480.2754716"},{"issue":"5","key":"9457_CR15","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/s10732-010-9143-1","volume":"17","author":"JF Gon\u00e7alves","year":"2011","unstructured":"Gon\u00e7alves, J.F., Resende, M.G.: Biased random-key genetic algorithms for combinatorial optimization. J. Heuristics 17(5), 487\u2013525 (2011)","journal-title":"J. Heuristics"},{"issue":"2","key":"9457_CR16","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/j.cor.2011.03.009","volume":"39","author":"JF Gon\u00e7alves","year":"2012","unstructured":"Gon\u00e7alves, J.F., Resende, M.G.: A parallel multi-population biased random-key genetic algorithm for a container loading problem. Comput. Oper. Res. 39(2), 179\u2013190 (2012)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"9457_CR17","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1016\/j.ijpe.2013.04.019","volume":"145","author":"JF Gon\u00e7alves","year":"2013","unstructured":"Gon\u00e7alves, J.F., Resende, M.G.: A biased random key genetic algorithm for 2D and 3D bin packing problems. Int. J. Prod. Econ. 145(2), 500\u2013510 (2013)","journal-title":"Int. J. Prod. Econ."},{"issue":"1","key":"9457_CR18","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/j.ejor.2015.04.029","volume":"246","author":"JF Gon\u00e7alves","year":"2015","unstructured":"Gon\u00e7alves, J.F., Resende, M.G.: A biased random-key genetic algorithm for the unequal area facility layout problem. Eur. J. Oper. Res. 246(1), 86\u2013107 (2015)","journal-title":"Eur. J. Oper. Res."},{"key":"9457_CR19","unstructured":"Herring, D., Kirley, M., Yao, X.: Dynamic multi-objective optimization of the travelling thief problem. arXiv:2002.02636 (2020)"},{"key":"9457_CR20","unstructured":"Jung, S.Y.: Multidisciplinary design optimization of aircraft wing structures with aeroelastic and aeroservoelastic constraints. Ph.D. thesis, School of Aerospace and Mechanical Engineering (1999)"},{"issue":"1\u20132","key":"9457_CR21","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1002\/mcda.1598","volume":"24","author":"K Klamroth","year":"2017","unstructured":"Klamroth, K., Mostaghim, S., Naujoks, B., Poles, S., Purshouse, R., Rudolph, G., Ruzika, S., Say\u0131n, S., Wiecek, M.M., Yao, X.: Multiobjective optimization for interwoven systems. J. Multi-Criteria Decis. Anal. 24(1\u20132), 71\u201381 (2017a)","journal-title":"J. Multi-Criteria Decis. Anal."},{"issue":"1\u20132","key":"9457_CR22","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1002\/mcda.1598","volume":"24","author":"K Klamroth","year":"2017","unstructured":"Klamroth, K., Mostaghim, S., Naujoks, B., Poles, S., Purshouse, R., Rudolph, G., Ruzika, S., Saym, S., Wiecek, M.M., Yao, X.: Multiobjective optimization for interwoven systems. J. Multi-Criteria Decis. Anal. 24(1\u20132), 71\u201381 (2017b)","journal-title":"J. Multi-Criteria Decis. Anal."},{"issue":"5","key":"9457_CR23","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1109\/TEVC.2005.850260","volume":"9","author":"N Krasnogor","year":"2005","unstructured":"Krasnogor, N., Smith, J.: A tutorial for competent memetic algorithms: model, taxonomy, and design issues. IEEE Trans. Evol. Comput. 9(5), 474\u2013488 (2005)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"9457_CR24","unstructured":"Lagoudakis, M.G.: The 0-1 Knapsack problem\u2013an introductory survey (1996). http:\/\/citeseerx.ist.psu.edu\/viewdoc\/summary?doi=10.1.1.47.4378"},{"key":"9457_CR25","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.asoc.2014.04.035","volume":"22","author":"E Lalla-Ruiz","year":"2014","unstructured":"Lalla-Ruiz, E., Gonz\u00e1lez-Velarde, J.L., Meli\u00e1n-Batista, B., Moreno-Vega, J.M.: Biased random key genetic algorithm for the tactical berth allocation problem. Appl. Soft Comput. 22, 60\u201376 (2014)","journal-title":"Appl. Soft Comput."},{"issue":"2","key":"9457_CR26","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S Lin","year":"1973","unstructured":"Lin, S., Kernighan, B.W.: An effective heuristic algorithm for the traveling-salesman problem. Oper. Res. 21(2), 498\u2013516 (1973)","journal-title":"Oper. Res."},{"key":"9457_CR27","doi-asserted-by":"crossref","unstructured":"Martins, M.S.R., El\u00a0Yafrani, M., Delgado, M.R.B.S., Wagner, M., Ahiod, B., L\u00fcders, R.: Hseda: a heuristic selection approach based on estimation of distribution algorithm for the travelling thief problem. In: Proceedings of the Genetic and Evolutionary Computation Conference, Association for Computing Machinery, New York, NY, USA, GECCO \u201917, pp. 361\u2013368 (2017)","DOI":"10.1145\/3071178.3071235"},{"issue":"1","key":"9457_CR28","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/s00500-014-1487-2","volume":"20","author":"Y Mei","year":"2014","unstructured":"Mei, Y., Li, X., Yao, X.: On investigation of interdependence between sub-problems of the TTP. Soft Comput. 20(1), 157\u2013172 (2014)","journal-title":"Soft Comput."},{"key":"9457_CR29","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/3927.001.0001","volume-title":"An Introduction to Genetic Algorithms","author":"M Mitchell","year":"1998","unstructured":"Mitchell, M.: An Introduction to Genetic Algorithms. MIT Press, Cambridge (1998)"},{"key":"9457_CR30","unstructured":"Namazi, M., Sanderson, C., Newton, M.A.H., Sattar, A.: A cooperative coordination solver for travelling thief problems. arXiv:1911.03124 (2019)"},{"key":"9457_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.swevo.2011.11.003","volume":"2","author":"F Neri","year":"2012","unstructured":"Neri, F., Cotta, C.: Memetic algorithms and memetic computing optimization: a literature review. Swarm Evol. Comput. 2, 1\u201314 (2012)","journal-title":"Swarm Evol. Comput."},{"key":"9457_CR32","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/978-3-030-19759-9_5","volume-title":"Algorithmic Aspects of Cloud Computing","author":"F Neumann","year":"2019","unstructured":"Neumann, F., Polyakovskiy, S., Skutella, M., Stougie, L., Wu, J.: A fully polynomial time approximation scheme for packing while traveling. In: Disser, Y., Verykios, V.S. (eds.) Algorithmic Aspects of Cloud Computing, pp. 59\u201372. Springer, Berlin (2019)"},{"key":"9457_CR33","doi-asserted-by":"crossref","unstructured":"Polyakovskiy, S., Bonyadi, M.R., Wagner, M., Michalewicz, Z., Neumann, F.: A comprehensive benchmark set and heuristics for the traveling thief problem. In: Proceedings of the Genetic and Evolutionary Computation Conference, ACM, New York, NY, USA, GECCO \u201914, pp. 477\u2013484 (2014)","DOI":"10.1145\/2576768.2598249"},{"issue":"1","key":"9457_CR34","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/s11750-011-0176-x","volume":"20","author":"MG Resende","year":"2012","unstructured":"Resende, M.G.: Biased random-key genetic algorithms with applications in telecommunications. Top 20(1), 130\u2013153 (2012)","journal-title":"Top"},{"key":"9457_CR35","doi-asserted-by":"crossref","unstructured":"Sachdeva, R., Neumann, F., Wagner, M.: The dynamic travelling thief problem: Benchmarks and performance of evolutionary algorithms. arXiv:2004.12045 (2020)","DOI":"10.1007\/978-3-030-63823-8_27"},{"key":"9457_CR36","doi-asserted-by":"crossref","unstructured":"Santos, A.G., Chagas, J.B.C.: The thief orienteering problem: formulation and heuristic approaches. In: 2018 IEEE Congress on Evolutionary Computation (CEC), pp. 1191\u20131199. IEEE, Rio de Janeiro, Brazil (2018)","DOI":"10.1109\/CEC.2018.8477853"},{"issue":"1","key":"9457_CR37","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1080\/10556788.2014.890197","volume":"30","author":"RF Toso","year":"2015","unstructured":"Toso, R.F., Resende, M.G.: A C++ application programming interface for biased random-key genetic algorithms. Optim. Methods Softw. 30(1), 81\u201393 (2015)","journal-title":"Optim. Methods Softw."},{"issue":"1","key":"9457_CR38","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/BF02243880","volume":"25","author":"P Toth","year":"1980","unstructured":"Toth, P.: Dynamic programming algorithms for the zero-one knapsack problem. Computing 25(1), 29\u201345 (1980)","journal-title":"Computing"},{"key":"9457_CR39","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/978-3-319-44427-7_25","volume-title":"Swarm Intelligence","author":"M Wagner","year":"2016","unstructured":"Wagner, M.: Stealing items more efficiently with ants: a swarm intelligence approach to the travelling thief problem. In: Dorigo, M., Birattari, M., Li, X., L\u00f3pez-Ib\u00e1\u00f1ez, M., Ohkura, K., Pinciroli, C., St\u00fctzle, T. (eds.) Swarm Intelligence, pp. 273\u2013281. Springer, Berlin (2016)"},{"issue":"2","key":"9457_CR40","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1016\/j.ejor.2014.11.032","volume":"243","author":"M Wagner","year":"2015","unstructured":"Wagner, M., Bringmann, K., Friedrich, T., Neumann, F.: Efficient optimization of many objectives by approximation-guided evolution. Eur. J. Oper. Res. 243(2), 465\u2013479 (2015)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"9457_CR41","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/s10732-017-9328-y","volume":"24","author":"M Wagner","year":"2018","unstructured":"Wagner, M., Lindauer, M., M\u0131s\u0131r, M., Nallaperuma, S., Hutter, F.: A case study of algorithm selection for the traveling thief problem. J. Heuristics 24(3), 295\u2013320 (2018)","journal-title":"J. Heuristics"},{"key":"9457_CR42","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/978-3-319-68759-9_10","volume-title":"Simulated Evolution and Learning","author":"J Wu","year":"2017","unstructured":"Wu, J., Wagner, M., Polyakovskiy, S., Neumann, F.: Exact approaches for the travelling thief problem. In: Shi, Y., Tan, K.C., Zhang, M., Tang, K., Li, X., Zhang, Q., Tan, Y., Middendorf, M., Jin, Y. (eds.) Simulated Evolution and Learning, pp. 110\u2013121. Springer, Berlin (2017)"},{"key":"9457_CR43","doi-asserted-by":"crossref","unstructured":"Wu, J., Polyakovskiy, S., Wagner, M., Neumann, F.: Evolutionary computation plus dynamic programming for the bi-objective travelling thief problem. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 777\u2013784. ACM (2018)","DOI":"10.1145\/3205455.3205488"},{"key":"9457_CR44","doi-asserted-by":"crossref","unstructured":"Wuijts, R.H., Thierens, D.: Investigation of the traveling thief problem. In: Proceedings of the Genetic and Evolutionary Computation Conference, Association for Computing Machinery, New York, NY, USA, GECCO \u201919, pp. 329\u2013337 (2019)","DOI":"10.1145\/3321707.3321766"},{"key":"9457_CR45","doi-asserted-by":"crossref","unstructured":"Yafrani, M.E., Chand, S., Neumann, A., Ahiod, B., Wagner, M.: Multi-objectiveness in the single-objective traveling thief problem. In: Proceedings of the Genetic and Evolutionary Computation Conference Companion, ACM, GECCO \u201917, pp. 107\u2013108 (2017)","DOI":"10.1145\/3067695.3076010"},{"key":"9457_CR46","doi-asserted-by":"crossref","unstructured":"Yafrani, M.E., Martins, M.S.R., Krari, M.E., Wagner, M., Delgado, M.R.B.S., Ahiod, B., L\u00fcders, R.: A fitness landscape analysis of the travelling thief problem. In: Proceedings of the Genetic and Evolutionary Computation Conference, Association for Computing Machinery, New York, NY, USA, GECCO \u201918, pp. 277\u2013284 (2018)","DOI":"10.1145\/3205455.3205537"},{"key":"9457_CR47","doi-asserted-by":"crossref","unstructured":"Zitzler, E., Thiele, L.: Multiobjective optimization using evolutionary algorithms\u2014a comparative case study. In: International conference on parallel problem solving from nature, pp. 292\u2013301. Springer (1998)","DOI":"10.1007\/BFb0056872"},{"key":"9457_CR48","doi-asserted-by":"crossref","unstructured":"Zouari, W., Alaya, I., Tagina, M.: A new hybrid ant colony algorithms for the traveling thief problem. In: Proceedings of the Genetic and Evolutionary Computation Conference Companion, Association for Computing Machinery, New York, NY, USA, GECCO \u201919, pp. 95\u201396 (2019)","DOI":"10.1145\/3319619.3326785"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-020-09457-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10732-020-09457-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-020-09457-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,19]],"date-time":"2021-09-19T23:56:58Z","timestamp":1632095818000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10732-020-09457-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9,20]]},"references-count":48,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,6]]}},"alternative-id":["9457"],"URL":"https:\/\/doi.org\/10.1007\/s10732-020-09457-7","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,9,20]]},"assertion":[{"value":"11 November 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 July 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 September 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 September 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}