توی انجمن های ایرانی توی دوران 30 ، 40 سال پیش سیر می کنند بیشتر.
محض اطلاع اگر می خواهید کار علمی کنید با ابزار های نوین دست بکار بشید
الگوریتم فاخته تازه ترین الگوریتم هست.
ژنتیک واسه سال 1965 است ولی فاخته واسه سال 2009.
حالا خودتون قضاوت کنید.
محض اطلاع اگر می خواهید کار علمی کنید با ابزار های نوین دست بکار بشید
الگوریتم فاخته تازه ترین الگوریتم هست.
ژنتیک واسه سال 1965 است ولی فاخته واسه سال 2009.
حالا خودتون قضاوت کنید.
Cuckoo search
Cuckoo search (CS) is an optimization algorithm developed by Xin-She Yang and Suash Deb in 2009.
The pseudo-code can be summarized as:
Objective function:
Generate an initial population of n host nests;
While (t<MaxGeneration) or (stop criterion)
Get a cuckoo randomly (say, i) and replace its solution by performing Lévy flights;
Evaluate its quality/fitness Fi
[For maximization, ];
Choose a nest among n (say, j) randomly;
if (Fi > Fj),
Replace j by the new solution;
end if
A fraction (pa) of the worse nests are abandoned and new ones are built;
Keep the best solutions/nests;
Rank the solutions/nests and find the current best;
Pass the current best to the next generation;
end while
Post-processing the results and visualization
;Cuckoo search (CS) is an optimization algorithm developed by Xin-She Yang and Suash Deb in 2009.
The pseudo-code can be summarized as:
Objective function:
Generate an initial population of n host nests;
While (t<MaxGeneration) or (stop criterion)
Get a cuckoo randomly (say, i) and replace its solution by performing Lévy flights;
Evaluate its quality/fitness Fi
[For maximization, ];
Choose a nest among n (say, j) randomly;
if (Fi > Fj),
Replace j by the new solution;
end if
A fraction (pa) of the worse nests are abandoned and new ones are built;
Keep the best solutions/nests;
Rank the solutions/nests and find the current best;
Pass the current best to the next generation;
end while
Post-processing the results and visualization