← 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
02213active cuckoo
12052quality 80%
22334quality 0%
32157quality 50%
42243quality 26%
51981quality 100%
62148quality 53%
72043quality 82%
— 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
1981.0
replacements
0
abandonments
0
~25% of nests replaced each epoch
cities: 12nests: 8pa: 0.25β (Lévy): 1.5