← Back to CS docs

teeline · algorithms/cs

Cuckoo Search

Each step a cuckoo applies k random 2-opt reversals (k drawn from a Lévy distribution) and competes with a random host nest — winner keeps the slot. At epoch end, each nest is independently abandoned with probability pa and re-seeded to maintain diversity.

01234567891011
Nests
02323active cuckoo
12152quality 33%
22327quality 11%
32165quality 31%
41935quality 61%
52410quality 0%
61629quality 100%
72294quality 15%
— current tour- - best tour— added edges- - removed edges◎ reversal endpoint▌ active cuckoo▌ target host
Press Step or Run to begin
Lévy step (last 30)  ■ hit  ■ miss  ■ abandon
levy draw
—
k reversals
—
epoch
0
step
0
best distance
1628.8
replacements
0
abandonments
0
~25% of nests replaced each epoch
cities: 12nests: 8pa: 0.25β (Lévy): 1.5