{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,24]],"date-time":"2025-09-24T08:36:17Z","timestamp":1758702977954,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031165788"},{"type":"electronic","value":"9783031165795"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-16579-5_12","type":"book-chapter","created":{"date-parts":[[2022,9,13]],"date-time":"2022-09-13T23:02:54Z","timestamp":1663110174000},"page":"162-176","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Solving a\u00a0School Bus Routing Problem in\u00a0Rural Areas: An Application in\u00a0Brazil"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4827-0491","authenticated-orcid":false,"given":"Let\u00edcia","family":"Caldas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5715-149X","authenticated-orcid":false,"given":"Rafael","family":"Martinelli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2472-9280","authenticated-orcid":false,"given":"Bruno","family":"Rosa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,9,14]]},"reference":[{"issue":"7","key":"12_CR1","doi-asserted-by":"publisher","first-page":"4975","DOI":"10.1007\/s11276-019-01985-w","volume":"26","author":"JF Avil\u00e9s-Gonz\u00e1lez","year":"2020","unstructured":"Avil\u00e9s-Gonz\u00e1lez, J.F., Mora-Vargas, J., Smith, N.R., Cedillo-Campos, M.G.: Artificial intelligence and DOE: an application to school bus routing problems. Wirel. Netw. 26(7), 4975\u20134983 (2020)","journal-title":"Wirel. Netw."},{"issue":"12","key":"12_CR2","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":"8","key":"12_CR3","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., Toth, P.: A partial allocation local search matheuristic for solving the school bus routing problem with bus stop selection. Mathematics 8(8), 1214 (2020)","journal-title":"Mathematics"},{"issue":"1","key":"12_CR4","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1016\/j.retrec.2010.07.051","volume":"29","author":"WL Carvalho","year":"2010","unstructured":"Carvalho, W.L., da Cruz, R.O.M., C\u00e2mara, M.T., de Arag\u00e3o, J.J.G.: Rural school transportation in emerging countries: The Brazilian case. Res. Transp. Econ. 29(1), 401\u2013409 (2010)","journal-title":"Res. Transp. Econ."},{"unstructured":"Ceperj, F.: Popula\u00e7\u00e3o residente por situa\u00e7\u00e3o do domic\u00edlio. estado do rio de janeiro e seus munic\u00edpios - 1970 a 2010 (2019). http:\/\/encurtador.com.br\/mFGLV","key":"12_CR5"},{"issue":"3","key":"12_CR6","first-page":"409","volume":"46","author":"LX Dang","year":"2019","unstructured":"Dang, L.X., Hou, Y.E., Liu, Q.S., Kong, Y.F.: A hybrid metaheuristic algorithm for the bi-objective school bus routing problem. IAENG Int. J. Comput. Sci. 46(3), 409\u2013416 (2019)","journal-title":"IAENG Int. J. Comput. Sci."},{"doi-asserted-by":"crossref","unstructured":"Ellegood, W.A., Solomon, S., North, J., Campbell, J.F.: School bus routing problem: contemporary trends and research directions. Omega 95, 102056 (2019)","key":"12_CR7","DOI":"10.1016\/j.omega.2019.03.014"},{"key":"12_CR8","doi-asserted-by":"publisher","first-page":"158293","DOI":"10.1109\/ACCESS.2020.3019806","volume":"8","author":"YE Hou","year":"2020","unstructured":"Hou, Y.E., Dang, L., Dong, W., Kong, Y.: A metaheuristic algorithm for routing school buses with mixed load. IEEE Access 8, 158293\u2013158305 (2020)","journal-title":"IEEE Access"},{"issue":"4","key":"12_CR9","first-page":"775","volume":"47","author":"YE Hou","year":"2020","unstructured":"Hou, Y.E., Dang, L., Kong, Y., Wang, Z., Zhao, Q.: A hybrid metaheuristic algorithm for the heterogeneous school bus routing problem and a real case study. IAENG Int. J. Comput. Sci. 47(4), 775\u2013785 (2020)","journal-title":"IAENG Int. J. Comput. Sci."},{"unstructured":"IBGE: Rio de Janeiro (2020). https:\/\/www.ibge.gov.br\/cidades-e-estados\/rj\/.html","key":"12_CR10"},{"unstructured":"Idoeta, P.A., Magenta, M.: Transporte escolar, livros did\u00e1ticos e outros programas: o impacto do corte de gastos na educa\u00e7\u00e3o b\u00e1sica. BBC News Brasil (2019). https:\/\/www.bbc.com\/portuguese\/brasil-48273329","key":"12_CR11"},{"doi-asserted-by":"crossref","unstructured":"Kirkpatrick, S., Gelatt, C.D., Jr., Vecchi, M.P.: Optimization by simulated annealing. In: Readings in Computer Vision, pp. 606\u2013615. Elsevier (1987)","key":"12_CR12","DOI":"10.1016\/B978-0-08-051581-6.50059-3"},{"issue":"3","key":"12_CR13","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/0377-2217(92)90192-C","volume":"59","author":"G Laporte","year":"1992","unstructured":"Laporte, G.: The vehicle routing problem: an overview of exact and approximate algorithms. Eur. J. Oper. Res. 59(3), 345\u2013358 (1992)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"12_CR14","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1002\/net.3230110211","volume":"11","author":"JK Lenstra","year":"1981","unstructured":"Lenstra, J.K., Kan, A.R.: Complexity of vehicle routing and scheduling problems. Networks 11(2), 221\u2013227 (1981)","journal-title":"Networks"},{"key":"12_CR15","series-title":"International Series in Operations Research and Management Science","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/0-306-48056-5_11","volume-title":"Handbook of Metaheuristics","author":"HR Louren\u00e7o","year":"2003","unstructured":"Louren\u00e7o, H.R., Martin, O.C., St\u00fctzle, T.: Iterated local search. In: Glover, F., Kochenberger, G.A. (eds.) Handbook of Metaheuristics. ISOR, vol. 57, pp. 320\u2013353. Springer, Boston (2003). https:\/\/doi.org\/10.1007\/0-306-48056-5_11"},{"issue":"1","key":"12_CR16","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1111\/itor.12581","volume":"27","author":"J Lysgaard","year":"2020","unstructured":"Lysgaard, J., L\u00f3pez-S\u00e1nchez, A.D., Hern\u00e1ndez-D\u00edaz, A.G.: A matheuristic for the minmax capacitated open vehicle routing problem. Int. Trans. Oper. Res. 27(1), 394\u2013417 (2020)","journal-title":"Int. Trans. Oper. Res."},{"issue":"11","key":"12_CR17","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24(11), 1097\u20131100 (1997)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"12_CR18","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.: Design of school bus routes by computer. Socioecon. Plann. Sci. 3(1), 75\u201385 (1969)","journal-title":"Socioecon. Plann. Sci."},{"doi-asserted-by":"crossref","unstructured":"Oudouar, F., El Miloud, Z.: A hybrid heuristic for vehicle routing problem. In: Proceedings of the 4th International Conference on Big Data and Internet of Things, pp. 1\u20135 (2019)","key":"12_CR19","DOI":"10.1145\/3372938.3373014"},{"issue":"2","key":"12_CR20","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(2), 311\u2013319 (2010)","journal-title":"Eur. J. Oper. Res."},{"issue":"8","key":"12_CR21","doi-asserted-by":"publisher","first-page":"2403","DOI":"10.1016\/j.cor.2005.09.012","volume":"34","author":"D Pisinger","year":"2007","unstructured":"Pisinger, D., Ropke, S.: A general heuristic for vehicle routing problems. Comput. Oper. Res. 34(8), 2403\u20132435 (2007)","journal-title":"Comput. Oper. Res."},{"unstructured":"Porto, M.F., Sarubbi, J.F.M., Thi\u00e9ry, S., da Silva, C.M., Nunes, N.T.R., de Carvalho, I.R.V.: Developing a GIS for rural school transportation in Minas Gerais, Brazil. In: 6th International Multi-Conference on Complexity, Informatics and Cybernetics, IMCIC 2015 and 6th International Conference on Society and Information Technologies, ICSIT 2015-Proceedings, vol. 1, pp. 62\u201367. Citeseer (2015)","key":"12_CR22"},{"unstructured":"Rosa, B.A.B.: Uma Metodologia para Roteamento de Ve\u00edculos Escolares Utilizando Sistemas de Informa\u00e7\u00e3o Geogr\u00e1fica. Master\u2019s thesis, PUC-Rio (2018)","key":"12_CR23"},{"doi-asserted-by":"crossref","unstructured":"de Souza Lima, F.M.: A mixed load rural school bus routing problem with heterogeneous fleet: a study for the Brazilian problem (2015)","key":"12_CR24","DOI":"10.1016\/j.eswa.2016.03.005"},{"key":"12_CR25","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.cor.2014.10.019","volume":"58","author":"T Vidal","year":"2015","unstructured":"Vidal, T., Battarra, M., Subramanian, A., Erdo\u011fan, G.: Hybrid metaheuristics for the clustered vehicle routing problem. Comput. Oper. Res. 58, 87\u201399 (2015)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"12_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1515\/jlst-2015-0006","volume":"6","author":"J \u017derovnik","year":"2015","unstructured":"\u017derovnik, J.: Heuristics for NP-hard optimization problems: simpler is better!? Logist. Sustain. Transp. 6(1), 1\u201310 (2015)","journal-title":"Logist. Sustain. Transp."}],"container-title":["Lecture Notes in Computer Science","Computational Logistics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-16579-5_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,13]],"date-time":"2022-09-13T23:08:24Z","timestamp":1663110504000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-16579-5_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031165788","9783031165795"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-16579-5_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"14 September 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCL","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Logistics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Barcelona","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccl22022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eventum.upf.edu\/78123\/detail\/international-conference-on-computational-logistics-iccl-2022.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"64","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"48% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.5","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}