Rural School Bus Routing and Scheduling

• URL: http://arxiv.org/abs/2507.19538v1
• Date: Tue, 22 Jul 2025 14:39:42 GMT
• Title: Rural School Bus Routing and Scheduling
• Authors: Prabhat Hegde, Vikrant Vaze,
• Abstract summary: Long school bus rides adversely affect student performance and well-being.<n>This paper focuses on the design of rural school bus routes and schedules.<n>We formalize a rural school bus routing and scheduling model that tackles these complexities while minimizing the total bus ride time of students.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Long school bus rides adversely affect student performance and well-being. Rural school bus rides are particularly long, incentivizing parents to drive their children to school rather than to opt for the school bus. This in turn exacerbates the traffic congestion around schools, further compounding the problem of long bus rides, creating a vicious cycle. It also results in underutilized school buses and higher bus operating costs per rider. To address these challenges, this paper focuses on the design of rural school bus routes and schedules, a particularly challenging problem due to its unique operational complexities, including mixed loading and irregular road networks. We formalize a rural school bus routing and scheduling model that tackles these complexities while minimizing the total bus ride time of students. We develop an original road network-aware cluster-then-route heuristic that leverages our problem formulation to produce high-quality solutions. For real-world case studies, our approach outperforms status quo solutions by reducing the bus ride times of students by 37-39 %. Our solutions also make the school bus more attractive, helping address both the underutilization of school buses and the prevalence of private commutes. Our routing and scheduling approach can improve school bus use by 17-19 % and reduce car trips that induce congestion near schools by 12-17 %. Many rural school districts share the operational characteristics modeled in this study, including long bus rides, high operational expenditures, mixed loading, and a high proportion of car-based school commutes, suggesting the broad applicability of our approach. Ultimately, by reducing student travel times, increasing school bus utilization, and alleviating congestion near schools, our approach enables rural school district planners to address transportation-related barriers to student performance and well-being.

Related papers

• Association between built environment characteristics and school run traffic congestion in Beijing, China [3.8996542996236605]
  School runs significantly exacerbate traffic congestion around schools, reducing the likelihood of free-flow by 8.34% during school run times. School-run traffic congestion is more severe in areas with multiple schools, bus stops, and scenescapes related to business and financial functions.
  arXiv  Detail & Related papers  (2024-11-18T09:05:49Z)
• GARLIC: GPT-Augmented Reinforcement Learning with Intelligent Control for Vehicle Dispatching [81.82487256783674]
  GARLIC: a framework of GPT-Augmented Reinforcement Learning with Intelligent Control for vehicle dispatching.<n>This paper introduces GARLIC: a framework of GPT-Augmented Reinforcement Learning with Intelligent Control for vehicle dispatching.
  arXiv  Detail & Related papers  (2024-08-19T08:23:38Z)
• RL-MSA: a Reinforcement Learning-based Multi-line bus Scheduling Approach [0.0]
  Existing approaches typically generate a bus scheduling scheme in an offline manner and then schedule buses according to the scheme. In this paper, MLBSP is modeled as a Markov Decision Process (MDP) A Reinforcement Learning-based Multi-line bus Scheduling Approach (RL-MSA) is proposed for bus scheduling at both the offline and online phases.
  arXiv  Detail & Related papers  (2024-03-11T07:07:05Z)
• An Online Approach to Solving Public Transit Stationing and Dispatch Problem [7.948662269574215]
  Transit agencies keep a limited number of vehicles in reserve and dispatch them to relieve the affected routes during disruptions. This paper describes a principled approach using non-myopic sequential decision procedures to solve the problem. Our experiments show that the proposed framework serves 2% more passengers while reducing deadhead miles by 40%.
  arXiv  Detail & Related papers  (2024-03-05T21:48:29Z)
• Fair collaborative vehicle routing: A deep multi-agent reinforcement learning approach [49.00137468773683]
  Collaborative vehicle routing occurs when carriers collaborate through sharing their transportation requests and performing transportation requests on behalf of each other. Traditional game theoretic solution concepts are expensive to calculate as the characteristic function scales exponentially with the number of agents. We propose to model this problem as a coalitional bargaining game solved using deep multi-agent reinforcement learning.
  arXiv  Detail & Related papers  (2023-10-26T15:42:29Z)
• Using Reinforcement Learning for the Three-Dimensional Loading Capacitated Vehicle Routing Problem [40.50169360761464]
  Collaborative vehicle routing has been proposed as a solution to increase efficiency. Current operations research methods suffer from non-linear scaling with increasing problem size. We develop a reinforcement learning model to solve the three-dimensional loading capacitated vehicle routing problem in approximately linear time.
  arXiv  Detail & Related papers  (2023-07-22T18:05:28Z)
• Bus Ridership Prediction with Time Section, Weather, and Ridership Trend Aware Multiple LSTM [0.10499611180329801]
  The correlation of bus ridership between consecutive bus stops should be considered for the prediction. The prediction has yet to be made using all of the features shown to be useful in each related study. This study proposes a prediction method that addresses both of these issues.
  arXiv  Detail & Related papers  (2023-04-13T04:35:41Z)
• Towards Understanding the Benefits and Challenges of Demand Responsive Public Transit- A Case Study in the City of Charlotte, NC [3.678540247562326]
  This study investigates the challenges faced by transit-dependent populations in Charlotte, NC. Our research initially evaluates critical issues such as extended wait times, unreliable schedules, and limited accessibility. This evaluation included an analysis of the existing Charlotte Area Transit System (CATS) mobile applications and the exploration of user acceptance for a proposed smart, on-demand transit technology.
  arXiv  Detail & Related papers  (2023-04-09T03:10:36Z)
• Real-Time Bus Arrival Prediction: A Deep Learning Approach for Enhanced Urban Mobility [2.1374208474242815]
  A prevalent challenge is the mismatch between actual bus arrival times and their scheduled counterparts, leading to disruptions in fixed schedules. This research introduces an innovative, AI-based, data-driven methodology for predicting bus arrival times at various transit points (stations) Through the deployment of a fully connected neural network, our method elevates the accuracy and efficiency of public bus transit systems.
  arXiv  Detail & Related papers  (2023-03-27T16:45:22Z)
• Increasing Students' Engagement to Reminder Emails Through Multi-Armed Bandits [60.4933541247257]
  This paper shows a real-world adaptive experiment on how students engage with instructors' weekly email reminders to build their time management habits. Using Multi-Armed Bandits (MAB) algorithms in adaptive experiments can increase students' chances of obtaining better outcomes. We highlight problems with these adaptive algorithms - such as possible exploitation of an arm when there is no significant difference.
  arXiv  Detail & Related papers  (2022-08-10T00:30:52Z)
• Flatland Competition 2020: MAPF and MARL for Efficient Train Coordination on a Grid World [49.80905654161763]
  The Flatland competition aimed at finding novel approaches to solve the vehicle re-scheduling problem (VRSP) The VRSP is concerned with scheduling trips in traffic networks and the re-scheduling of vehicles when disruptions occur. The ever-growing complexity of modern railway networks makes dynamic real-time scheduling of traffic virtually impossible.
  arXiv  Detail & Related papers  (2021-03-30T17:13:29Z)
• Polestar: An Intelligent, Efficient and National-Wide Public Transportation Routing Engine [43.09401975244128]
  We present Polestar, a data-driven engine for intelligent and efficient public transportation routing. Specifically, we first propose a novel Public Transportation Graph (PTG) to model public transportation system in terms of various travel costs. We then introduce a general route search algorithm coupled with an efficient station binding method for efficient route candidate generation. Experiments on two real-world data sets demonstrate the advantages of Polestar in terms of both efficiency and effectiveness.
  arXiv  Detail & Related papers  (2020-07-11T05:14:52Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.