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

Table 4

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

	SAB	GP	CG	QNEW	MILP	CS
𝑦1	0	0	0	0	0	0
𝑦2	0	0	0	0	0	0
𝑦3	0	0	0	0	0	0
𝑦4	0	0	0	0	0	0
𝑦5	0	0	0	0	0	0
𝑦6	5.8352	5.8302	6.1989	6.0021	4.41	5.1894
𝑦7	0	0	0	0	0	0
𝑦8	0	0	0	0	0	0
𝑦9	0	0	0	0	0	0
𝑦10	0	0	0	0	0	0
𝑦11	0	0	0	0	0	0
𝑦12	0	0	0	0	0	0
𝑦13	0	0	0	0	0	0
𝑦14	0	0	0	0	0	0
𝑦15	0.9739	0.87	0.0849	0.1846	0	0
𝑦16	6.1762	6.1090	7.5888	7.5438	7.70	7.6076
⋮	⋮	⋮	⋮	⋮	⋮	⋮
Z	204.7	202.24	199.27	198.68	199.781	199.32
⋮	⋮	⋮	⋮	⋮	⋮	⋮
#	6	14	7	12	—	3

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