需求 $\left(i,j\right)$

换挂站k

车流运输方案

需求 $\left(i,j\right)$

换挂站k

车流运输方案

(1, 2)

0

(1, 2)

(1, 2)

2

(1, 2, 4)

(1, 2)

2

(1, 2, 5)

(1, 2)

2

(1, 2, 6)

(1, 2)

2

(1, 2, 7)

(1, 2)

2

(1, 2, 8)

(1, 2)

2

(1, 2, 9)

(1, 2)

2

(1, 2, 10)

(1, 4)

0

(1, 4)

(1, 4)

2

(1, 2, 4)

(1, 4)

4

(1, 4, 5)

(1, 4)

4

(1, 4, 6)

(1, 4)

4

(1, 4, 7)

(1, 4)

4

(1, 4, 8)

(1, 4)

4

(1, 4, 9)

(1, 4)

4

(1, 4, 10)

(1, 5)

0

(1, 5)

(1, 4)

5

(1, 5, 6)

(1, 5)

5

(1, 5, 7)

(1, 5)

5

(1, 5, 8)

(1, 5)

5

(1, 5, 9)

(1, 5)

5

(1, 5, 10)

(1, 5)

2

(1, 2, 5)

(1, 5)

4

(1, 4, 5)

(1, 5)

2

(1, 2, 9)

(1, 2)

2

(1, 2, 10)

(1, 6)

0

(1, 6)

(1, 6)

2

(1, 2, 6)

(1, 6)

4

(1, 4, 6)

(1, 6)

6

(1, 5, 6)

(1, 6)

6

(1, 6, 7)

(1, 6)

6

(1, 6, 8)

(1, 6)

6

(1, 6, 9)

(1, 6)

6

(1, 6, 10)

(1, 7)

0

(1, 7)

(1, 7)

2

(1, 2, 7)

(1, 7)

4

(1, 4, 7)

(1, 7)

5

(1, 5, 7)

(1, 7)

6

(1, 6, 7)

(1, 7)

7

(1, 7, 8)

(1, 7)

7

(1, 7, 9)

(1, 7)

7

(1, 7, 10)

(1, 8)

0

(1, 8)

(1, 8)

2

(1, 2, 8)

(1, 8)

4

(1, 4, 8)

(1, 8)

5

(1, 5, 8)

(1, 8)

6

(1, 6, 8)

(1, 8)

7

(1, 7, 8)

(1, 9)

0

(1, 9)

(1, 9)

2

(1, 2, 9)

(1, 9)

4

(1, 4, 9)

(1, 9)

5

(1, 5, 9)

(1, 9)

6

(1, 6, 9)

(1, 9)

7

(1, 7, 9)

(1, 9)

9

(1, 9, 10)

(1, 9)

0

(1, 10)

(1, 10)

2

(1, 2, 10)

(1, 10)

4

(1, 4, 10)

(1, 10)

5

(1, 5, 10)

(1, 10)

6

(1, 6, 10)

(1, 10)

7

(1, 7, 10)

(1, 10)

9

(1, 9, 10)

(2, 4)

0

(2, 4)

(2, 4)

4

(2, 4, 5)

(2, 4)

4

(2, 4, 6)

(2, 4)

4

(2, 4, 7)

(2, 4)

4

(2, 4, 8)

(2, 4)

4

(2, 4, 9)