Incorporating Equity into the School Bus Scheduling Problem
Authors: Dipayan Banerjee, Karen Smilowitz
Abstract: We consider the school bus scheduling problem (SBSP) which simultaneously determines school bell times and route schedules. Often, the goal of the SBSP is to minimize the number of buses required by a school district. We extend a time-indexed integer programming model to incorporate additional considerations related to equity and efficiency. We seek to equitably reduce the disutilities associated with changing school start times via a minimax model, then propose a lexicographic minimax approach to improve minimax solutions. We apply our models to randomized instances based on a moderately-sized public school district to show the impact of incorporating equity.
Tools for this paper
Ask questions about this paper to our AI assistant
You can also chat with multiple papers at once here.
⚠The license of the paper does not allow us to build upon its content and the AI assistant only knows about the paper metadata rather than the full article.
The previous summary was created more than a year ago and can be re-run (if necessary) by clicking on the Run button below.
⚠The license of this specific paper does not allow us to build upon its content and the summarizing tools will be run using the paper metadata rather than the full article. However, it still does a good job, and you can also try our tools on papers with more open licenses.
Look for similar papers (in beta version)
We compare the title and abstract with papers indexed in our database. For arXiv papers, we search within the same category; for DOI and other sources, we search across sources and subjects. You can rerun the search as our database grows.
Disclaimer: The AI-based summarization tool and virtual assistant provided on this website may not always provide accurate and complete summaries or responses. We encourage you to carefully review and evaluate the generated content to ensure its quality and relevance to your needs.