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

13000  330023  023222  2222 145000.4841A-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;

13300 130010 313111 1111 220000.7249A-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;