השוואת שיטות

	חיפוש קוקייה	אופטימיזציית נחיל חלקיקים (PSO)
תחום	אופטימיזציה	אופטימיזציה
משפחה	Process / pipeline	Process / pipeline
שנת המקור	2009	1995
הוגה השיטה	—	—
סוג	Population-based metaheuristic / swarm intelligence	Population-based metaheuristic / swarm intelligence
מקור מכונן	Yang, X.S. & Deb, S. (2009). Cuckoo Search via Lévy Flights. 2009 World Congress on Nature & Biologically Inspired Computing (NaBIC), 210-214. IEEE.	Kennedy, J. & Eberhart, R. (1995). Particle Swarm Optimization. IEEE International Conference on Neural Networks (ICNN), 1942-1948.
כינויים	Guguk Kuşu Araması (Cuckoo Search), CS algorithm, Cuckoo Search via Lévy Flights	PSO, swarm intelligence optimization, Parçacık Sürü Optimizasyonu (PSO)
קשורות	6	6
תקציר	Cuckoo Search (CS) is a population-based metaheuristic optimization algorithm introduced by Xin-She Yang and Suash Deb in 2009. It models the obligate brood-parasitism of cuckoo birds — which lay eggs in other birds' nests — combined with Lévy flight random walks that enable long-range exploration of the search space. The algorithm has proven effective in structural engineering design, machine learning hyperparameter tuning, and other continuous black-box optimization problems.	Particle Swarm Optimization (PSO) is a population-based metaheuristic algorithm introduced by Kennedy and Eberhart in 1995, inspired by the collective movement of bird flocks and fish schools. Each candidate solution — called a particle — moves through the search space by updating its velocity and position based on its own best experience and the best experience of the entire swarm, enabling fast convergence across continuous optimization problems.