विधियों की तुलना करें
चुनी हुई विधियों की आमने-सामने समीक्षा करें; भिन्नता वाली पंक्तियाँ रेखांकित हैं।
| मेमेटिक एल्गोरिथम× | जेनेटिक एल्गोरिथम× | |
|---|---|---|
| क्षेत्र | अनुकूलन | अनुकूलन |
| परिवार | Process / pipeline | Process / pipeline |
| उद्भव वर्ष≠ | 1989 | 1975 |
| प्रवर्तक≠ | Pablo Moscato | John Henry Holland |
| प्रकार≠ | Hybrid metaheuristic | Population-based metaheuristic |
| मौलिक स्रोत≠ | Moscato, P. (1989). On evolution, search, optimization, genetic algorithms and martial arts: Towards memetic algorithms. Caltech Concurrent Computation Program Report 826. link ↗ | Holland, J.H. (1975). Adaptation in Natural and Artificial Systems. University of Michigan Press. link ↗ |
| उपनाम≠ | Hybrid Evolutionary Algorithm, Cultural Algorithm (local-search variant), Genetic Local Search, Memetik Algoritma | GA, evolutionary algorithm, Genetik Algoritma — Evrimsel Optimizasyon |
| संबंधित≠ | 3 | 5 |
| सारांश≠ | A Memetic Algorithm (MA) is a population-based metaheuristic that combines the global exploration of an evolutionary algorithm with the local exploitation of individual learning procedures. Introduced by Pablo Moscato in 1989 at Caltech, MAs draw on Richard Dawkins' concept of the meme — a unit of cultural transmission — to model the idea that solutions can improve not only through crossover and mutation but also through individual refinement within each generation. | A genetic algorithm (GA) is a population-based metaheuristic optimization method introduced by John Henry Holland (1975) that mimics the principles of natural selection. It maintains a population of candidate solutions and iteratively improves them through selection, crossover, and mutation operators, making it especially powerful on discontinuous, non-convex, and multi-modal search spaces where classical gradient-based methods fail. |
| ScholarGateडेटासेट ↗ |
|
|