Research Article
An Exact Solution Approach for the Bus Line Planning Problem with Integrated Passenger Routing
Table 1
Optimal solutions for Mandl’s Swiss network with at most 8 nodes per line.
| Number of lines | Max nodes per line | TTT (min) | ATT (min) | CPU time (s) | Solutions checked (M) |
| 3 | 8 | 169450 | 10.88 | 13 | <1 | 4 | 163210 | 10.48 | 297 | 15 | 5 | 160450 | 10.31 | 3317 | 466 | 6 | 158500 | 10.18 | 18856 | 3785 | 7 | 157260 | 10.10 | 39753 | 6737 | 8 | 156750 | 10.07 | 161902 | 25704 | 9 | 156300 | 10.04 | 200872 | 24934 | 10 | 155940 | 10.02 | 29296 | 4032 | 11 | 155850 | 10.01 | 17054 | 1369 | 12 | 155820 | 10.01 | 16320 | 1044 | 13 | 155800 | 10.01 | 24883 | 1634 | 14 | 155790 | 10.01 | 1019 | 177 |
|
|