{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T06:21:54Z","timestamp":1778739714942,"version":"3.51.4"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2020,5,11]],"date-time":"2020-05-11T00:00:00Z","timestamp":1589155200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,5,11]],"date-time":"2020-05-11T00:00:00Z","timestamp":1589155200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2020,10]]},"DOI":"10.1007\/s10898-020-00910-2","type":"journal-article","created":{"date-parts":[[2020,5,11]],"date-time":"2020-05-11T12:03:47Z","timestamp":1589198627000},"page":"295-325","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["GRASP with Variable Neighborhood Descent for the online order batching problem"],"prefix":"10.1007","volume":"78","author":[{"given":"Sergio","family":"Gil-Borr\u00e1s","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eduardo G.","family":"Pardo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antonio","family":"Alonso-Ayuso","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abraham","family":"Duarte","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,5,11]]},"reference":[{"issue":"5","key":"910_CR1","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1142\/S0217595909002390","volume":"26","author":"M Albareda-Sambola","year":"2009","unstructured":"Albareda-Sambola, M., Alonso-Ayuso, A., Molina, E., De Blas, C.S.: Variable neighborhood search for order batching in a warehouse. Asia-Pac. J. Oper. Res. 26(5), 655\u2013683 (2009)","journal-title":"Asia-Pac. J. Oper. Res."},{"issue":"4","key":"910_CR2","doi-asserted-by":"crossref","first-page":"640","DOI":"10.1007\/s10696-017-9277-7","volume":"30","author":"F Chen","year":"2018","unstructured":"Chen, F., Wei, Y., Wang, H.: A heuristic based batching and assigning method for online customer orders. Flex. Serv. Manuf. J. 30(4), 640\u2013685 (2018)","journal-title":"Flex. Serv. Manuf. J."},{"key":"910_CR3","volume-title":"The Management of Business Logistics","author":"JJ Coyle","year":"1996","unstructured":"Coyle, J.J., Bardi, E.J., Langley, C.J., et al.: The Management of Business Logistics, vol. 6. West Publishing Company Minneapolis, St Paul (1996)"},{"issue":"7","key":"910_CR4","doi-asserted-by":"crossref","first-page":"1479","DOI":"10.1080\/002075499191094","volume":"37","author":"MBM De Koster","year":"1999","unstructured":"De Koster, M.B.M., Van der Poort, E.S., Wolters, M.: Efficient orderbatching methods in warehouses. Int. J. Prod. Res. 37(7), 1479\u20131504 (1999)","journal-title":"Int. J. Prod. Res."},{"key":"910_CR5","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1016\/j.ejor.2006.07.009","volume":"182","author":"R De Koster","year":"2007","unstructured":"De Koster, R., Le-Duc, T., Roodbergen, K.J.: Design and control of warehouse order picking: a literature review. Eur. J. Oper. Res. 182, 481\u2013501 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"910_CR6","doi-asserted-by":"crossref","unstructured":"De\u00a0Koster, R.,\u00a0Jan Roodbergen, K.,\u00a0van Voorden, R.: Reduction of walking time in the distribution center of de bijenkorf. In: New trends in distribution logistics, pp. 215\u2013234. Springer, Berlin (1999)","DOI":"10.1007\/978-3-642-58568-5_11"},{"key":"910_CR7","unstructured":"Drury, J., Warehouse Operations Special Interest Group, Order Picking Working Party, Turnbull, B., Institute of Logistics (Great Britain): Towards More Efficient Order Picking. IMM monograph. Institute of Materials Management. ISBN 9781870214063 (1988). https:\/\/books.google.es\/books?id=LbTKAAAACAAJ"},{"issue":"3","key":"910_CR8","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1007\/s10898-014-0213-z","volume":"63","author":"A Duarte","year":"2015","unstructured":"Duarte, A., Pantrigo, J.J., Pardo, E.G., Mladenovic, N.: Multi-objective variable neighborhood search: an application to combinatorial optimization problems. J. Global Optim. 63(3), 515\u2013536 (2015)","journal-title":"J. Global Optim."},{"issue":"1","key":"910_CR9","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1093\/imaman\/dpt026","volume":"27","author":"A Duarte","year":"2013","unstructured":"Duarte, A., Pantrigo, J.J., Pardo, E.G., S\u00e1nchez-Oro, J.: Parallel variable neighbourhood search strategies for the cutwidth minimization problem. IMA J. Manag. Math. 27(1), 55\u201373 (2013)","journal-title":"IMA J. Manag. Math."},{"key":"910_CR10","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"TA Feo","year":"1995","unstructured":"Feo, T.A., Resende, M.: Greedy randomized adaptive search procedures. J. Global Optim. 6, 109\u2013133 (1995)","journal-title":"J. Global Optim."},{"issue":"5","key":"910_CR11","first-page":"385","volume":"33","author":"AJRM Gademann","year":"2001","unstructured":"Gademann, A.J.R.M., Van Den Berg, J.P., Van Der Hoff, H.H.: An order batching algorithm for wave picking in a parallel-aisle warehouse. IIE Trans. 33(5), 385\u2013398 (2001)","journal-title":"IIE Trans."},{"issue":"1","key":"910_CR12","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1080\/07408170590516917","volume":"37","author":"N Gademann","year":"2005","unstructured":"Gademann, N., Velde, S.: Order batching to minimize total travel time in a parallel-aisle warehouse. IIE Trans. 37(1), 63\u201375 (2005)","journal-title":"IIE Trans."},{"issue":"1","key":"910_CR13","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0377-2217(92)90235-2","volume":"58","author":"DR Gibson","year":"1992","unstructured":"Gibson, D.R., Sharp, G.P.: Order batching procedures. Eur. J. Oper. Res. 58(1), 57\u201367 (1992)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"910_CR14","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1016\/j.ejor.2009.07.031","volume":"203","author":"J Gu","year":"2010","unstructured":"Gu, J., Goetschalckx, M., McGinnis, L.F.: Research on warehouse design and performance evaluation: a comprehensive review. Eur. J. Oper. Res. 203(3), 539\u2013549 (2010)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"910_CR15","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1080\/07408179308964306","volume":"25","author":"RW Hall","year":"1993","unstructured":"Hall, R.W.: Distance approximations for routing manual pickers in a warehouse. IIE Trans. 25(4), 76\u201387 (1993)","journal-title":"IIE Trans."},{"issue":"3","key":"910_CR16","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1016\/S0377-2217(00)00100-4","volume":"130","author":"P Hansen","year":"2001","unstructured":"Hansen, P., Mladenovi\u0107, N.: Variable neighborhood search: principles and applications. Eur. J. Oper. Res. 130(3), 449\u2013467 (2001)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"910_CR17","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/s10479-009-0657-6","volume":"175","author":"P Hansen","year":"2010","unstructured":"Hansen, P., Mladenovi\u0107, N., Moreno-P\u00e9rez, J.A.: Variable neighbourhood search: methods and applications. Ann. Oper. Res. 175(1), 367\u2013407 (2010)","journal-title":"Ann. Oper. Res."},{"issue":"11","key":"910_CR18","doi-asserted-by":"crossref","first-page":"2549","DOI":"10.1016\/j.cor.2011.12.019","volume":"39","author":"S Henn","year":"2012","unstructured":"Henn, S.: Algorithms for on-line order batching in an order picking warehouse. Comput. Oper. Res. 39(11), 2549\u20132563 (2012)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"910_CR19","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1007\/BF03342717","volume":"3","author":"S Henn","year":"2010","unstructured":"Henn, S., Koch, S., Doerner, K., Strauss, C., W\u00e4scher, G.: Metaheuristics for the order batching problem in manual order picking systems. BuR Bus. Res. J. 3(1), 82\u2013105 (2010)","journal-title":"BuR Bus. Res. J."},{"issue":"2","key":"910_CR20","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1016\/j.cie.2013.07.003","volume":"66","author":"S Henn","year":"2013","unstructured":"Henn, S., Schmid, V.: Metaheuristics for order batching and sequencing in manual order picking systems. Comput. Ind. Eng. 66(2), 338\u2013351 (2013)","journal-title":"Comput. Ind. Eng."},{"issue":"3","key":"910_CR21","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1016\/j.ejor.2012.05.049","volume":"222","author":"S Henn","year":"2012","unstructured":"Henn, S., W\u00e4scher, G.: Tabu search heuristics for the order batching problem in manual order picking systems. Eur. J. Oper. Res. 222(3), 484\u2013494 (2012)","journal-title":"Eur. J. Oper. Res."},{"issue":"17","key":"910_CR22","doi-asserted-by":"crossref","first-page":"3391","DOI":"10.1080\/00207540600558015","volume":"44","author":"Y-C Ho","year":"2006","unstructured":"Ho, Y.-C., Tseng, Y.-Y.: A study on order-batching methods of order-picking in a distribution centre with two cross-aisles. Int. J. Prod. Res. 44(17), 3391\u20133417 (2006)","journal-title":"Int. J. Prod. Res."},{"issue":"2","key":"910_CR23","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/j.compind.2004.06.001","volume":"56","author":"C-M Hsu","year":"2005","unstructured":"Hsu, C.-M., Chen, K.-Y., Chen, M.-C.: Batching orders in warehouses by minimizing travel distance with genetic algorithms. Comput. Ind. 56(2), 169\u2013178 (2005)","journal-title":"Comput. Ind."},{"issue":"1\u20132","key":"910_CR24","first-page":"131","volume":"86","author":"S Koch","year":"2016","unstructured":"Koch, S., W\u00e4scher, G.: A grouping genetic algorithm for the Order Batching Problem in distribution warehouses. J. Bus. Econ. 86(1\u20132), 131\u2013153 (2016)","journal-title":"J. Bus. Econ."},{"issue":"1","key":"910_CR25","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1016\/j.ejor.2017.05.001","volume":"263","author":"B Men\u00e9ndez","year":"2017","unstructured":"Men\u00e9ndez, B., Bustillo, M., Pardo, E.G., Duarte, A.: General variable neighborhood search for the order batching and sequencing problem. Eur. J. Oper. Res. 263(1), 82\u201393 (2017)","journal-title":"Eur. J. Oper. Res."},{"key":"910_CR26","doi-asserted-by":"crossref","first-page":"500","DOI":"10.1016\/j.cor.2016.01.020","volume":"78","author":"B Men\u00e9ndez","year":"2017","unstructured":"Men\u00e9ndez, B., Pardo, E.G., Alonso-Ayuso, A., Molina, E., Duarte, A.: Variable neighborhood search strategies for the order batching problem. Comput. Oper. Res. 78, 500\u2013512 (2017)","journal-title":"Comput. Oper. Res."},{"key":"910_CR27","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/j.endm.2014.11.011","volume":"47","author":"B Men\u00e9ndez","year":"2015","unstructured":"Men\u00e9ndez, B., Pardo, E.G., Duarte, A., Alonso-Ayuso, A., Molina, E.: General variable neighborhood search applied to the picking process in a warehouse. Electron. Notes Discrete Math. 47, 77\u201384 (2015)","journal-title":"Electron. Notes Discrete Math."},{"issue":"3","key":"910_CR28","doi-asserted-by":"crossref","first-page":"635","DOI":"10.1111\/itor.12309","volume":"24","author":"B Men\u00e9ndez","year":"2017","unstructured":"Men\u00e9ndez, B., Pardo, E.G., S\u00e1nchez-Oro, J., Duarte, A.: Parallel variable neighborhood search for the min\u2013max order batching problem. Int. Trans. Oper. Res, 24(3), 635\u2013662 (2017)","journal-title":"Int. Trans. Oper. Res,"},{"issue":"11","key":"910_CR29","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24(11), 1097\u20131100 (1997)","journal-title":"Comput. Oper. Res."},{"key":"910_CR30","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1016\/j.ejor.2014.11.025","volume":"243","author":"T \u00d6ncan","year":"2015","unstructured":"\u00d6ncan, T.: MILP formulations and an iterated local search algorithm with Tabu thresholding for the order batching problem. J. Oper. Res. 243, 142\u2013155 (2015)","journal-title":"J. Oper. Res."},{"issue":"9","key":"910_CR31","doi-asserted-by":"crossref","first-page":"471","DOI":"10.3182\/20130619-3-RU-3018.00372","volume":"46","author":"T \u00d6ncan","year":"2013","unstructured":"\u00d6ncan, T., Ca\u011f\u0131r\u0131c\u0131, M.: MILP formulations for the order batching problem in low-level picker-to-part warehouse systems. IFAC Proc. Vol. 46(9), 471\u2013476 (2013)","journal-title":"IFAC Proc. Vol."},{"issue":"6","key":"910_CR32","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1016\/0305-0483(95)00038-0","volume":"23","author":"C-H Pan","year":"1995","unstructured":"Pan, C.-H., Liu, S.-Y.: A comparative study of order batching algorithms. Omega 23(6), 691\u2013700 (1995)","journal-title":"Omega"},{"issue":"5","key":"910_CR33","doi-asserted-by":"crossref","first-page":"2242","DOI":"10.1016\/j.asoc.2013.01.016","volume":"13","author":"EG Pardo","year":"2013","unstructured":"Pardo, E.G., Mladenovi\u0107, N., Pantrigo, J.J., Duarte, A.: Variable formulation search for the cutwidth minimization problem. Appl. Soft Comput. 13(5), 2242\u20132252 (2013)","journal-title":"Appl. Soft Comput."},{"issue":"1","key":"910_CR34","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1007\/s00170-015-6835-6","volume":"79","author":"R P\u00e9rez-Rodr\u00edguez","year":"2015","unstructured":"P\u00e9rez-Rodr\u00edguez, R., Hern\u00e1ndez-Aguirre, A., J\u00f6ns, S.: A continuous estimation of distribution algorithm for the online order-batching problem. Int. J. Adv. Manuf. Technol. 79(1), 569\u2013588 (2015)","journal-title":"Int. J. Adv. Manuf. Technol."},{"issue":"11","key":"910_CR35","doi-asserted-by":"crossref","first-page":"1098","DOI":"10.1108\/01443579710177860","volume":"17","author":"CG Petersen","year":"1997","unstructured":"Petersen, C.G.: An evaluation of order picking routeing policies. Int. J. Oper. Prod. Manag. 17(11), 1098\u20131111 (1997)","journal-title":"Int. J. Oper. Prod. Manag."},{"issue":"3","key":"910_CR36","first-page":"1614","volume":"31","author":"CG Petersen","year":"1995","unstructured":"Petersen, C.G.: Routeing and storage policy interaction in order picking operations. Decis. Sci. Inst. Proc. 31(3), 1614\u20131616 (1995)","journal-title":"Decis. Sci. Inst. Proc."},{"issue":"3","key":"910_CR37","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1287\/opre.31.3.507","volume":"31","author":"HD Ratliff","year":"1983","unstructured":"Ratliff, H.D., Rosenthal, A.S.: Order-picking in a rectangular warehouse: a solvable case of the traveling salesman problem. Oper. Res. 31(3), 507\u2013521 (1983)","journal-title":"Oper. Res."},{"issue":"9","key":"910_CR38","doi-asserted-by":"crossref","first-page":"1865","DOI":"10.1080\/00207540110028128","volume":"39","author":"KJ Roodbergen","year":"2001","unstructured":"Roodbergen, K.J., Koster, R.D.: Routing methods for warehouses with multiple cross aisles. Int. J. Prod. Res. 39(9), 1865\u20131883 (2001)","journal-title":"Int. J. Prod. Res."},{"key":"910_CR39","unstructured":"Roodbergen, K.J., Petersen, C.G.: How to improve order picking efficiency with routing and storage policies. In: G.R. Forger et al. (eds.), Progress in Material Handling Practice. Material Handling Institute, Charlotte, North Carolina, pp. 107\u2013124 (1999)"},{"issue":"3","key":"910_CR40","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1080\/00207549608904926","volume":"34","author":"MB Rosenwein","year":"1996","unstructured":"Rosenwein, M.B.: A comparison of heuristics for the problem of batching orders for warehouse selection. Int. J. Prod. Res. 34(3), 657\u2013664 (1996)","journal-title":"Int. J. Prod. Res."},{"issue":"1","key":"910_CR41","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1016\/j.rcim.2010.06.011","volume":"27","author":"JIU Rubrico","year":"2011","unstructured":"Rubrico, J.I.U., Higashi, T., Tamura, H., Ota, J.: Online rescheduling of multiple picking agents for warehouse management. Robot. Comput. Integr. Manuf. 27(1), 62\u201371 (2011)","journal-title":"Robot. Comput. Integr. Manuf."},{"issue":"2","key":"910_CR42","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1016\/j.ejor.2017.04.038","volume":"263","author":"A Scholz","year":"2017","unstructured":"Scholz, A., Schubert, D., W\u00e4scher, G.: Order picking with multiple pickers and due dates\u2014simultaneous solution of order batching, batch assignment and sequencing, and picker routing problems. Eur. J. Oper. Res. 263(2), 461\u2013478 (2017)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"910_CR43","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1007\/s10100-017-0467-x","volume":"25","author":"A Scholz","year":"2017","unstructured":"Scholz, A., W\u00e4scher, G.: Order Batching and Picker Routing in manual order picking systems: the benefits of integrated routing. CEJOR 25(2), 491\u2013520 (2017)","journal-title":"CEJOR"},{"issue":"3","key":"910_CR44","doi-asserted-by":"crossref","first-page":"817","DOI":"10.1016\/S0360-8352(97)00245-3","volume":"33","author":"LC Tang","year":"1997","unstructured":"Tang, L.C., Chew, E.P.: Order picking systems: batching and storage assignment strategies. Comput. Ind. Eng. 33(3), 817\u2013820 (1997). Selected Papers from the Proceedings of 1996 ICC&IC","journal-title":"Comput. Ind. Eng."},{"key":"910_CR45","first-page":"1","volume":"0731","author":"I Van Nieuwenhuyse","year":"2007","unstructured":"Van Nieuwenhuyse, I., Colpaert, J.: Order batching in multi-server pick-and-sort warehouses. DTEW-KBI 0731, 1\u201329 (2007)","journal-title":"DTEW-KBI"},{"key":"910_CR46","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/j.apm.2016.12.012","volume":"45","author":"J Zhang","year":"2017","unstructured":"Zhang, J., Wang, X., Chan, F.T.S., Ruan, J.: On-line order batching and sequencing problem with multiple pickers: a hybrid rule-based algorithm. Appl. Math. Model. 45, 271\u2013284 (2017)","journal-title":"Appl. Math. Model."},{"key":"910_CR47","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1016\/j.cie.2016.02.001","volume":"94","author":"J Zhang","year":"2016","unstructured":"Zhang, J., Wang, X., Huang, K.: Integrated on-line scheduling of order batching and delivery under b2c e-commerce. Comput. Ind. Eng. 94, 280\u2013289 (2016)","journal-title":"Comput. Ind. Eng."},{"key":"910_CR48","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1016\/j.omega.2017.08.004","volume":"79","author":"J Zhang","year":"2018","unstructured":"Zhang, J., Wang, X., Huang, K.: On-line scheduling of order picking and delivery with multiple zones and limited vehicle capacity. Omega 79, 104\u2013115 (2018)","journal-title":"Omega"},{"issue":"2","key":"910_CR49","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1016\/j.ejor.2017.06.056","volume":"264","author":"I \u017dulj","year":"2018","unstructured":"\u017dulj, I., Kramer, S., Schneider, M.: A hybrid of adaptive large neighborhood search and tabu search for the order-batching problem. Eur. J. Oper. Res. 264(2), 653\u2013664 (2018)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-020-00910-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-020-00910-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-020-00910-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,10]],"date-time":"2021-05-10T23:42:03Z","timestamp":1620690123000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-020-00910-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5,11]]},"references-count":49,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,10]]}},"alternative-id":["910"],"URL":"https:\/\/doi.org\/10.1007\/s10898-020-00910-2","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,5,11]]},"assertion":[{"value":"24 May 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 April 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 May 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}