Research Article
The Bilevel Design Problem for Communication Networks on Trains: Model, Algorithm, and Verification
Table 5
The optimal solutions of Example
2.
| Optimal solution | Highest cost | Reliability | The optimal logical link |
| 1 3 0 0 0 3 3 0 0 2 3 0 2 3 2 2 2 2 2 2 2 | 14500 | 0.4841 | A-B; A-C; A-C-D; A-C-E; A-C-E-F; B-C; B-D; B-D-E; B-D-F; C-D; C-E; C-E-F; D-E; D-F; E-F; |
| 1 3 3 0 0 1 3 0 0 1 0 3 1 3 1 1 1 1 1 1 1 | 22000 | 0.7249 | A-B; A-C; A-D; A-D-E; A-D-F; B-C; B-D; B-D-E; B-D-F; C-D; C-D-E; C-F; D-E; D-F; E-F; |
|
|