{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T14:18:39Z","timestamp":1777990719058,"version":"3.51.4"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,7,3]],"date-time":"2024-07-03T00:00:00Z","timestamp":1719964800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,7,3]],"date-time":"2024-07-03T00:00:00Z","timestamp":1719964800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001807","name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo","doi-asserted-by":"publisher","award":["2020\/07145-8"],"award-info":[{"award-number":["2020\/07145-8"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001807","name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo","doi-asserted-by":"publisher","award":["2018\/15417-8, 2016\/01860-1"],"award-info":[{"award-number":["2018\/15417-8, 2016\/01860-1"]}],"id":[{"id":"10.13039\/501100001807","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":["405702\/2021-3,312747\/2021-7"],"award-info":[{"award-number":["405702\/2021-3,312747\/2021-7"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002790","name":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["2019-0009"],"award-info":[{"award-number":["2019-0009"]}],"id":[{"id":"10.13039\/501100002790","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2025,8]]},"DOI":"10.1007\/s10479-024-06136-9","type":"journal-article","created":{"date-parts":[[2024,7,3]],"date-time":"2024-07-03T14:02:22Z","timestamp":1720015342000},"page":"809-847","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Hybrid metaheuristic for the dial-a-ride problem with private fleet and common carrier integrated with public transportation"],"prefix":"10.1007","volume":"351","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0535-9656","authenticated-orcid":false,"given":"Cleder M.","family":"Schenekemberg","sequence":"first","affiliation":[]},{"given":"Antonio A.","family":"Chaves","sequence":"additional","affiliation":[]},{"given":"Thiago A.","family":"Guimar\u00e3es","sequence":"additional","affiliation":[]},{"given":"Leandro C.","family":"Coelho","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,7,3]]},"reference":[{"key":"6136_CR1","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.eswa.2019.03.007","volume":"128","author":"CE Andrade","year":"2019","unstructured":"Andrade, C. E., Silva, T., & Pessoa, L. S. (2019). Minimizing flowtime in a flowshop scheduling problem with a biased random-key genetic algorithm. Expert Systems with Applications, 128, 67\u201380.","journal-title":"Expert Systems with Applications"},{"issue":"1","key":"6136_CR2","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.ejor.2019.11.037","volume":"289","author":"CE Andrade","year":"2021","unstructured":"Andrade, C. E., Toso, R. F., Gon\u00e7alves, J. F., & Resende, M. G. (2021). The multi-parent biased random-key genetic algorithm with implicit path-relinking and its real-world applications. European Journal of Operational Research, 289(1), 17\u201330.","journal-title":"European Journal of Operational Research"},{"key":"6136_CR3","first-page":"306","volume":"153","author":"IE Aslaksen","year":"2021","unstructured":"Aslaksen, I. E., Svanberg, E., Fagerholt, K., Johnsen, L. C., & Meisel, F. (2021). A combined dial-a-ride and fixed schedule ferry service for coastal cities. Transportation Research Part A: Policy and Practice, 153, 306\u2013325.","journal-title":"Transportation Research Part A: Policy and Practice"},{"key":"6136_CR4","first-page":"557","volume":"166","author":"SS Azadeh","year":"2022","unstructured":"Azadeh, S. S., Zee, J., & Wagenvoort, M. (2022). Choice-driven service network design for an integrated fixed line and demand responsive mobility system. Transportation Research Part A: Policy and Practice, 166, 557\u2013574.","journal-title":"Transportation Research Part A: Policy and Practice"},{"key":"6136_CR5","doi-asserted-by":"publisher","first-page":"102890","DOI":"10.1016\/j.trc.2020.102890","volume":"124","author":"CV Beojone","year":"2021","unstructured":"Beojone, C. V., & Geroliminis, N. (2021). On the inefficiency of ride-sourcing services towards urban congestion. Transportation Research Part C: Emerging Technologies, 124, 102890.","journal-title":"Transportation Research Part C: Emerging Technologies"},{"key":"6136_CR6","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1016\/j.trb.2014.05.007","volume":"67","author":"K Braekers","year":"2014","unstructured":"Braekers, K., Caris, A., & Janssens, G. K. (2014). Exact and meta-heuristic approach for a general heterogeneous dial-a-ride problem with multiple depots. Transportation Research Part B: Methodological, 67, 166\u2013186.","journal-title":"Transportation Research Part B: Methodological"},{"issue":"1\u20134","key":"6136_CR7","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/s41604-019-00014-5","volume":"2","author":"D Brevet","year":"2019","unstructured":"Brevet, D., Duhamel, C., Iori, M., & Lacomme, P. (2019). A dial-a-ride problem using private vehicles and alternative nodes. Journal on Vehicle Routing Algorithms, 2(1\u20134), 89\u2013107.","journal-title":"Journal on Vehicle Routing Algorithms"},{"key":"6136_CR8","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/j.engappai.2015.10.002","volume":"48","author":"M Chassaing","year":"2016","unstructured":"Chassaing, M., Duhamel, C., & Lacomme, P. (2016). An els-based approach with dynamic probabilities management in local search for the dial-a-ride problem. Engineering Applications of Artificial Intelligence, 48, 119\u2013133.","journal-title":"Engineering Applications of Artificial Intelligence"},{"key":"6136_CR9","doi-asserted-by":"crossref","unstructured":"Chaves, A. A., & Lorena, L. H. N. (2021). An adaptive and near parameter-free BRKGA using $$Q$$-learning method. In 2021 IEEE congress on evolutionary computation (CEC) (pp. 2331\u20132338).","DOI":"10.1109\/CEC45853.2021.9504766"},{"key":"6136_CR10","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/j.cie.2018.07.031","volume":"124","author":"AA Chaves","year":"2017","unstructured":"Chaves, A. A., Gon\u00e7alves, J. F., & Lorena, L. H. N. (2017). Adaptive biased random-key genetic algorithm with local search for the capacitated centered clustering problem. Computers & Industrial Engineering, 124, 331\u2013346.","journal-title":"Computers & Industrial Engineering"},{"issue":"3","key":"6136_CR11","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1080\/19427867.2020.1852505","volume":"14","author":"JC-YC Chu","year":"2022","unstructured":"Chu, J.C.-Y.C., Chen, A. Y., & Shih, H.-H. (2022). Stochastic programming model for integrating bus network design and dial-a-ride scheduling. Transportation Letters, 14(3), 245\u2013257.","journal-title":"Transportation Letters"},{"issue":"3","key":"6136_CR12","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1287\/opre.1060.0283","volume":"54","author":"J-F Cordeau","year":"2006","unstructured":"Cordeau, J.-F. (2006). A branch-and-cut algorithm for the dial-a-ride problem. Operations Research, 54(3), 573\u2013586.","journal-title":"Operations Research"},{"issue":"2","key":"6136_CR13","first-page":"89","volume":"1","author":"J-F Cordeau","year":"2003","unstructured":"Cordeau, J.-F., & Laporte, G. (2003). The dial-a-ride problem (DARP). Variants, Modeling Issues and Algorithms, 1(2), 89\u2013101. 4OR.","journal-title":"Variants, Modeling Issues and Algorithms"},{"issue":"6","key":"6136_CR14","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1016\/S0191-2615(02)00045-0","volume":"37","author":"J-F Cordeau","year":"2003","unstructured":"Cordeau, J.-F., & Laporte, G. (2003). A tabu search heuristic for the static multi-vehicle dial-a-ride problem. Transportation Research Part B: Methodological, 37(6), 579\u2013594.","journal-title":"Transportation Research Part B: Methodological"},{"issue":"6","key":"6136_CR15","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1016\/j.trb.2003.07.001","volume":"38","author":"M Diana","year":"2004","unstructured":"Diana, M., & Dessouky, M. M. (2004). A new regret insertion heuristic for solving large-scale dial-a-ride problems with time windows. Transportation Research Part B: Methodological, 38(6), 539\u2013557.","journal-title":"Transportation Research Part B: Methodological"},{"issue":"2","key":"6136_CR16","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan, E. D., & Mor\u00e9, J. J. (2002). Benchmarking optimization software with performance profiles. Mathematical Programming, 91(2), 201\u2013213.","journal-title":"Mathematical Programming"},{"issue":"5","key":"6136_CR17","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. C. (2011). Biased random-key genetic algorithms for combinatorial optimization. Journal of Heuristics, 17(5), 487\u2013525.","journal-title":"Journal of Heuristics"},{"issue":"2","key":"6136_CR18","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1287\/trsc.2018.0837","volume":"53","author":"T Gschwind","year":"2019","unstructured":"Gschwind, T., & Drexl, M. (2019). Adaptive large neighborhood search with a constant-time feasibility test for the dial-a-ride problem. Transportation Science, 53(2), 480\u2013491.","journal-title":"Transportation Science"},{"key":"6136_CR19","unstructured":"Holland, J. H. (1975). Adaptation in natural and artificial systems. Technical report, Michigan: University of Michigan Press."},{"key":"6136_CR20","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1016\/j.trb.2018.02.001","volume":"111","author":"SC Ho","year":"2018","unstructured":"Ho, S. C., Szeto, W. Y., Kuo, Y.-H., Leung, J. M. Y., Petering, M., & Tou, T. W. H. (2018). A survey of dial-a-ride problems: Literature review and recent developments. Transportation Research Part B: Methodological, 111, 395\u2013421.","journal-title":"Transportation Research Part B: Methodological"},{"key":"6136_CR21","doi-asserted-by":"crossref","unstructured":"Karafotias, G., Eiben, A. E., & Hoogendoorn, M. (2014). Generic parameter control with reinforcement learning. In Proceedings of the 2014 annual conference on genetic and evolutionary computation, (pp. 1319\u20131326).","DOI":"10.1145\/2576768.2598360"},{"key":"6136_CR22","doi-asserted-by":"crossref","unstructured":"Karafotias, G., Hoogendoorn, M., & Eiben, A. (2015). Evaluating reward definitions for parameter control. In European conference on the applications of evolutionary computation (pp. 667\u2013680). Springer.","DOI":"10.1007\/978-3-319-16549-3_54"},{"key":"6136_CR23","doi-asserted-by":"publisher","DOI":"10.1016\/j.trc.2020.102891","volume":"122","author":"P Kumar","year":"2021","unstructured":"Kumar, P., & Khani, A. (2021). An algorithm for integrating peer-to-peer ridesharing and schedule-based transit system for first mile\/last mile access. Transportation Research Part C: Emerging Technologies, 122, 102891.","journal-title":"Transportation Research Part C: Emerging Technologies"},{"key":"6136_CR24","doi-asserted-by":"publisher","first-page":"1001","DOI":"10.1016\/j.ejor.2022.06.057","volume":"306","author":"Y-H Kuo","year":"2023","unstructured":"Kuo, Y.-H., Leung, J. M. Y., & Yan, Y. (2023). Public transport for smart cities: Recent innovations and future challenges. European Journal of Operational Research, 306, 1001\u20131026.","journal-title":"European Journal of Operational Research"},{"key":"6136_CR25","doi-asserted-by":"crossref","unstructured":"Li, T., & Pei, Y. (2019). Chaotic evolution algorithms using opposition-based learning. In 2019 IEEE congress on evolutionary computation (CEC) (pp. 3292\u20133299). IEEE.","DOI":"10.1109\/CEC.2019.8790198"},{"key":"6136_CR26","unstructured":"Loshchilov, I., & Hutter, F.(2017). SGDR: Stochastic gradient descent with warm restarts. In International conference on learning representations."},{"key":"6136_CR27","doi-asserted-by":"publisher","first-page":"105196","DOI":"10.1016\/j.cor.2020.105196","volume":"129","author":"I Malheiros","year":"2021","unstructured":"Malheiros, I., Ramalho, R., Passeti, B., Bulh\u00f5es, T., & Subramanian, A. (2021). A hybrid algorithm for the multi-depot heterogeneous dial-a-ride problem. Computers & Operations Research, 129, 105196.","journal-title":"Computers & Operations Research"},{"key":"6136_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cor.2016.12.008","volume":"81","author":"MA Masmoudi","year":"2017","unstructured":"Masmoudi, M. A., Braekers, K., Masmoudi, M., & Dammak, A. (2017). A hybrid genetic algorithm for the heterogeneous dial-a-ride problem. Computers & Operations Research, 81, 1\u201313.","journal-title":"Computers & Operations Research"},{"key":"6136_CR29","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.tre.2016.10.002","volume":"96","author":"MA Masmoudi","year":"2016","unstructured":"Masmoudi, M. A., Hosny, M., Braekers, K., & Dammak, A. (2016). Three effective metaheuristics to solve the multi-depot multi-trip heterogeneous dial-a-ride problem. Transportation Research Part E: Logistics and Transportation Review, 96, 60\u201380.","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"key":"6136_CR30","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1016\/j.tre.2018.08.005","volume":"118","author":"MA Masmoudi","year":"2018","unstructured":"Masmoudi, M. A., Hosny, M., Demir, E., Genikomsakis, K. N., & Cheikhrouhou, N. (2018). The dial-a-ride problem with electric vehicles and battery swapping stations. Transportation Research Part E: Logistics and Transportation Review, 118, 392\u2013420.","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"key":"6136_CR31","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.tre.2017.09.001","volume":"107","author":"Y Molenbruch","year":"2017","unstructured":"Molenbruch, Y., Braekers, K., & Caris, A. (2017). Benefits of horizontal cooperation in dial-a-ride services. Transportation Research Part E: Logistics and Transportation Review, 107, 97\u2013119.","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"issue":"6","key":"6136_CR32","doi-asserted-by":"publisher","first-page":"1129","DOI":"10.1016\/j.cor.2009.10.003","volume":"37","author":"SN Parragh","year":"2010","unstructured":"Parragh, S. N., Doerner, K. F., & Hartl, R. F. (2010). Variable neighborhood search for the dial-a-ride problem. Computers & Operations Research, 37(6), 1129\u20131138.","journal-title":"Computers & Operations Research"},{"key":"6136_CR33","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s10732-011-9186-y","volume":"19","author":"PHV Penna","year":"2013","unstructured":"Penna, P. H. V., Subramanian, A., & Ochi, L. S. (2013). An iterated local search heuristic for the heterogeneous fleet vehicle routing problem. Journal of Heuristics, 19, 201\u2013232.","journal-title":"Journal of Heuristics"},{"issue":"1\u20132","key":"6136_CR34","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/s12469-016-0128-9","volume":"9","author":"M Posada","year":"2017","unstructured":"Posada, M., Andersson, H., & H\u00e4ll, C. H. (2017). The integrated dial-a-ride problem with timetabled fixed route service. Public Transport, 9(1\u20132), 217\u2013241.","journal-title":"Public Transport"},{"issue":"3","key":"6136_CR35","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1080\/12265934.2019.1709533","volume":"24","author":"M Posada","year":"2020","unstructured":"Posada, M., & H\u00e4ll, C. H. (2020). A metaheuristic for evaluation of an integrated special transport service. International Journal of Urban Sciences, 24(3), 316\u2013338.","journal-title":"International Journal of Urban Sciences"},{"issue":"2","key":"6136_CR36","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1287\/trsc.2014.0524","volume":"49","author":"Y Qu","year":"2015","unstructured":"Qu, Y., & Bard, J. F. (2015). A branch-and-price-and-cut algorithm for heterogeneous pickup and delivery problems with configurable vehicle capacity. Transportation Science, 49(2), 254\u2013270.","journal-title":"Transportation Science"},{"issue":"3","key":"6136_CR37","doi-asserted-by":"publisher","first-page":"036106","DOI":"10.1103\/PhysRevE.76.036106","volume":"76","author":"UN Raghavan","year":"2007","unstructured":"Raghavan, U. N., Albert, R., & Kumara, S. (2007). Near linear time algorithm to detect community structures in large-scale networks. Physical Review E, 76(3), 036106.","journal-title":"Physical Review E"},{"key":"6136_CR38","doi-asserted-by":"crossref","unstructured":"Rey, D., & Neuh\u00e4user, M. (2011). In: M. Lovric (ed.) Wilcoxon-Signed-Rank Test (pp. 1658\u20131659). Springer.","DOI":"10.1007\/978-3-642-04898-2_616"},{"issue":"4","key":"6136_CR39","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1287\/trsc.1090.0272","volume":"43","author":"S Ropke","year":"2009","unstructured":"Ropke, S., & Cordeau, J.-F. (2009). Branch and cut and price for the pickup and delivery problem with time windows. Transportation Science, 43(4), 267\u2013286.","journal-title":"Transportation Science"},{"issue":"4","key":"6136_CR40","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1002\/net.20177","volume":"49","author":"S Ropke","year":"2007","unstructured":"Ropke, S., Cordeau, J.-F., & Laporte, G. (2007). Models and branch-and-cut algorithms for pickup and delivery problems with time windows. Networks, 49(4), 258\u2013272.","journal-title":"Networks"},{"issue":"9","key":"6136_CR41","doi-asserted-by":"publisher","first-page":"5147","DOI":"10.1007\/s00521-019-04008-z","volume":"32","author":"H Samma","year":"2020","unstructured":"Samma, H., Mohamad-Saleh, J., Suandi, S. A., & Lahasan, B. (2020). Q-learning-based simulated annealing algorithm for constrained engineering design problems. Neural Computing and Applications, 32(9), 5147\u20135161.","journal-title":"Neural Computing and Applications"},{"key":"6136_CR42","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cor.2022.105933","volume":"147","author":"CM Schenekemberg","year":"2022","unstructured":"Schenekemberg, C. M., Chaves, A. A., Coelho, L. C., Guimar\u00e3es, T. A., & Avelino, G. G. (2022). The dial-a-ride problem with private fleet and common carrier. Computers & Operations Research, 147, 1\u201314.","journal-title":"Computers & Operations Research"},{"key":"6136_CR43","doi-asserted-by":"publisher","first-page":"114196","DOI":"10.1016\/j.apenergy.2019.114196","volume":"259","author":"H Shiraki","year":"2020","unstructured":"Shiraki, H., Matsumoto, K., Shigetomi, Y., Ehara, T., Ochi, Y., & Ogawa, Y. (2020). Factors affecting CO$$_2$$ emissions from private automobiles in Japan: The impact of vehicle occupancy. Applied Energy, 259, 114196.","journal-title":"Applied Energy"},{"issue":"4","key":"6136_CR44","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s40314-019-0976-4","volume":"38","author":"TT Silva","year":"2019","unstructured":"Silva, T. T., Chaves, A. A., Yanasse, H. H., & Luna, H. P. L. (2019). The multicommodity traveling salesman problem with priority prizes: A mathematical model and metaheuristics. Computational and Applied Mathematics, 38(4), 1\u201325.","journal-title":"Computational and Applied Mathematics"},{"key":"6136_CR45","unstructured":"Spears, W. M., & Jong, K. A. D. (1991). On the virtues of parametrized uniform crossover. In Proc. of the fourth international conference on genetic algorithms (pp. 230\u2013236)."},{"key":"6136_CR46","unstructured":"Watkins, C. J. C. H. (1989). Learning from delayed rewards. PhD thesis, King\u2019s College, University of Cambridge."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-024-06136-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-024-06136-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-024-06136-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,5]],"date-time":"2025-09-05T20:51:58Z","timestamp":1757105518000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-024-06136-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,3]]},"references-count":46,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,8]]}},"alternative-id":["6136"],"URL":"https:\/\/doi.org\/10.1007\/s10479-024-06136-9","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,7,3]]},"assertion":[{"value":"13 June 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 June 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 July 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}