Research Article
An Exact Solution Approach for the Bus Line Planning Problem with Integrated Passenger Routing
Table 3
Optimal solutions for Mandl’s Swiss network with no limitations to route length.
| Number of lines | Max nodes per line | TTT (min) | ATT (min) | CPU time (s) | Solutions checked (M) |
| 3 | 14 | 163430 | 10.50 | 15 | 2 | 4 | 159990 | 10.28 | 168 | 44 | 5 | 158220 | 10.16 | 1641 | 433 | 6 | 157040 | 10.09 | 5357 | 1429 | 7 | 156550 | 10.05 | 33898 | 8002 | 8 | 156090 | 10.03 | 20359 | 5013 | 9 | 155930 | 10.01 | 14376 | 1829 | 10 | 155840 | 10.01 | 8002 | 816 | 11 | 155820 | 10.01 | 17590 | 1025 | 12 | 155800 | 10.01 | 46067 | 4036 | 13 | 155790 | 10.01 | 849 | 206 |
|
|