{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,20]],"date-time":"2026-04-20T12:25:20Z","timestamp":1776687920633,"version":"3.51.2"},"reference-count":55,"publisher":"Informa UK Limited","issue":"4","funder":[{"name":"Vingroup Innovation Foundation","award":["VINIF.2024.DA072"],"award-info":[{"award-number":["VINIF.2024.DA072"]}]}],"content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["Journal of the Operational Research Society"],"published-print":{"date-parts":[[2026,4,3]]},"DOI":"10.1080\/01605682.2025.2519991","type":"journal-article","created":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T02:11:18Z","timestamp":1751249478000},"page":"1130-1149","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":1,"title":["The rescheduling school bus routing problem under a constraint on the number of students with negative impact"],"prefix":"10.1080","volume":"77","author":[{"given":"Quy Ta","family":"Dinh","sequence":"first","affiliation":[{"name":"ORLab, School of Computing, Phenikaa University","place":["Hanoi, Vietnam"]}]},{"given":"Thu Huong","family":"Dang","sequence":"additional","affiliation":[{"name":"Department of Management Science, Lancaster University","place":["Lancaster, UK"]}]},{"given":"Minh Ho\u00e0ng","family":"H\u00e0","sequence":"additional","affiliation":[{"name":"CADA, Faculty of Data Science and Artificial Intelligence, College of Technology, National Economics University","place":["Hanoi, Vietnam"]}]},{"given":"Duc Minh","family":"Vu","sequence":"additional","affiliation":[{"name":"Faculty of Data Science and Artificial Intelligence, College of Technology, National Economics University","place":["Hanoi, Vietnam"]}]},{"given":"Tien","family":"Mai","sequence":"additional","affiliation":[{"name":"School of Computing and Information Systems, Singapore Management University","place":["Singapore, Singapore"]}]}],"member":"301","published-online":{"date-parts":[[2025,6,29]]},"reference":[{"key":"e_1_3_3_2_1","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2602409"},{"key":"e_1_3_3_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/IEEM55944.2022.9989640"},{"key":"e_1_3_3_4_1","first-page":"193","article-title":"Solving of school bus routing problem by ant colony optimization","volume":"17","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"},{"key":"e_1_3_3_5_1","unstructured":"Augerat P. (1995). Approche Poly\u00e8drale du Probl\u00e8me de Tourn\u00e9es de V\u00e9hicules [PhD thesis]. Institut National Polytechnique de Grenoble-INPG."},{"key":"e_1_3_3_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0483(83)90033-6"},{"key":"e_1_3_3_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/0305-7097(75)90003-4"},{"key":"e_1_3_3_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/0965-8564(94)E0006-U"},{"key":"e_1_3_3_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(03)00238-8"},{"key":"e_1_3_3_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(85)90283-8"},{"key":"e_1_3_3_11_1","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2601324"},{"key":"e_1_3_3_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2021.102587"},{"key":"e_1_3_3_13_1","doi-asserted-by":"crossref","unstructured":"Delgado Serna C. R. & Bonrostro J. P. (2001). Minmax vehicle routing problems: Application to school transport in the province of burgos. In: S. Vo\u00df & J. R. Daduna (Eds.) Computer-aided scheduling of public transport. Lecture notes in economics and mathematical systems (vol 505). Springer.","DOI":"10.1007\/978-3-642-56423-9_17"},{"key":"e_1_3_3_14_1","doi-asserted-by":"publisher","DOI":"10.3390\/app14051872"},{"key":"e_1_3_3_15_1","doi-asserted-by":"publisher","DOI":"10.1057\/jors.2008.107"},{"key":"e_1_3_3_16_1","doi-asserted-by":"crossref","unstructured":"D\u00edaz-Parra O. Ruiz-Vanoye J. A. de los \u00c1ngeles Buenabad-Arias M. & Saenz A. C. (2013). Vertical transfer algorithm for the school bus routing problem. In: M. L. Gavrilova C.J.K. Tan A. Abraham (Eds.) Transactions on computational science XXI. Lecture notes in computer science (vol. 8160). Springer.","DOI":"10.1007\/978-3-642-45318-2_9"},{"key":"e_1_3_3_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0548(80)90006-4"},{"key":"e_1_3_3_18_1","doi-asserted-by":"publisher","DOI":"10.1080\/10095020.2012.708151"},{"key":"e_1_3_3_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2019.03.014"},{"issue":"3","key":"e_1_3_3_20_1","first-page":"63","article-title":"Open vehicle routing problem by ant colony optimization","volume":"5","author":"Er G. S.","year":"2014","unstructured":"Er, G. S., & Dhir, V. (2014). Open vehicle routing problem by ant colony optimization. International Journal of Advanced Computer Science and Applications, 5(3), 63\u201368.","journal-title":"International Journal of Advanced Computer Science and Applications,"},{"key":"e_1_3_3_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2011.10.002"},{"key":"e_1_3_3_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01096763"},{"key":"e_1_3_3_23_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1475-3995.2009.00663.x"},{"key":"e_1_3_3_24_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1475-3995.2009.00664.x"},{"key":"e_1_3_3_25_1","unstructured":"Fisher M. L. & Jaikumar R. (1984). The local delivery problem: Algorithms and applications. Publication of Elsevier Science Publishers BV."},{"key":"e_1_3_3_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2007.06.064"},{"key":"e_1_3_3_27_1","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2601817"},{"key":"e_1_3_3_28_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.22.2.340"},{"key":"e_1_3_3_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2013.08.017"},{"key":"e_1_3_3_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2016.09.002"},{"issue":"4","key":"e_1_3_3_31_1","first-page":"1","article-title":"A selection hyper-heuristic based on q-learning for school bus routing problem","volume":"52","author":"Hou Y.","year":"2022","unstructured":"Hou, Y., Gu, W., Wang, C., Yang, K., & Wang, Y. (2022). A selection hyper-heuristic based on q-learning for school bus routing problem. IAENG International Journal of Applied Mathematics, 52(4), 1\u20139.","journal-title":"IAENG International Journal of Applied Mathematics,"},{"key":"e_1_3_3_32_1","doi-asserted-by":"publisher","DOI":"10.3141\/2647-17"},{"key":"e_1_3_3_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2005.11.018"},{"key":"e_1_3_3_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2005.05.022"},{"key":"e_1_3_3_35_1","volume-title":"Proceedings of Ninth International Conference on Computer-Aided Scheduling of Public Transport","author":"Li J. Q.","year":"2004","unstructured":"Li, J. Q., Mirchandani, P. B., Borenstein, D. (2004). Parallel auction algorithm for bus rescheduling [Paper presentation]. Proceedings of Ninth International Conference on Computer-Aided Scheduling of Public Transport, San Diego, California."},{"key":"e_1_3_3_36_1","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2601341"},{"key":"e_1_3_3_37_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2014.04.008"},{"key":"e_1_3_3_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/0-306-48056-5_11"},{"key":"e_1_3_3_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-91086-4_5"},{"key":"e_1_3_3_40_1","first-page":"93","volume-title":"Proceedings of the Second International Conference on Soft Computing for Problem Solving (SocProS 2012)","author":"Minocha B.","year":"2012","unstructured":"Minocha, B., Tripathi, S. (2012). Solving school bus routing problem using hybrid genetic algorithm: A case study [Paper presentation]. Proceedings of the Second International Conference on Soft Computing for Problem Solving (SocProS 2012) December 28-30, JK Lakshmipat University (pp. 93\u2013103). Springer, 2014."},{"key":"e_1_3_3_41_1","doi-asserted-by":"publisher","DOI":"10.1016\/0038-0121(69)90051-2"},{"issue":"1","key":"e_1_3_3_42_1","first-page":"132","article-title":"Optimizing schedules for school bus routing problem: The case of Dar Es Salaam schools","volume":"6","author":"Ngonyani B.","year":"2015","unstructured":"Ngonyani, B., Mujuni, E., & Mushi, A. (2015). Optimizing schedules for school bus routing problem: The case of Dar Es Salaam schools. International Journal of Advanced Research in Computer Science, 6(1), 132\u2013136.","journal-title":"International Journal of Advanced Research in Computer Science,"},{"key":"e_1_3_3_43_1","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2601917"},{"key":"e_1_3_3_44_1","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.1120.0437"},{"key":"e_1_3_3_45_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2009.05.017"},{"key":"e_1_3_3_46_1","doi-asserted-by":"publisher","DOI":"10.1155\/2013\/874349"},{"key":"e_1_3_3_47_1","first-page":"168","volume-title":"Handbook of applied optimization","author":"Pitsoulis L. S.","year":"2002","unstructured":"Pitsoulis, L. S., & Resende, M. G. C. (2002). Greedy randomized adaptive search procedures. In Handbook of applied optimization (pp. 168\u2013183). Oxford University Press."},{"key":"e_1_3_3_48_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(03)00158-8"},{"key":"e_1_3_3_49_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85152-3_2"},{"key":"e_1_3_3_50_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2008.11.003"},{"key":"e_1_3_3_51_1","first-page":"219","article-title":"Greedy randomized adaptive search procedures","volume":"57","author":"Resende M. G. C.","year":"2003","unstructured":"Resende, M. G. C., & Ribeiro, C. C. (2003). Greedy randomized adaptive search procedures. International Series in Operations Research & Management Science, 57, 219\u2013249.","journal-title":"International Series in Operations Research & Management Science,"},{"key":"e_1_3_3_52_1","doi-asserted-by":"publisher","DOI":"10.1137\/0206041"},{"key":"e_1_3_3_53_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICAdLT.2013.6568426"},{"key":"e_1_3_3_54_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-013-0339-8"},{"key":"e_1_3_3_55_1","doi-asserted-by":"publisher","DOI":"10.1155\/2022\/2917240"},{"key":"e_1_3_3_56_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2009.06.021"}],"container-title":["Journal of the Operational Research Society"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/01605682.2025.2519991","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T12:17:38Z","timestamp":1773922658000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/01605682.2025.2519991"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,29]]},"references-count":55,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2026,4,3]]}},"alternative-id":["10.1080\/01605682.2025.2519991"],"URL":"https:\/\/doi.org\/10.1080\/01605682.2025.2519991","relation":{},"ISSN":["0160-5682","1476-9360"],"issn-type":[{"value":"0160-5682","type":"print"},{"value":"1476-9360","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,6,29]]},"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-08-12","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-03-20","order":1,"name":"revised","label":"Revised","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-06-04","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-06-29","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}