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

Table 5

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

	MINOS	HJ	EDO	IOA	SA	AL	SAB
𝑦1	0	0	0	0	0	0	0.0189
𝑦2	4.61	5.40	4.88	4.55	0	4.6153	2.2246
𝑦3	9.86	8.18	8.59	10.65	10.1740	9.8804	9.3394
𝑦4	0	0	0	0	0	0	0
𝑦5	0	0	0	0	0	0	0
𝑦6	7.71	8.10	7.48	6.43	5.7769	7.5995	9.0466
𝑦7	0	0	0.26	0	0	0.0016	0
𝑦8	0.59	0.90	0.85	0.59	0	0.6001	0.0175
𝑦9	0	0	0	0	0	0.001	0
𝑦10	0	0	0	0	0	0	0
𝑦11	0	0	0	0	0	0	0
𝑦12	0	0	0	0	0	0.1130	0.0816
𝑦13	0	0	0	0	0	0	0
𝑦14	1.32	3.90	1.54	1.32	0	1.3184	0.0198
𝑦15	19.14	8.10	0.26	19.36	0	2.7265	2.1429
𝑦16	0.85	8.40	12.52	0.78	17.2786	17.5774	18.9835
⋮	⋮	⋮	⋮	⋮	⋮	⋮	⋮
Z	557.14	557.22	540.74	556.61	528.497	532.71	536.084
⋮	⋮	⋮	⋮	⋮	⋮	⋮	⋮
#	—	134	12	13	24300	4000	45

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