{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T16:17:14Z","timestamp":1772641034018,"version":"3.50.1"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,11,20]],"date-time":"2024-11-20T00:00:00Z","timestamp":1732060800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,11,20]],"date-time":"2024-11-20T00:00:00Z","timestamp":1732060800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100006162","name":"Funda\u00e7\u00e3o de Amparo \u00e0 Ci\u00eancia e Tecnologia do Estado de Pernambuco","doi-asserted-by":"publisher","award":["IBPG-1471-3.08\/19"],"award-info":[{"award-number":["IBPG-1471-3.08\/19"]}],"id":[{"id":"10.13039\/501100006162","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":["404807\/2021-6"],"award-info":[{"award-number":["404807\/2021-6"]}],"id":[{"id":"10.13039\/501100003593","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":[[2026,3]]},"DOI":"10.1007\/s10479-024-06360-3","type":"journal-article","created":{"date-parts":[[2024,11,20]],"date-time":"2024-11-20T05:24:58Z","timestamp":1732080298000},"page":"767-813","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Mathematical model and matheuristic algorithm for the multi-period school bus routing problem"],"prefix":"10.1007","volume":"358","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9189-2566","authenticated-orcid":false,"given":"Igor Eduardo Santos","family":"de Melo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7982-1068","authenticated-orcid":false,"given":"Raphael","family":"Kramer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,11,20]]},"reference":[{"key":"6360_CR1","doi-asserted-by":"publisher","first-page":"102416","DOI":"10.1016\/j.tre.2021.102416","volume":"152","author":"A Ansari","year":"2021","unstructured":"Ansari, A., Farrokhvar, L., & Kamali, B. (2021). Integrated student to school assignment and school bus routing problem for special needs students. Transportation Research Part E: Logistics and Transportation Review, 152, 102416.","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"issue":"1","key":"6360_CR2","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1002\/net.3230040106","volume":"4","author":"EJ Beltrami","year":"1974","unstructured":"Beltrami, E. J., & Bodin, L. D. (1974). Networks and vehicle routing for municipal waste collection. Networks, 4(1), 65\u201394.","journal-title":"Networks"},{"issue":"13","key":"6360_CR3","doi-asserted-by":"publisher","first-page":"5943","DOI":"10.1073\/pnas.1811462116","volume":"116","author":"D Bertsimas","year":"2019","unstructured":"Bertsimas, D., Delarue, A., & Martin, S. (2019). Optimizing schools\u2019 start time and bus routes. Proceedings of the National Academy of Sciences, 116(13), 5943\u20135948.","journal-title":"Proceedings of the National Academy of Sciences"},{"issue":"2","key":"6360_CR4","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1287\/trsc.13.2.113","volume":"13","author":"LD Bodin","year":"1979","unstructured":"Bodin, L. D., & Berman, L. (1979). Routing and scheduling of school buses by computer. Transportation Science, 13(2), 113\u2013129.","journal-title":"Transportation Science"},{"issue":"8","key":"6360_CR5","doi-asserted-by":"publisher","first-page":"1214","DOI":"10.3390\/math8081214","volume":"8","author":"HI Calvete","year":"2020","unstructured":"Calvete, H. I., Gal\u00e9, C., Iranzo, J. A., et al. (2020). A partial allocation local search matheuristic for solving the school bus routing problem with bus stop selection. Mathematics, 8(8), 1214.","journal-title":"Mathematics"},{"issue":"9","key":"6360_CR6","doi-asserted-by":"publisher","first-page":"1390","DOI":"10.3390\/math10091390","volume":"10","author":"HI Calvete","year":"2022","unstructured":"Calvete, H. I., Gal\u00e9, C., & Iranzo, J. A. (2022). Approaching the pareto front in a biobjective bus route design problem dealing with routing cost and individuals\u2019 walking distance by using a novel evolutionary algorithm. Mathematics, 10(9), 1390.","journal-title":"Mathematics"},{"issue":"2","key":"6360_CR7","doi-asserted-by":"publisher","first-page":"1092","DOI":"10.1111\/itor.12951","volume":"30","author":"HI Calvete","year":"2023","unstructured":"Calvete, H. I., Gale, C., Iranzo, J. A., et al. (2023). The school bus routing problem with student choice: A bilevel approach and a simple and effective metaheuristic. International Transactions in Operational Research, 30(2), 1092\u20131119.","journal-title":"International Transactions in Operational Research"},{"key":"6360_CR8","doi-asserted-by":"publisher","first-page":"108101","DOI":"10.1016\/j.cie.2022.108101","volume":"168","author":"J D\u00edaz-Ram\u00edrez","year":"2022","unstructured":"D\u00edaz-Ram\u00edrez, J., Leal-Garza, C. M., & G\u00f3mez-Acosta, C. (2022). A smart school routing and scheduling problem for the new normalcy. Computers & Industrial Engineering, 168, 108101.","journal-title":"Computers & Industrial Engineering"},{"key":"6360_CR9","doi-asserted-by":"publisher","first-page":"102056","DOI":"10.1016\/j.omega.2019.03.014","volume":"95","author":"WA Ellegood","year":"2020","unstructured":"Ellegood, W. A., Solomon, S., North, J., et al. (2020). School bus routing problem: Contemporary trends and research directions. Omega, 95, 102056.","journal-title":"Omega"},{"key":"6360_CR10","doi-asserted-by":"publisher","first-page":"100054","DOI":"10.1016\/j.ejtl.2021.100054","volume":"10","author":"F Farzadnia","year":"2021","unstructured":"Farzadnia, F., & Lysgaard, J. (2021). Solving the service-oriented single-route school bus routing problem: Exact and heuristic solutions. EURO Journal on Transportation and Logistics, 10, 100054.","journal-title":"EURO Journal on Transportation and Logistics"},{"key":"6360_CR11","doi-asserted-by":"crossref","unstructured":"Ford, L., & Fulkerson, D. (1962). Flows in networks. Princeton University Press, vol. 276, p. 22.","DOI":"10.1515\/9781400875184"},{"key":"6360_CR12","doi-asserted-by":"publisher","first-page":"399","DOI":"10.4153\/CJM-1956-045-5","volume":"8","author":"LR Ford","year":"1956","unstructured":"Ford, L. R., & Fulkerson, D. R. (1956). Maximal flow through a network. Canadian Journal of Mathematics, 8, 399\u2013404.","journal-title":"Canadian Journal of Mathematics"},{"key":"6360_CR13","doi-asserted-by":"publisher","first-page":"103691","DOI":"10.1016\/j.trc.2022.103691","volume":"140","author":"X Guo","year":"2022","unstructured":"Guo, X., & Samaranayake, S. (2022). Shareability network based decomposition approach for solving large-scale single school routing problems. Transportation Research Part C: Emerging Technologies, 140, 103691.","journal-title":"Transportation Research Part C: Emerging Technologies"},{"key":"6360_CR14","unstructured":"Gurobi Optimization, LLC (2023) Gurobi optimizer reference manual. https:\/\/www.gurobi.com."},{"issue":"1","key":"6360_CR15","doi-asserted-by":"publisher","first-page":"21","DOI":"10.5038\/2375-0901.16.1.2","volume":"16","author":"B Kamali","year":"2013","unstructured":"Kamali, B., Mason, S. J., & Pohl, E. A. (2013). An analysis of special needs student busing. Journal of Public Transportation, 16(1), 21\u201345.","journal-title":"Journal of Public Transportation"},{"issue":"3","key":"6360_CR16","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1111\/itor.12080","volume":"21","author":"J Kinable","year":"2014","unstructured":"Kinable, J., Spieksma, F. C., & Vanden Berghe, G. (2014). School bus routing-a column generation approach. International Transactions in Operational Research, 21(3), 453\u2013478.","journal-title":"International Transactions in Operational Research"},{"issue":"2","key":"6360_CR17","first-page":"23","volume":"14","author":"AR Komijan","year":"2021","unstructured":"Komijan, A. R., Ghasemi, P., Khalili-Damghani, K., et al. (2021). A new school bus routing problem considering gender separation, special students and mix loading: A genetic algorithm approach. Journal of Optimization in Industrial Engineering, 14(2), 23\u201339.","journal-title":"Journal of Optimization in Industrial Engineering"},{"issue":"7","key":"6360_CR18","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1177\/03611981211016860","volume":"2675","author":"M Li","year":"2021","unstructured":"Li, M., & Chow, J. Y. (2021). School bus routing problem with a mixed ride, mixed load, and heterogeneous fleet. Transportation Research Record, 2675(7), 467\u2013479.","journal-title":"Transportation Research Record"},{"key":"6360_CR19","doi-asserted-by":"crossref","unstructured":"Louren\u00e7o, H. R., Martin, O. C., & St\u00fctzle, T. (2019). Iterated local search: Framework and applications. Handbook of metaheuristics, pp. 129\u2013168.","DOI":"10.1007\/978-3-319-91086-4_5"},{"key":"6360_CR20","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."},{"key":"6360_CR21","doi-asserted-by":"publisher","first-page":"105954","DOI":"10.1016\/j.cor.2022.105954","volume":"148","author":"VR M\u00e1ximo","year":"2022","unstructured":"M\u00e1ximo, V. R., Cordeau, J. F., & Nascimento, M. C. (2022). An adaptive iterated local search heuristic for the heterogeneous fleet vehicle routing problem. Computers & Operations Research, 148, 105954.","journal-title":"Computers & Operations Research"},{"issue":"3","key":"6360_CR22","doi-asserted-by":"publisher","first-page":"1108","DOI":"10.1016\/j.ejor.2021.02.024","volume":"294","author":"VR M\u00e1ximo","year":"2021","unstructured":"M\u00e1ximo, V. R., & Nascimento, M. C. (2021). A hybrid adaptive iterated local search with diversification control to the capacitated vehicle routing problem. European Journal of Operational Research, 294(3), 1108\u20131119.","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"6360_CR23","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1145\/321043.321046","volume":"7","author":"CE Miller","year":"1960","unstructured":"Miller, C. E., Tucker, A. W., & Zemlin, R. A. (1960). Integer programming formulation of traveling salesman problems. Journal of the ACM (JACM), 7(4), 326\u2013329.","journal-title":"Journal of the ACM (JACM)"},{"key":"6360_CR24","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1016\/j.eswa.2018.02.014","volume":"101","author":"DM Miranda","year":"2018","unstructured":"Miranda, D. M., de Camargo, R. S., Concei\u00e7\u00e3o, S. V., et al. (2018). A multi-loading school bus routing problem. Expert Systems with Applications, 101, 228\u2013242.","journal-title":"Expert Systems with Applications"},{"key":"6360_CR25","doi-asserted-by":"publisher","first-page":"115086","DOI":"10.1016\/j.eswa.2021.115086","volume":"180","author":"DM Miranda","year":"2021","unstructured":"Miranda, D. M., de Camargo, R. S., Concei\u00e7\u00e3o, S. V., et al. (2021). A metaheuristic for the rural school bus routing problem with bell adjustment. Expert Systems With Applications, 180, 115086.","journal-title":"Expert Systems With Applications"},{"key":"6360_CR26","first-page":"279","volume":"102","author":"P Mohandas","year":"2021","unstructured":"Mohandas, P., Saraswathy, M. V., & Alex, A. P. (2021). Development of an algorithm for bus routing and tracking for an educational institution: A case study. Journal of the Institution of Engineers (India): Series A, 102, 279\u2013292.","journal-title":"Journal of the Institution of Engineers (India): Series A"},{"issue":"1","key":"6360_CR27","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/0038-0121(69)90051-2","volume":"3","author":"RM Newton","year":"1969","unstructured":"Newton, R. M., & Thomas, W. H. (1969). Design of school bus routes by computer. Socio-Economic Planning Sciences, 3(1), 75\u201385.","journal-title":"Socio-Economic Planning Sciences"},{"issue":"1","key":"6360_CR28","first-page":"1","volume":"4","author":"MSF Niasar","year":"2017","unstructured":"Niasar, M. S. F., Talarico, L., Sajadifar, M., et al. (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), 1\u201314.","journal-title":"IJSOM: International Journal of Supply and Operations Management"},{"issue":"2","key":"6360_CR29","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/j.ejor.2009.05.017","volume":"202","author":"J Park","year":"2010","unstructured":"Park, J., & Kim, B. I. (2010). The school bus routing problem: A review. European Journal of operational research, 202(2), 311\u2013319.","journal-title":"European Journal of operational research"},{"issue":"4","key":"6360_CR30","doi-asserted-by":"publisher","first-page":"e09291","DOI":"10.1016\/j.heliyon.2022.e09291","volume":"8","author":"AC P\u00e9rez","year":"2022","unstructured":"P\u00e9rez, A. C., S\u00e1nchez-Ansola, E., Rosete, A., et al. (2022). A partial evaluation approach for the school bus routing problem. Heliyon, 8(4), e09291.","journal-title":"Heliyon"},{"key":"6360_CR31","doi-asserted-by":"publisher","first-page":"119519","DOI":"10.1109\/ACCESS.2019.2936922","volume":"7","author":"J Ren","year":"2019","unstructured":"Ren, J., Jin, W., & Wu, W. (2019). A two-stage algorithm for school bus stop location and routing problem with walking accessibility and mixed load. IEEE Access, 7, 119519\u2013119540.","journal-title":"IEEE Access"},{"issue":"2","key":"6360_CR32","doi-asserted-by":"publisher","first-page":"04018018","DOI":"10.1061\/(ASCE)UP.1943-5444.0000454","volume":"144","author":"LdPA Sales","year":"2018","unstructured":"Sales, Ld. P. A., Melo, C. S., TdOe, Bonates, et al. (2018). Memetic algorithm for the heterogeneous fleet school bus routing problem. Journal of Urban Planning and Development, 144(2), 04018018.","journal-title":"Journal of Urban Planning and Development"},{"key":"6360_CR33","doi-asserted-by":"publisher","first-page":"4821927","DOI":"10.1155\/2022\/4821927","volume":"2022","author":"E S\u00e1nchez-Ansola","year":"2022","unstructured":"S\u00e1nchez-Ansola, E., P\u00e9rez-P\u00e9rez, A. C., Rosete, A., et al. (2022). Conscious exploration of alpha-cuts in the parametric solution of the school bus routing problem with fuzzy walking distance. Computational Intelligence and Neuroscience, 2022, 4821927.","journal-title":"Computational Intelligence and Neuroscience"},{"issue":"2","key":"6360_CR34","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1016\/j.ejor.2013.02.025","volume":"229","author":"P Schittekat","year":"2013","unstructured":"Schittekat, P., Kinable, J., S\u00f6rensen, K., et al. (2013). A metaheuristic for the school bus routing problem with bus stop selection. European Journal of Operational Research, 229(2), 518\u2013528.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"6360_CR35","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/s42979-022-01466-6","volume":"4","author":"M Sciortino","year":"2022","unstructured":"Sciortino, M., Lewis, R., & Thompson, J. (2022). A school bus routing heuristic algorithm allowing heterogeneous fleets and bus stop selection. SN Computer Science, 4(1), 74.","journal-title":"SN Computer Science"},{"issue":"11","key":"6360_CR36","doi-asserted-by":"publisher","first-page":"1899","DOI":"10.1016\/j.cor.2009.10.011","volume":"37","author":"A Subramanian","year":"2010","unstructured":"Subramanian, A., Drummond, L. M., Bentes, C., et al. (2010). A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery. Computers & Operations Research, 37(11), 1899\u20131911.","journal-title":"Computers & Operations Research"},{"issue":"2","key":"6360_CR37","doi-asserted-by":"publisher","first-page":"2630","DOI":"10.1109\/JSYST.2020.3021005","volume":"15","author":"Y Xie","year":"2020","unstructured":"Xie, Y., Guo, Y., Zhou, T., et al. (2020). A strategy to alleviate rush hour traffics in urban areas based on school-trip commute information. IEEE Systems Journal, 15(2), 2630\u20132641.","journal-title":"IEEE Systems Journal"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-024-06360-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-024-06360-3","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-024-06360-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T11:04:17Z","timestamp":1772622257000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-024-06360-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,20]]},"references-count":37,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["6360"],"URL":"https:\/\/doi.org\/10.1007\/s10479-024-06360-3","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,11,20]]},"assertion":[{"value":"31 July 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 October 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 November 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}