Data-Driven Optimization of Public Transit Schedule
Sanchita Basak, Fangzhou Sun, Saptarshi Sengupta, Abhishek Dubey

TL;DR
This paper introduces a data-driven approach to optimize bus schedules by clustering seasonal delay patterns and applying heuristic algorithms, improving on-time performance in public transit systems.
Contribution
It presents a novel clustering method for seasonal delay patterns and compares multiple heuristic algorithms for transit schedule optimization.
Findings
Genetic algorithm outperforms other heuristics in delay reduction.
Seasonal delay patterns significantly influence schedule optimization.
Sensitivity analysis provides insights into hyper-parameter tuning.
Abstract
Bus transit systems are the backbone of public transportation in the United States. An important indicator of the quality of service in such infrastructures is on-time performance at stops, with published transit schedules playing an integral role governing the level of success of the service. However there are relatively few optimization architectures leveraging stochastic search that focus on optimizing bus timetables with the objective of maximizing probability of bus arrivals at timepoints with delays within desired on-time ranges. In addition to this, there is a lack of substantial research considering monthly and seasonal variations of delay patterns integrated with such optimization strategies. To address these,this paper makes the following contributions to the corpus of studies on transit on-time performance optimization: (a) an unsupervised clustering mechanism is presented…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
