Cuckoo search (CS) is an optimization algorithm (finding a value x such that f(x) is as small (or as large) as possible) based on cuckoo species which laying their eggs in the nests of other host birds (of other species). The optimal solutions obtained by CS are far better than the best solutions obtained by an efficient particle swarm optimiser.

CS is based on three idealized rules:

1) Each cuckoo lays one egg at a time, and dumps its egg in a randomly chosen nest;

2) The best nests with high quality of eggs will carry over to the next generation;

3) The number of available hosts nests is fixed, and the egg laid by a cuckoo is discovered by the host bird with a probability . Discovering operate on some set of worst nests, and discovered solutions dumped from farther calculations.

Yang and Deb discovered that the random-walk style search is better performed by Lévy flights rather than simple random walk.

Uses:

The applications of Cuckoo Search into engineering optimization problems have shown its promising efficiency. For example, for both spring design and welded beam design problems, CS obtained better solutions than existing solutions in literature. A promising discrete cuckoo search algorithm is recently proposed to solve nurse scheduling problem.

You can read Xin-She Yang and Suash Deb's paper (Engineering Optimisation by Cuckoo Search) regarding this method in the attachment.

Cuckoo search (CS) is an optimization algorithm (finding a value x such that f(x) is as small (or as large) as possible) based on cuckoo species which laying their eggs in the nests of other host birds (of other species). The optimal solutions obtained by CS are far better than the best solutions obtained by an efficient particle swarm optimiser.

CS is based on three idealized rules:

1) Each cuckoo lays one egg at a time, and dumps its egg in a randomly chosen nest;

2) The best nests with high quality of eggs will carry over to the next generation;

3) The number of available hosts nests is fixed, and the egg laid by a cuckoo is discovered by the host bird with a probability . Discovering operate on some set of worst nests, and discovered solutions dumped from farther calculations.

Yang and Deb discovered that the random-walk style search is better performed by Lévy flights rather than simple random walk.

Uses:

The applications of Cuckoo Search into engineering optimization problems have shown its promising efficiency. For example, for both spring design and welded beam design problems, CS obtained better solutions than existing solutions in literature. A promising discrete cuckoo search algorithm is recently proposed to solve nurse scheduling problem.

You can read Xin-She Yang and Suash Deb's paper (Engineering Optimisation by Cuckoo Search) regarding this method in the attachment.

Philip, thanks for your reply. I think this would help me for my work.

Aditya sir , your doing linear optimization or non linear . i am interested on non linear sir

Radha krishna, I used nonlinear optimization using cuckoo search for a classroom project once.

Cuckoo search is becoming quite popular recently and not only that there are several bio-inspired algorithm that attract researchers to do more study on their optimisation capabilities. since Cuckoo search is good for optimising then it is good and proven that CS algorithm can significantly improve artificial neural networks by improving their weights. I think it is very interesting topic to be discover....

Thank u sir

Hi, you can use of this code for Cuckoo Search (CS) Algorithm.

It is an algorithm that has the particularity to use levy flghts to perturb soulutions. Such a perturbation some times is small and some times large.

how one could decides between a good egg and a bad egg ? or it is just the surviving eggs which are not found by host birds are good eggs?