Research Article

Lagrangian Relaxation for the Multiple Constrained Robust Shortest Path Problem

Table 5

Computational results of the upper bound, lower bound, and relation gap with respect to the different OD pairs.

ODOptimal path

41.3240.452.10

61.9458.874.95

57.3155.62.98

56.4355.51.64

59.2457.912.24

51.6650.023.17

40.6040.600.00

49.1346.894.55

49.0849.080.00

52.1451.231.74