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

Table 3

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

	MINOS	HJ	EDO	IOA	SA	AL
𝑦1	0	0	0	0	0	0
𝑦2	0	0	0	0	0	0
𝑦3	0	1.2	0.13	0	0	0.0062
𝑦4	0	0	0	0	0	0
𝑦5	0	0	0	0	0	0
𝑦6	6.58	3.00	6.26	6.95	3.1639	5.2631
𝑦7	0	0	0	0	0	0.0032
𝑦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.0064
𝑦12	0	0	0	0	0	0
𝑦13	0	0	0	0	0	0
𝑦14	0	0	0	0	0	0
𝑦15	7.01	3.00	0.13	5.66	0	0.71701
𝑦16	0.22	2.80	6.26	1.79	6.7240	6.7561
⋮	⋮	⋮	⋮	⋮	⋮	⋮
Z	211.25	215.08	201.84	210.86	198.10378	202.9913
⋮	⋮	⋮	⋮	⋮	⋮	⋮
#	—	54	10	9	18300	2700

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