Instance Collection
Last updated: …
284 BDSP instances across 12 source types. Sizes range from 8 tours (73 legs) to 250 tours (2339 legs). Lower bounds are computed using Branch-and-Price where available; rows highlighted in green with 0.0% gap are proven optimal. Click an instance name for the per-algorithm breakdown. For the formal definition, see the problem reference.
Download
The original real-world instances cannot be publicly shared due to agreements with bus companies. An instance generator was developed to create realistic instances following similar distributions.
| Source | Description |
|---|---|
| DBAI Repository | 50 real-world-like instances (realistic_10_1 to realistic_100_50) |
| Extended Collection | Additional 15 large instances (realistic_150_51 to realistic_250_65) |
| Solution Validator | Python tool to check feasibility and compute objective breakdown (web version) |
Computational Setup
Hardware: Intel Xeon E5-2650 v4 @ 2.2 GHz
Time limit: 3600 seconds per instance for metaheuristics; Branch-and-Price ran until optimality or memory limit.
Software: Custom implementations in Python 3.10.14, executed with PyPy 7.3.17. Branch-and-Price was implemented in Java with OpenJDK 23.0.1, using Gurobi 12.0.0 for the master problem.
Instance Collection (284 instances)
Loading instance data…
Reporting New Best Solutions
If you find improved solutions, please contact tommanmaz.math@gmail.com to have them included in this table. You can also validate your solution online using the web-based validator before submitting.