{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T23:56:40Z","timestamp":1772755000794,"version":"3.50.1"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030729035","type":"print"},{"value":"9783030729042","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-72904-2_13","type":"book-chapter","created":{"date-parts":[[2021,3,26]],"date-time":"2021-03-26T11:03:03Z","timestamp":1616756583000},"page":"202-218","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A Heuristic Algorithm for School Bus Routing with Bus Stop Selection"],"prefix":"10.1007","author":[{"given":"Monique","family":"Sciortino","sequence":"first","affiliation":[]},{"given":"Rhyd","family":"Lewis","sequence":"additional","affiliation":[]},{"given":"Jonathan","family":"Thompson","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,3,27]]},"reference":[{"key":"13_CR1","unstructured":"http:\/\/rhydlewis.eu\/resources\/busprobs.zip"},{"key":"13_CR2","unstructured":"https:\/\/github.com\/MoniqueSciortino\/sbrpMaltaInstances"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Babaei, M., Rajabi-Bahaabadi, M.: School bus routing and scheduling with stochastic time-dependent travel times considering on-time arrival reliability. Comput. Ind. Eng. 138, 106125 (2019)","DOI":"10.1016\/j.cie.2019.106125"},{"issue":"12","key":"13_CR4","doi-asserted-by":"publisher","first-page":"1599","DOI":"10.1057\/palgrave.jors.2602305","volume":"58","author":"T Bekta\u015f","year":"2007","unstructured":"Bekta\u015f, T., Elmasta\u015f, S.: Solving school bus routing problems through integer programming. J. Oper. Res. Soc. 58(12), 1599\u20131604 (2007)","journal-title":"J. Oper. Res. Soc."},{"issue":"13","key":"13_CR5","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.: Optimizing schools\u2019 start time and bus routes. Proc. Nat. Acad. Sci. 116(13), 5943\u20135948 (2019)","journal-title":"Proc. Nat. Acad. Sci."},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1016\/j.cie.2015.12.007","volume":"99","author":"K Braekers","year":"2016","unstructured":"Braekers, K., Ramaekers, K., Nieuwenhuyse, I.V.: The vehicle routing problem: state of the art classification and review. Comput. Ind. Eng. 99, 300\u2013313 (2016)","journal-title":"Comput. Ind. Eng."},{"issue":"4","key":"13_CR7","doi-asserted-by":"publisher","first-page":"1349","DOI":"10.1287\/trsc.2016.0721","volume":"51","author":"H Caceres","year":"2017","unstructured":"Caceres, H., Batta, R., He, Q.: School bus routing with stochastic demand and duration constraints. Transp. Sci. 51(4), 1349\u20131364 (2017)","journal-title":"Transp. Sci."},{"issue":"4","key":"13_CR8","doi-asserted-by":"publisher","first-page":"e0153614","DOI":"10.1371\/journal.pone.0153614","volume":"11","author":"X Chen","year":"2015","unstructured":"Chen, X., Kong, Y., Dang, L., Hou, Y., Ye, X.: Exact and metaheuristic approaches for a bi-objective school bus scheduling problem. PLoS One 11(4), e0153614 (2015)","journal-title":"PLoS One"},{"issue":"1","key":"13_CR9","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","volume":"6","author":"GB Dantzig","year":"1959","unstructured":"Dantzig, G.B., Ramser, J.H.: The truck dispatching problem. Manag. Sci. 6(1), 80\u201391 (1959)","journal-title":"Manag. Sci."},{"key":"13_CR10","unstructured":"Desrosiers, J., Ferland, J.A., Rousseau, J.M., Lapalme, G., Chapleau, L.: An overview of a school busing system. Sci. Manag. Transp. Syst. 235\u2013243 (1981)"},{"issue":"2","key":"13_CR11","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1287\/trsc.23.2.141","volume":"23","author":"M Dror","year":"1989","unstructured":"Dror, M., Trudeau, P.: Savings by split delivery routing. Transp. Sci. 23(2), 141\u2013145 (1989)","journal-title":"Transp. Sci."},{"issue":"3","key":"13_CR12","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1002\/nav.3800370304","volume":"37","author":"M Dror","year":"1990","unstructured":"Dror, M., Trudeau, P.: Split delivery routing. Naval Res. Logistics 37(3), 383\u2013402 (1990)","journal-title":"Naval Res. Logistics"},{"key":"13_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.omega.2019.03.014","volume":"95","author":"WA Ellegood","year":"2020","unstructured":"Ellegood, W.A., Solomon, S., North, J., Campbell, J.F.: School bus routing problem: contemporary trends and research directions. Omega 95, 1\u201318 (2020)","journal-title":"Omega"},{"issue":"1\u20132","key":"13_CR14","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1016\/j.mcm.2007.02.007","volume":"47","author":"AGH Kek","year":"2008","unstructured":"Kek, A.G.H., Cheu, R.L., Meng, Q.: Distance-constrained capacitated vehicle routing problems with flexible assignment of start and end depots. Math. Comput. Model. 47(1\u20132), 140\u2013152 (2008)","journal-title":"Math. Comput. Model."},{"issue":"3","key":"13_CR15","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1287\/trsc.22.3.161","volume":"22","author":"G Laporte","year":"1988","unstructured":"Laporte, G., Nobert, Y., Taillefer, S.: Solving a family of multi-depot vehicle routing and location-routing problems. Transp. Sci. 22(3), 161\u2013172 (1988)","journal-title":"Transp. Sci."},{"key":"13_CR16","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.jda.2018.11.001","volume":"52\u201353","author":"R Lewis","year":"2018","unstructured":"Lewis, R., Smith-Miles, K.: A heuristic algorithm for finding cost-effective solutions to real-world school bus routing problems. J. Discrete Algorithms 52\u201353, 2\u201317 (2018)","journal-title":"J. Discrete Algorithms"},{"key":"13_CR17","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1016\/j.eswa.2016.03.005","volume":"56","author":"FM Lima","year":"2016","unstructured":"Lima, F.M., Pereira, D.S., Concei\u00e7\u00e3o, S.V., Ramos Nunes, N.T.: A mixed load capacitated rural school bus routing problem with heterogeneous fleet: algorithms for the Brazilian context. Expert Syst. Appl. 56, 320\u2013334 (2016)","journal-title":"Expert Syst. Appl."},{"key":"13_CR18","doi-asserted-by":"crossref","unstructured":"Newton, R.M., Thomas, W.H.: Design of school bus routes by computer. Socio Econ. Plann. Sci. 75\u201385 (1969)","DOI":"10.1016\/0038-0121(69)90051-2"},{"key":"13_CR19","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.: The school bus routing problem: a review. Eur. J. Oper. Res. 202, 311\u2013319 (2010)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"13_CR20","doi-asserted-by":"publisher","first-page":"04018018","DOI":"10.1061\/(ASCE)UP.1943-5444.0000454","volume":"144","author":"LD Sales","year":"2018","unstructured":"Sales, L.D., Melo, C.S., Bonates, T.D., Prata, B.D.: Memetic algorithm for the heterogeneous fleet school bus routing problem. J. Urban Plann. Dev. 144(2), 04018018 (2018)","journal-title":"J. Urban Plann. Dev."},{"issue":"5","key":"13_CR21","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1057\/palgrave.jors.2600924","volume":"51","author":"D Sariklis","year":"2000","unstructured":"Sariklis, D., Powell, S.: A heuristic method for the open vehicle routing problem. J. Oper. Res. Soc. 51(5), 564\u2013573 (2000)","journal-title":"J. Oper. Res. Soc."},{"issue":"2","key":"13_CR22","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., Sevaux, M., Spieksma, F., Springael, J.: A metaheuristic for the school bus routing problem with bus stop selection. Eur. J. Oper. Res. 229(2), 518\u2013528 (2013)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"13_CR23","doi-asserted-by":"publisher","first-page":"17","DOI":"10.3141\/2667-03","volume":"2667","author":"A Shafahi","year":"2017","unstructured":"Shafahi, A., Wang, Z., Haghani, A.: Solving the school bus routing problem by maximizing trip compatibility. Transp. Res. Rec. J. Transp. Res. Board 2667(1), 17\u201327 (2017)","journal-title":"Transp. Res. Rec. J. Transp. Res. Board"},{"issue":"2","key":"13_CR24","first-page":"137","volume":"6","author":"VS Siqueira","year":"2016","unstructured":"Siqueira, V.S., Silva, E.N., Silva, R.V., Rocha, M.L.: Implementation of the metaheuristic GRASP applied to the school bus routing problem. Int. J. E-Educ. E-Bus. E-Manag. E-Learn. 6(2), 137\u2013145 (2016)","journal-title":"Int. J. E-Educ. E-Bus. E-Manag. E-Learn."},{"issue":"8","key":"13_CR25","doi-asserted-by":"publisher","first-page":"e0202618","DOI":"10.1371\/journal.pone.0202618","volume":"13","author":"S Sun","year":"2018","unstructured":"Sun, S., Duan, Z., Xu, Q.: School bus routing problem in the stochastic and timedependent transportation network. PLoS ONE 13(8), e0202618 (2018)","journal-title":"PLoS ONE"}],"container-title":["Lecture Notes in Computer Science","Evolutionary Computation in Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-72904-2_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,31]],"date-time":"2021-03-31T23:05:59Z","timestamp":1617231959000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-72904-2_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030729035","9783030729042"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-72904-2_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"27 March 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EvoCOP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Evolutionary Computation in Combinatorial Optimization (Part of EvoStar)","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 April 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 April 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"evocop2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.evostar.org\/2021\/evocop\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}