A Hybridization of Cuckoo Search and Differential Evolution for the Logistics Distribution Center Location Problem

Algorithm 1

Pseudocode of the proposed algorithm. A hybridization of cuckoo search and differential evolution (CSDE).

Initialize objective function

Initialize a population of individuals

For all do

Evaluate the fitness

End for

While (< Max Generation) and (the stop criterion is not met) do

For each individual do

Calculate the step size of CS by using (19)

new solutions updated using ((17)-(18))

new solutions updated using ((15)-(16))

Generate a new solution

Evaluate its quality/fitness

If ()

Replace by the new solution

End if

End for

Choose a nest among (say ) randomly

Abandon worse nests with a fraction and rebuild the corresponding new nests

,

Update

Keep the best solutions (or nests with quality solutions)

Rank the solutions and find the current best

End while

Post-process results and visualization