Research Article
A Two-Stage Simulated Annealing Algorithm for the Many-to-Many Milk-Run Routing Problem with Pipeline Inventory Cost
Table 4
Vehicle routes of Mode 1.
| Vehicles | Routes of each vehicle |
| 1 | O-G-B-F-N-Q-P-O | 2 | Q-J-Q | 3 | M-D-C-P-M | 4 | O-J-E-M-O | 5 | Q-H-Q | 6 | N-K-A-F-O-M-P-Q-N | 7 | P-H-E-P | 8 | O-H-O | 9 | M-J-M | 10 | N-A-F-Q-N | 11 | N-H-N | 12 | M-I-L-P-Q-N-O-M | 13 | M-H-M | 14 | M-G-A-M | 15 | P-J-P | 16 | Q-J-L-E-N-Q | 17 | P-D-C-N-Q-P | 18 | M-B-F-O-M |
|
|