A Matheuristic Iterative Approach for Profit-Oriented Line Planning Applied to the Chinese High-Speed Railway Network

Table 2

The shortest paths for passenger OD pairs on the small example network.

O	D	The shortest paths
0	1	0, 2, 1
0	2	0, 2
0	3	0, 2, 3
0	4	0, 2, 1, 4/0, 2, 5, 4
0	5	0, 2, 5
0	6	0, 2, 1, 4, 6/0, 2, 5, 4, 6
1	2	1, 2
1	3	1, 2, 3
1	4	1, 4
1	5	1, 4, 5/1, 2, 5
1	6	1, 4, 6
2	3	2, 3
2	4	2, 1, 4/2, 5, 4
2	5	2, 5
2	6	2, 1, 4, 6/2, 5, 4, 6
3	4	3, 5, 4
3	5	3, 5
3	6	3, 5, 4, 6
4	5	4, 5
4	6	4, 6
5	6	5, 4, 6