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

Mathematics ◽  
2020 ◽  
Vol 8 (8) ◽  
pp. 1214
Author(s):  
Herminia I. Calvete ◽  
Carmen Galé ◽  
José A. Iranzo ◽  
Paolo Toth
Keyword(s):  
Feasible Solution ◽  
Computing Time ◽  
Walking Distance ◽  
School Bus ◽  
Routing Problem ◽  
Bus Stop ◽  
Bus Routing ◽  
Benchmark Instances ◽  
Bus Stops

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.

A metaheuristic for the school bus routing problem with bus stop selection

2013 ◽  
Vol 229 (2) ◽  
pp. 518-528 ◽  
Author(s):  
Patrick Schittekat ◽  
Joris Kinable ◽  
Kenneth Sörensen ◽  
Marc Sevaux ◽  
Frits Spieksma ◽  
...  
Keyword(s):  
School Bus ◽  
Routing Problem ◽  
Bus Stop ◽  
Bus Routing

A bi-level school bus routing problem with bus stops selection and possibility of demand outsourcing

2017 ◽  
Vol 61 ◽  
pp. 222-238 ◽  
Author(s):  
Seyed Parsa Parvasi ◽  
Mehdi Mahmoodjanloo ◽  
Mostafa Setak
Keyword(s):  
School Bus ◽  
Routing Problem ◽  
Bus Routing ◽  
Bus Stops

School Bus Routing and Student Assignment With Special-Need Student Consideration

2019 ◽  
pp. 38-63
Author(s):  
Di Zhang ◽  
Ki-Hwan G. Bae
Keyword(s):  
Time Window ◽  
Real Data ◽  
Walking Distance ◽  
School Bus ◽  
Routing Problem ◽  
Student Assignment ◽  
Bus Routing ◽  
School Time ◽  
Bus Service ◽  
Time Window Constraints

This chapter presents a modeling framework that solves a student assignment problem with bus stop selection, and subsequently a school bus routing problem with school time window constraints. The model incorporates the characteristics of special-need and general student population, and provides a school bus service schedule to transport both types of students. The student assignment model selects the number of optimal bus stops from available locations, and measures total student walking distance as part of service quality measure. The routing model includes a multi-objective function regarding service equity and quality that is of interest to decision makers. The authors demonstrate the efficacy of heuristic methods and a column generation technique implemented to solve the problems using real data from a suburban school district of a major U.S. city.

scholarly journals Optimal Bus Stops’ Allocation: A School Bus Routing Problem with Respect to Terrain Elevation

2018 ◽  
Vol 9 (2) ◽  
pp. 1-15
Author(s):  
Klemen Prah ◽  
Abolfazl Keshavarzsaleh ◽  
Tomaž Kramberger ◽  
Borut Jereb ◽  
Dejan Dragan
Keyword(s):  
Dynamic Properties ◽  
Three Dimensional ◽  
Optimal Solution ◽  
School Bus ◽  
Working Mechanism ◽  
Routing Problem ◽  
Bus Routing ◽  
Gis Data ◽  
Bus Stops ◽  
Terrain Elevation

Abstract The paper addresses the optimal bus stops allocation in the Laško municipality. The goal is to achieve a cost reduction by proper re-designing of a mandatory pupils’ transportation to their schools. The proposed heuristic optimization algorithm relies on data clustering and Monte Carlo simulation. The number of bus stops should be minimal possible that still assure a maximal service area, while keeping the minimal walking distances children have to go from their homes to the nearest bus stop. The working mechanism of the proposed algorithm is explained. The latter is driven by three-dimensional GIS data to take into account as much realistic dynamic properties of terrain as possible. The results show that the proposed algorithm achieves an optimal solution with only 37 optimal bus stops covering 94.6 % of all treated pupils despite the diversity and wideness of municipality, as well as the problematic characteristics of terrains’ elevation. The calculated bus stops will represent important guidelines to their actual physical implementation.

Development of a Java Library to Solve the School Bus Routing Problem

2020 ◽  
pp. 175-196
Author(s):  
Alberto Ochoa-Zezzatti ◽  
Ulises Carbajal ◽  
Oscar Castillo ◽  
José Mejía ◽  
Gilberto Rivera ◽  
...  
Keyword(s):  
School Bus ◽  
Routing Problem ◽  
Bus Routing ◽  
Java Library

Optimizing School Bus Stop Placement in Howard County, Maryland

2016 ◽  
pp. 1660-1676 ◽  
Author(s):  
Michael Galdi ◽  
Paporn Thebpanya
Keyword(s):  
Travel Time ◽  
Carbon Footprint ◽  
Current System ◽  
School Bus ◽  
School Officials ◽  
Statistical Estimates ◽  
Bus Stop ◽  
Network Analyst ◽  
Bus Stops ◽  
State And Local

In the current system, school bus stops in Howard County, Maryland are manually placed along the school bus routes based on safety, cost-efficiency, and many other variables. With such liberal placement, bus stops are sometimes placed unnecessarily. This issue is prevalent in many school districts and often results in needlessly close bus stop proximity. In this study, the authors implemented a GIS-based heuristic to assist school officials in optimizing their districts bus stop placement. They also estimated the proportion of county-wide bus stops that could be eliminated by this approach. Following the constraints determined by State and local guidelines, the ArcGIS Network Analyst Extension was used to identify unnecessary bus stops across the study area. The initial output was re-evaluated by school officials in order to determine if those bus stops would be eliminated. The results indicate that approximately 30% of the existing bus stops were marked as “candidates for elimination” by the GIS process. After a review of these candidates, it was determined that at least 15% of the total school bus stops could be eliminated. Statistical estimates lent credence to the benefit of a re-evaluation of these bus stops. The method developed in this study can easily be replicated. Hence, it may inspire other school systems to exercise the same approach. Additionally, the results provide a gateway for future studies in examining more efficient school bus routes with less travel time, as well as investigating how much the carbon footprint of school bus fleets can be reduced.

Sign in / Sign up

Export Citation Format

Share Document