Research Article
A Simulated Annealing Approach for the Train Design Optimization Problem
Table 2
Train routes solution of Example
1.
| Train | Sequence | Station | Cumulative miles | Deliver cars | Pick up cars | Cars in the train | Crew change |
| | 1 | D | 0 | 0 | 63 | 63 | NO | 2 | C | 210 | 63 | 5 | 5 | NO | 3 | B | 286 | 0 | 42 | 47 | YES | 4 | A | 418 | 47 | 13 | 13 | NO | 5 | B | 550 | 13 | 0 | 0 | NO |
| | 1 | E | 0 | 0 | 12 | 12 | NO | 2 | D | 151 | 12 | 4 | 4 | YES | 3 | C | 361 | 0 | 0 | 4 | NO | 4 | B | 437 | 4 | 13 | 13 | NO | 5 | C | 513 | 0 | 48 | 61 | NO | 6 | D | 723 | 61 | 0 | 0 | NO |
| Total mileage | 1,273 | |
|
|