Mathematical Problems in Engineering
Volume 2019 (2019), Article ID 9640708, 2 pages
https://doi.org/10.1155/2019/9640708

Corrigendum

Corrigendum to “Lagrangian Relaxation for the Multiple Constrained Robust Shortest Path Problem”

Yiyong Pan

College of Automobile and Traffic Engineering, Nanjing Forestry University, No. 159 Longpan Road, Nanjing 210037, China

Correspondence should be addressed to Yiyong Pan; uoupanyg@163.com

Received 31 July 2019; Accepted 31 July 2019; Published 4 September 2019

Copyright © 2019 Yiyong Pan. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

In the article titled “Lagrangian Relaxation for the Multiple Constrained Robust Shortest Path Problem” [1], there were errors in Tables 5, 6, and 8, as follows:

(i)In Table 5, the values included in its first and last columns, except for the first cell in the latter, were incorrect.(ii)In Table 6, the values included in the last two cells in its last column were incorrect.(iii)In Table 8, the value included in the second cell in its last column was incorrect.

The corrected tables are shown below.

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

OD
U
L

Optimal path

41.32
40.45
2.10

61.94
58.87
4.95

57.31
55.6
2.98

56.43
55.5
1.64

59.24
57.91
2.24

51.66
50.02
3.17

40.60
40.60
0.00

49.13
46.89
4.55

49.08
49.08
0.00

52.14
51.23
1.74

Table 6: Computational results of the upper bound, lower bound, and relation gap with respect to the different constraints ().

W
U
L

Optimal path

No
No
No
No

41.32
40.45
2.10

37.56
36.12
3.83

37.56
37.56
0.00

Table 8: Computational results of the upper bound, lower bound, and relation gap with respect to the different constraints ().

W
U
L

Optimal path

72.44
70.39
2.83

61.94
58.87
4.95

57.12
54.39
4.77

53.20
53.20
0.00

References

Y. Pan, “Lagrangian relaxation for the multiple constrained robust shortest path problem,” Mathematical Problems in Engineering, vol. 2019, Article ID 3987278, 13 pages, 2019.