Xin-She Yang

Thanks. The fraction (pa) is checked by using the line (find this line in the code):
K=rand(size(nest))>pa;
which provides a vectorized implementation. That is, for n nests, you can check this in one go.

If the condition is true, then you update/replace the solutions by generating new solutions.

Thanks. That's a good question. The demo implementation uses
a given tolerance, but you can easily change it into a given
number of iteration by replacing the line "while (fmin>Tol)"
with the following two lines

N_numEval=1000;
for t=1:N_numEval,

and remove the line "N_iter=N_iter+n" because it becomes irrelevant.
Now the new stopping criterion should allow you to do things
more flexibly. Of course, to get better accuracy, you need to
increase N_numEval from 1000 to even 10000 or higher.

Hi, Thanks. The function you mentioned is too simple. Anyway,
if you want to test any function, just change the last line
(Line 175), also changed line 51 (the number of dimensions).

Hello,Xin-She Yang
I am Gurpreet Singh, student of M.tech Computer science.Now i am doing a work on thesis. I have needed your help in it. Can u please tell me that how we can implement Cuckoo search in a Vehicle Routung Problem.Can you guide me.
My mail id is gurujaswal@gmail.com

I am interest in your Cuckoo algorithm. May i know is there a 'train' function coded because I would want to use it to train neural network.
Thank you.