Bus Driver Scheduling Problem
A benchmark suite for the Bus Driver Scheduling Problem (BDSP), a combinatorial optimization problem from public-transport planning. The collection bundles 284 generated instances modelling Austrian collective-agreement and EU driving-time regulations, together with best known solutions, a Python validator, and reproducible algorithm results.
Browse Collection →
Filter, sort, and search 284 instances. Inspect best known solutions and per-algorithm results.
Problem Reference →
Formal definition, objective, key constraints, terminology, and instance file format.
Validate a Solution →
Upload a CSV solution and check feasibility + objective breakdown directly in the browser.
Download Archive →
Full tarball of all 284 instance JSONs. Also available individually from the collection page.
Validator on GitHub →
Standalone Python validator. Same logic as the in-browser version, runnable from the command line.
Publications →
JAIR 2025, ICAPS 2024, GECCO 2022, PATAT 2024 — papers underpinning the methods and data here.
How to Cite
If you use these instances or solutions in your research, please cite the JAIR article that describes the integrated column-generation / LNS pipeline behind the best known solutions:
@article{kletzander2025jair,
author = {Kletzander, Lucas and Mannelli Mazzoli, Tommaso and Musliu, Nysret and Van Hentenryck, Pascal},
title = {Integrating Column Generation and Large Neighborhood Search
for Bus Driver Scheduling with Complex Break Constraints},
journal = {Journal of Artificial Intelligence Research},
year = {2025},
doi = {10.1613/jair.1.19027}
}
Contact
Improved solutions, bug reports, and questions are welcome at tommanmaz.math@gmail.com.