Proposal of a method for routing school buses in a small-sized county
DOI:
https://doi.org/10.4025/actascitechnol.v44i1.58638Keywords:
school bus routing problem; vehicle routing problem; minimum path.Abstract
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.
Downloads
Downloads
Published
How to Cite
Issue
Section
License
DECLARATION OF ORIGINALITY AND COPYRIGHTS
I Declare that current article is original and has not been submitted for publication, in part or in whole, to any other national or international journal.
The copyrights belong exclusively to the authors. Published content is licensed under Creative Commons Attribution 4.0 (CC BY 4.0) guidelines, which allows sharing (copy and distribution of the material in any medium or format) and adaptation (remix, transform, and build upon the material) for any purpose, even commercially, under the terms of attribution.
Read this link for further information on how to use CC BY 4.0 properly.
