Determining Optimal Link Capacity Expansions in Road Networks Using Cuckoo Search Algorithm with Lévy Flights
Table 9
Comparison of results from solving the Sioux Falls network (continued).
Initial value of
GP
CG
QNEW
PT
GA
CS
12.5
12.5
6.25
12.5
—
—
4.8693
4.7691
4.9776
5.0237
5.17
5.0916
4.8941
4.8605
5.0287
5.2158
2.94
1.3515
1.8694
3.0706
1.9412
1.8298
4.72
6.4903
1.5279
2.6836
2.1617
1.5747
1.76
2.2995
2.7168
2.8397
2.6333
2.7947
2.39
2.9074
2.7102
2.9754
2.7923
2.6639
2.91
2.0515
6.2455
5.6823
5.7462
6.1879
2.92
3.6725
5.0335
4.2726
5.6519
4.9624
5.99
5.2202
3.7597
4.4026
4.5738
4.0674
3.63
3.4230
3.5665
5.5183
4.1747
3.9199
4.43
4.8798
Z
82.71
82.53
83.08
82.53
81.74
81.51
#
9
6
5
7
77
36
Note: the upper bound for y was set to 25 for CS. Z describes the objective function value, and # denotes the number of Frank-Wolfe iterations performed.
