Determining Optimal Link Capacity Expansions in Road Networks Using Cuckoo Search Algorithm with Lévy Flights

Table 6

Comparison of results from solving the 16-link network for scenario 2 (continued).

	GP	CG	QNEW	MILP	LMILP	PMC	CS
𝑦1	0.1013	0.1022	0.0916	0	0	0	0
𝑦2	2.1818	2.1796	2.1521	4.41	2.722	4.6905	4.6144
𝑦3	9.3423	9.3425	9.1408	10.00	9.246	9.9778	9.9419
𝑦4	0	0	0	0	0	0	0
𝑦5	0	0	0	0	0	0	0
𝑦6	9.0443	9.0441	8.8503	7.42	8.538	7.5554	7.3821
𝑦7	0	0	0	0	0	0	0
𝑦8	0.008	0.0074	0.0114	0.54	0	0.6333	0.5922
𝑦9	0	0	0	0	0	0	0
𝑦10	0	0	0	0	0	0	0
𝑦11	0	0	0	0	0	0	0
𝑦12	0.0375	0.0358	0.0377	0	0	0	0
𝑦13	0	0	0	0	0	0	0
𝑦14	0.0089	0.0083	0.0129	1.18	0	1.7664	1.3152
𝑦15	1.9433	1.9483	1.9706	0	0	0	0
𝑦16	18.9859	18.986	18.575	19.50	20.000	19.6737	20
⋮	⋮	⋮	⋮	⋮	⋮	⋮	⋮
Z	534.017	534.109	534.08	523.627	526.488	522.748	522.396
⋮	⋮	⋮	⋮	⋮	⋮	⋮	⋮
#	31	16	11	—	—	—	4

Note: Z describes the objective function value, and # denotes the number of Frank-Wolfe iterations performed.