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

Algorithm 1

Cuckoo search algorithm.

Generate initial population of n nests 𝑦_𝑖, 𝑖=1,2,…,𝑛

for  i = 1 : n

 Calculate fitness value 𝐹_𝑖=𝑓(𝑦_𝑖)

end for

while (stopping criterion is not satisfied)

 Generate a cuckoo egg (𝑦_𝑗) by Lévy flights from random nest

 Calculatefitness value 𝐹_𝑗=𝑓(𝑦_𝑗)

 Choose a random nest i

   if  𝐹_𝑗>𝐹_𝑖 then

   𝑦_𝑖←𝑦_𝑗

   𝐹_𝑖←𝐹_𝑗

   end if

 Abandon a fraction 𝑝_𝑎 of the worst nests

 Build new nests by Lévy flights

 Evaluate fitness of new nests and keep best nest

end while