Proposal of a method for routing school buses in a small-sized county
Autor(a) principal: | |
---|---|
Data de Publicação: | 2022 |
Outros Autores: | , , , |
Tipo de documento: | Artigo |
Idioma: | eng |
Título da fonte: | Acta scientiarum. Technology (Online) |
Texto Completo: | http://www.periodicos.uem.br/ojs/index.php/ActaSciTechnol/article/view/58638 |
Resumo: | The School Bus Routing Problem (SBRP) is widely discussed in the operations research literature and can be solved by several exact methods and heuristics. This problem seeks to designate the most efficient routes for a fleet of school buses, minimizing the total distance covered and considering variables such as bus stop locations, number of passengers, and the assigned destination for each of them. This study aims at solving a real case SBRP of a small-sized county located in the state of Paraná. The proposed method is based on the Capacitated Vehicle Routing Problem (CVRP) and Travelling Salesman Problem (TSP) combined with a heuristic correction that guarantees sequence constraints, in which the student has to be collected before visiting their destination school. It was possible to obtain two routes of 30.76 km and 17.42 km respectively and both with the total vehicles’ capacity of 24 students, which corresponds to the reduction of about 10% in the daily distance covered by two buses. |
id |
UEM-6_e723be9b3fa9f52fcd0b6eab78da96fb |
---|---|
oai_identifier_str |
oai:periodicos.uem.br/ojs:article/58638 |
network_acronym_str |
UEM-6 |
network_name_str |
Acta scientiarum. Technology (Online) |
repository_id_str |
|
spelling |
Proposal of a method for routing school buses in a small-sized countyProposal of a method for routing school buses in a small-sized countyschool bus routing problem; vehicle routing problem; minimum path.school bus routing problem; vehicle routing problem; minimum path.The School Bus Routing Problem (SBRP) is widely discussed in the operations research literature and can be solved by several exact methods and heuristics. This problem seeks to designate the most efficient routes for a fleet of school buses, minimizing the total distance covered and considering variables such as bus stop locations, number of passengers, and the assigned destination for each of them. This study aims at solving a real case SBRP of a small-sized county located in the state of Paraná. The proposed method is based on the Capacitated Vehicle Routing Problem (CVRP) and Travelling Salesman Problem (TSP) combined with a heuristic correction that guarantees sequence constraints, in which the student has to be collected before visiting their destination school. It was possible to obtain two routes of 30.76 km and 17.42 km respectively and both with the total vehicles’ capacity of 24 students, which corresponds to the reduction of about 10% in the daily distance covered by two buses.The School Bus Routing Problem (SBRP) is widely discussed in the operations research literature and can be solved by several exact methods and heuristics. This problem seeks to designate the most efficient routes for a fleet of school buses, minimizing the total distance covered and considering variables such as bus stop locations, number of passengers, and the assigned destination for each of them. This study aims at solving a real case SBRP of a small-sized county located in the state of Paraná. The proposed method is based on the Capacitated Vehicle Routing Problem (CVRP) and Travelling Salesman Problem (TSP) combined with a heuristic correction that guarantees sequence constraints, in which the student has to be collected before visiting their destination school. It was possible to obtain two routes of 30.76 km and 17.42 km respectively and both with the total vehicles’ capacity of 24 students, which corresponds to the reduction of about 10% in the daily distance covered by two buses.Universidade Estadual De Maringá2022-05-25info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionapplication/pdfhttp://www.periodicos.uem.br/ojs/index.php/ActaSciTechnol/article/view/5863810.4025/actascitechnol.v44i1.58638Acta Scientiarum. Technology; Vol 44 (2022): Publicação contínua; e58638Acta Scientiarum. Technology; v. 44 (2022): Publicação contínua; e586381806-25631807-8664reponame:Acta scientiarum. Technology (Online)instname:Universidade Estadual de Maringá (UEM)instacron:UEMenghttp://www.periodicos.uem.br/ojs/index.php/ActaSciTechnol/article/view/58638/751375154276Copyright (c) 2022 Acta Scientiarum. Technologyhttp://creativecommons.org/licenses/by/4.0info:eu-repo/semantics/openAccessMuzulon, Nádya Zanin Ferrari, Guilherme Neto Turra, Arthur Eduardo Leal, Gislaine Camila LapasiniLima, Rafael Henrique Palma 2022-06-07T11:47:34Zoai:periodicos.uem.br/ojs:article/58638Revistahttps://www.periodicos.uem.br/ojs/index.php/ActaSciTechnol/indexPUBhttps://www.periodicos.uem.br/ojs/index.php/ActaSciTechnol/oai||actatech@uem.br1807-86641806-2563opendoar:2022-06-07T11:47:34Acta scientiarum. Technology (Online) - Universidade Estadual de Maringá (UEM)false |
dc.title.none.fl_str_mv |
Proposal of a method for routing school buses in a small-sized county Proposal of a method for routing school buses in a small-sized county |
title |
Proposal of a method for routing school buses in a small-sized county |
spellingShingle |
Proposal of a method for routing school buses in a small-sized county Muzulon, Nádya Zanin school bus routing problem; vehicle routing problem; minimum path. school bus routing problem; vehicle routing problem; minimum path. |
title_short |
Proposal of a method for routing school buses in a small-sized county |
title_full |
Proposal of a method for routing school buses in a small-sized county |
title_fullStr |
Proposal of a method for routing school buses in a small-sized county |
title_full_unstemmed |
Proposal of a method for routing school buses in a small-sized county |
title_sort |
Proposal of a method for routing school buses in a small-sized county |
author |
Muzulon, Nádya Zanin |
author_facet |
Muzulon, Nádya Zanin Ferrari, Guilherme Neto Turra, Arthur Eduardo Leal, Gislaine Camila Lapasini Lima, Rafael Henrique Palma |
author_role |
author |
author2 |
Ferrari, Guilherme Neto Turra, Arthur Eduardo Leal, Gislaine Camila Lapasini Lima, Rafael Henrique Palma |
author2_role |
author author author author |
dc.contributor.author.fl_str_mv |
Muzulon, Nádya Zanin Ferrari, Guilherme Neto Turra, Arthur Eduardo Leal, Gislaine Camila Lapasini Lima, Rafael Henrique Palma |
dc.subject.por.fl_str_mv |
school bus routing problem; vehicle routing problem; minimum path. school bus routing problem; vehicle routing problem; minimum path. |
topic |
school bus routing problem; vehicle routing problem; minimum path. school bus routing problem; vehicle routing problem; minimum path. |
description |
The School Bus Routing Problem (SBRP) is widely discussed in the operations research literature and can be solved by several exact methods and heuristics. This problem seeks to designate the most efficient routes for a fleet of school buses, minimizing the total distance covered and considering variables such as bus stop locations, number of passengers, and the assigned destination for each of them. This study aims at solving a real case SBRP of a small-sized county located in the state of Paraná. The proposed method is based on the Capacitated Vehicle Routing Problem (CVRP) and Travelling Salesman Problem (TSP) combined with a heuristic correction that guarantees sequence constraints, in which the student has to be collected before visiting their destination school. It was possible to obtain two routes of 30.76 km and 17.42 km respectively and both with the total vehicles’ capacity of 24 students, which corresponds to the reduction of about 10% in the daily distance covered by two buses. |
publishDate |
2022 |
dc.date.none.fl_str_mv |
2022-05-25 |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/article info:eu-repo/semantics/publishedVersion |
format |
article |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
http://www.periodicos.uem.br/ojs/index.php/ActaSciTechnol/article/view/58638 10.4025/actascitechnol.v44i1.58638 |
url |
http://www.periodicos.uem.br/ojs/index.php/ActaSciTechnol/article/view/58638 |
identifier_str_mv |
10.4025/actascitechnol.v44i1.58638 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
http://www.periodicos.uem.br/ojs/index.php/ActaSciTechnol/article/view/58638/751375154276 |
dc.rights.driver.fl_str_mv |
Copyright (c) 2022 Acta Scientiarum. Technology http://creativecommons.org/licenses/by/4.0 info:eu-repo/semantics/openAccess |
rights_invalid_str_mv |
Copyright (c) 2022 Acta Scientiarum. Technology http://creativecommons.org/licenses/by/4.0 |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
application/pdf |
dc.publisher.none.fl_str_mv |
Universidade Estadual De Maringá |
publisher.none.fl_str_mv |
Universidade Estadual De Maringá |
dc.source.none.fl_str_mv |
Acta Scientiarum. Technology; Vol 44 (2022): Publicação contínua; e58638 Acta Scientiarum. Technology; v. 44 (2022): Publicação contínua; e58638 1806-2563 1807-8664 reponame:Acta scientiarum. Technology (Online) instname:Universidade Estadual de Maringá (UEM) instacron:UEM |
instname_str |
Universidade Estadual de Maringá (UEM) |
instacron_str |
UEM |
institution |
UEM |
reponame_str |
Acta scientiarum. Technology (Online) |
collection |
Acta scientiarum. Technology (Online) |
repository.name.fl_str_mv |
Acta scientiarum. Technology (Online) - Universidade Estadual de Maringá (UEM) |
repository.mail.fl_str_mv |
||actatech@uem.br |
_version_ |
1799315337959702528 |