A mixed load capacitated rural school bus routing problem with heterogeneous fleet: Algorithms for the Brazilian context

Lima, Fátima Machado de Souza; Pereira, Davi Simões; Conceição, Samuel Vieira; Nunes, Nilson Tadeu Ramos

doi:10.1016/j.eswa.2016.03.005

Cited by 33 publications

(4 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Constraints (3) and (4) ensure that exactly one arc enters and leaves a bus stop if and only if the bus stop is selected. Constraints (5) and (6) guarantee that every student is allocated to a single bus stop, which must be selected to be visited. Constraints 7impose the connectivity of the solution and the bus capacity requirement.…”

Section: Definition and Ilp Model Of The Sbrp-ss-mdmentioning

confidence: 99%

“…The case of mixed loads, where the buses are allowed to carry students from more than one school at the same time, is dealt with by Ellegood et al [4], who provide a general analysis to assess the conditions under which mixed loading is likely to be beneficial. Souza Lima et al [5,6] deal with a multiobjective capacitated rural school bus routing problem with heterogeneous fleet and mixed loads. Miranda et al [7] expand the concept of mixed-load to multi-load, which means that the students can be picked up and delivered simultaneously.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A Partial Allocation Local Search Matheuristic for Solving the School Bus Routing Problem with Bus Stop Selection

et al. 2020

View full text Add to dashboard Cite

This paper addresses the school bus routing problem with bus stop selection, which jointly handles the problems of determining the set of bus stops to visit, allocating each student to one of these bus stops and computing the routes that visit the selected bus stops, so that the total routing cost is minimized and the walking distance of the students is limited by a given value. A fast and efficient matheuristic is developed based on an innovative approach that first partially allocates the students to a set of active stops that they can reach, and computes a set of routes that minimizes the routing cost. Then, a refining process is performed to complete the allocation and to adapt the routes until a feasible solution is obtained. The algorithm is tested on a set of benchmark instances. The computational results show the efficiency of the algorithm in terms of the quality of the solutions yielded and the computing time.

show abstract

Section: Definition and Ilp Model Of The Sbrp-ss-mdmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

A Partial Allocation Local Search Matheuristic for Solving the School Bus Routing Problem with Bus Stop Selection

et al. 2020

View full text Add to dashboard Cite

show abstract

“…The first classification concerns the number of schools, it is possible to find studies on routes with a single school (Babaei & Rajabi-Bahaabadi, 2019) or studies on multiple schools within a network (Yao et al, 2016). The second classification considers the environment in which the bus service takes place, which may be in an urban environment or, as in the study of Lima, Pereira, Conceição, and Nunes (2016), attending students from the rural area. The third classification takes into account the time of the day that the bus ride happens, which can be in the morning, in the afternoon or both, such as the paper of Rashidi et al (2009) where the bus ride only happens in the morning, or the study of Li and Fu (2002) who considered the delivery of students to schools during the morning period and the pick-up of students from schools and delivery to their bus stops during the afternoon.…”

Section: Introductionmentioning

confidence: 99%

Proposal of a method for routing school buses in a small-sized county

Muzulon

Ferrari²,

Turra³

et al. 2022

Acta Sci Technol

View full text Add to dashboard Cite

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.

show abstract

“…Además, ha sido aplicado en diferentes escenarios. Uno de estos se plasma en [3], en el cual se resuelve el problema de planificación de rutas de autobuses escolares en un área rural en Brasil y se cuenta con una flota con capacidad limitada. En el mismo se busca disminuir el costo y hacer el recorrido en un tiempo razonable.…”

Section: Introductionunclassified

A Metaheuristic Solution for the School Bus Routing Problem with Homogeneous Fleet and Bus Stop Selection

Pérez

Sánchez-Ansola

Rosete-Suárez

2021

Ing.

View full text Add to dashboard Cite

Contexto: Los problemas de optimización permiten representar situaciones de la vida real, y con un método apropiado se puede llegar a una buena solución del problema. Conceptualmente, el problema bajo estudio se conoce como problema de planificación de ruta de autobuses escolares. El presente trabajo puede ser tomado como punto de partida para la creación de herramientas para este problema. Método: En este trabajo se diseñó e implementó un modelo matemático del problema basado en la literatura y se adaptó para su solución usando algoritmos metaheurísticos. Se implementaron tres operadores de mutación y un mecanismo de selección basado en pesos, según las mejoras que brindaba cada uno a la solución. Para evaluar los resultados, se realizó una comparación estadística con otra solución de la literatura a partir de la evaluación de 112 instancias del problema. Resultados: En la solución de las 112 instancias del problema se utilizaron los siguientes algoritmos: búsqueda tabú, variantes del escalador de colinas, recocido simulado y un portafolio de algoritmos que incluye a los anteriores. Los resultados reflejaron que el mejor comportamiento lo obtuvo el portafolio con resultados comparables a los de la literatura. Sin embargo, a medida que crece el número de instancias, los resultados tienden a empeorar. Conclusiones: Con esta investigación se obtuvo un modelo que permite representar el problema inicial, así como dos algoritmos para la búsqueda de soluciones utilizando metaheurísticas. Según los resultados obtenidos, los trabajos futuros deben encaminarse hacia nuevas formas de construcción de la solución inicial y la implementación de nuevos operadores de asignación y mutación.

show abstract

A mixed load capacitated rural school bus routing problem with heterogeneous fleet: Algorithms for the Brazilian context

Cited by 33 publications

References 29 publications

A Partial Allocation Local Search Matheuristic for Solving the School Bus Routing Problem with Bus Stop Selection

A Partial Allocation Local Search Matheuristic for Solving the School Bus Routing Problem with Bus Stop Selection

Proposal of a method for routing school buses in a small-sized county

A Metaheuristic Solution for the School Bus Routing Problem with Homogeneous Fleet and Bus Stop Selection

Contact Info

Product

Resources

About