{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T17:30:47Z","timestamp":1771608647522,"version":"3.50.1"},"reference-count":53,"publisher":"Informa UK Limited","issue":"10","funder":[{"DOI":"10.13039\/501100003593","name":"Brazilian research agencies CNPq","doi-asserted-by":"publisher","award":["314088\/2021-0"],"award-info":[{"award-number":["314088\/2021-0"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"Brazilian research agencies CNPq","doi-asserted-by":"publisher","award":["406245\/2021-5"],"award-info":[{"award-number":["406245\/2021-5"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"Brazilian research agencies CNPq","doi-asserted-by":"publisher","award":["404807\/2021-6"],"award-info":[{"award-number":["404807\/2021-6"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"Brazilian research agencies CNPq","doi-asserted-by":"publisher","award":["309580\/2021-8"],"award-info":[{"award-number":["309580\/2021-8"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005669","name":"Para\u00edba State Research Foundation","doi-asserted-by":"publisher","award":["261\/2020"],"award-info":[{"award-number":["261\/2020"]}],"id":[{"id":"10.13039\/501100005669","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005669","name":"Para\u00edba State Research Foundation","doi-asserted-by":"publisher","award":["2021\/3182"],"award-info":[{"award-number":["2021\/3182"]}],"id":[{"id":"10.13039\/501100005669","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005669","name":"Para\u00edba State Research Foundation","doi-asserted-by":"publisher","award":["041\/2023"],"award-info":[{"award-number":["041\/2023"]}],"id":[{"id":"10.13039\/501100005669","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100018802","name":"Universidade Federal da Para\u00edba","doi-asserted-by":"publisher","award":["03\/2020"],"award-info":[{"award-number":["03\/2020"]}],"id":[{"id":"10.13039\/501100018802","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Produtividade em Pesquisa PROPESQ\/PRPG\/UFPB","award":["PVL13395-2020"],"award-info":[{"award-number":["PVL13395-2020"]}]},{"name":"Produtividade em Pesquisa PROPESQ\/PRPG\/UFPB","award":["PVL13400-2020"],"award-info":[{"award-number":["PVL13400-2020"]}]}],"content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["Journal of the Operational Research Society"],"published-print":{"date-parts":[[2025,10,3]]},"DOI":"10.1080\/01605682.2025.2457651","type":"journal-article","created":{"date-parts":[[2025,2,7]],"date-time":"2025-02-07T05:32:11Z","timestamp":1738906331000},"page":"2098-2111","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":1,"title":["A matheuristic algorithm for the school bus routing problem"],"prefix":"10.1080","volume":"76","author":[{"given":"Iderval","family":"da Costa e Silva","sequence":"first","affiliation":[{"name":"Universidade Federal da Para\u00edba, Centro de Inform\u00e1tica","place":["Jo\u00e3o Pessoa, Brazil"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ewerton","family":"Teixeira","sequence":"additional","affiliation":[{"name":"Universidade Federal da Para\u00edba, Centro de Tecnologia, Programa de P\u00f3s-Gradua\u00e7\u00e3o em Engenharia de Produ\u00e7\u00e3o","place":["Jo\u00e3o Pessoa, Brazil"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Raphael","family":"Kramer","sequence":"additional","affiliation":[{"name":"Universidade Federal de Pernambuco, Departamento de Engenharia de Produ\u00e7\u00e3o","place":["Recife, Brazil"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Teobaldo","family":"Bulh\u00f5es","sequence":"additional","affiliation":[{"name":"Universidade Federal da Para\u00edba, Departamento de Computa\u00e7\u00e3o Cient\u00edfica","place":["Jo\u00e3o Pessoa, Brazil"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anand","family":"Subramanian","sequence":"additional","affiliation":[{"name":"Universidade Federal da Para\u00edba, Departamento de Sistemas de Computa\u00e7\u00e3o","place":["Jo\u00e3o Pessoa, Brazil"]}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"301","published-online":{"date-parts":[[2025,2,7]]},"reference":[{"key":"e_1_3_2_2_1","first-page":"193","article-title":"Solving of school bus routing problem by ant colony optimization","author":"Arias-Rojas J. S.","year":"2012","unstructured":"Arias-Rojas, J. S., Jim\u00e9nez, J. F., & Montoya-Torres, J. R. (2012). Solving of school bus routing problem by ant colony optimization. Revista EIA, 17, 193\u2013208.","journal-title":"Revista EIA, 17"},{"key":"e_1_3_2_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11276-019-01985-w"},{"key":"e_1_3_2_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2019.106125"},{"key":"e_1_3_2_5_1","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2602305"},{"key":"e_1_3_2_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/0041-1647(72)90072-X"},{"key":"e_1_3_2_7_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.21589"},{"key":"e_1_3_2_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2017.06.028"},{"key":"e_1_3_2_9_1","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.2016.0721"},{"key":"e_1_3_2_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-16579-5_12"},{"key":"e_1_3_2_11_1","doi-asserted-by":"publisher","DOI":"10.3390\/math8081214"},{"key":"e_1_3_2_12_1","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0132600"},{"key":"e_1_3_2_13_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.12.4.568"},{"key":"e_1_3_2_14_1","first-page":"409","article-title":"A hybrid metaheuristic algorithm for the bi-objective school bus routing problem","volume":"46","author":"Dang L.","year":"2019","unstructured":"Dang, L., Hou, Y., Liu, Q., & Kong, Y. (2019). A hybrid metaheuristic algorithm for the bi-objective school bus routing problem. IAENG International Journal of Computer Science, 46, 409\u2013416.","journal-title":"IAENG International Journal of Computer Science,"},{"key":"e_1_3_2_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-45318-2_9"},{"key":"e_1_3_2_16_1","doi-asserted-by":"publisher","DOI":"10.1080\/10095020.2012.708151"},{"key":"e_1_3_2_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2019.03.014"},{"key":"e_1_3_2_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tranpol.2018.01.015"},{"key":"e_1_3_2_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tranpol.2022.12.001"},{"key":"e_1_3_2_20_1","unstructured":"Fleming S. (2019). This US city put an algorithm in charge of its school bus routes and saved $5 million. World Economic Forum. https:\/\/www.weforum.org\/agenda\/2019\/08\/this-us-city-put-an-algorithm-in-charge-of-its-school-bus-routes-and-saved-5-million\/"},{"key":"e_1_3_2_21_1","doi-asserted-by":"publisher","DOI":"10.1515\/9781400875184"},{"key":"e_1_3_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/48014.61051"},{"key":"e_1_3_2_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.trc.2022.103691"},{"key":"e_1_3_2_24_1","first-page":"775","article-title":"A hybrid metaheuristic algorithm for the heterogeneous school bus routing problem and a real case study","volume":"47","author":"Hou Y.","year":"2020","unstructured":"Hou, Y., Dang, L., Kong, Y., Wang, Z., & Zhao, Q. (2020). A hybrid metaheuristic algorithm for the heterogeneous school bus routing problem and a real case study. IAENG International Journal of Computer Science, 47, 775\u2013785.","journal-title":"IAENG International Journal of Computer Science,"},{"key":"e_1_3_2_25_1","first-page":"1397","article-title":"A hybrid metaheuristic algorithm for the school bus routing problem with multi-school planning scenarios","volume":"29","author":"Hou Y.","year":"2021","unstructured":"Hou, Y., Zhao, N., Dang, L., & Liu, B. (2021). A hybrid metaheuristic algorithm for the school bus routing problem with multi-school planning scenarios. Engineering Letters, 29, 1397\u20131406.","journal-title":"Engineering Letters,"},{"key":"e_1_3_2_26_1","first-page":"596","article-title":"Model and algorithm for solving school bus problem","volume":"4","author":"Kim T.","year":"2013","unstructured":"Kim, T., & Park, B.-J. (2013). Model and algorithm for solving school bus problem. Journal of Emerging Trends in Computing and Information Sciences, 4, 596\u2013600.","journal-title":"Journal of Emerging Trends in Computing and Information Sciences,"},{"key":"e_1_3_2_27_1","doi-asserted-by":"publisher","DOI":"10.1111\/itor.12080"},{"key":"e_1_3_2_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2014.12.009"},{"key":"e_1_3_2_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2018.11.001"},{"key":"e_1_3_2_30_1","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2601341"},{"key":"e_1_3_2_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10288-017-0340-8"},{"key":"e_1_3_2_32_1","doi-asserted-by":"publisher","DOI":"10.1111\/itor.12581"},{"key":"e_1_3_2_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2020.105196"},{"key":"e_1_3_2_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2018.02.014"},{"key":"e_1_3_2_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/0038-0121(69)90051-2"},{"key":"e_1_3_2_36_1","first-page":"1","article-title":"Iterated local search algorithm with strategic oscillation for school bus routing problem with bus stop selection","volume":"4","author":"Niasar M. S. F.","year":"2017","unstructured":"Niasar, M. S. F., Talarico, L., Sajadifar, M., & Tayebi, A. H. (2017). Iterated local search algorithm with strategic oscillation for school bus routing problem with bus stop selection. IJSOM: International Journal of Supply and Operations Management, 4, 1\u201314.","journal-title":"IJSOM: International Journal of Supply and Operations Management,"},{"key":"e_1_3_2_37_1","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2601917"},{"key":"e_1_3_2_38_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2009.05.017"},{"key":"e_1_3_2_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-017-2642-9"},{"key":"e_1_3_2_40_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2012.08.011"},{"key":"e_1_3_2_41_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2011.04.015"},{"key":"e_1_3_2_42_1","doi-asserted-by":"publisher","DOI":"10.1061\/(ASCE)UP.1943-5444.0000454"},{"key":"e_1_3_2_43_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2013.02.025"},{"key":"e_1_3_2_44_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-56423-9_17"},{"key":"e_1_3_2_45_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.trb.2018.09.004"},{"key":"e_1_3_2_46_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2014.08.005"},{"key":"e_1_3_2_47_1","doi-asserted-by":"publisher","DOI":"10.17706\/ijeeee.2016.6.2.137-145"},{"key":"e_1_3_2_48_1","unstructured":"Subramanian A. (2012). Heuristic exact and hybrid approaches for vehicle routing problems [Ph.D. thesis]. Universidade Federal Fluminense."},{"key":"e_1_3_2_49_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2009.10.011"},{"key":"e_1_3_2_50_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2012.03.016"},{"key":"e_1_3_2_51_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2013.01.013"},{"key":"e_1_3_2_52_1","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0202618"},{"key":"e_1_3_2_53_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2013.04.026"},{"key":"e_1_3_2_54_1","doi-asserted-by":"publisher","DOI":"10.1504\/IJBIC.2018.091236"}],"container-title":["Journal of the Operational Research Society"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/01605682.2025.2457651","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,23]],"date-time":"2025-09-23T15:50:43Z","timestamp":1758642643000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/01605682.2025.2457651"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2,7]]},"references-count":53,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2025,10,3]]}},"alternative-id":["10.1080\/01605682.2025.2457651"],"URL":"https:\/\/doi.org\/10.1080\/01605682.2025.2457651","relation":{},"ISSN":["0160-5682","1476-9360"],"issn-type":[{"value":"0160-5682","type":"print"},{"value":"1476-9360","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,2,7]]},"assertion":[{"value":"The publishing and review policy for this title is described in its Aims & Scope.","order":1,"name":"peerreview_statement","label":"Peer Review Statement"},{"value":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=tjor20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=tjor20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"},{"value":"2024-07-25","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-01-14","order":1,"name":"revised","label":"Revised","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-01-15","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-02-07","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}