विधियों की तुलना करें
चुनी हुई विधियों की आमने-सामने समीक्षा करें; भिन्नता वाली पंक्तियाँ रेखांकित हैं।
| एजेंट-आधारित चींटी कॉलोनी अनुकूलन× | जेनेटिक एल्गोरिथम× | |
|---|---|---|
| क्षेत्र≠ | अनुकरण | अनुकूलन |
| परिवार | Process / pipeline | Process / pipeline |
| उद्भव वर्ष≠ | 1992-2004 | 1975 |
| प्रवर्तक≠ | Dorigo, M. and colleagues; agent-based framing developed in swarm intelligence community | John Henry Holland |
| प्रकार≠ | Metaheuristic optimization — agent-based swarm simulation | Population-based metaheuristic |
| मौलिक स्रोत≠ | Dorigo, M., Stutzle, T. (2004). Ant Colony Optimization. MIT Press, Cambridge, MA. ISBN: 9780262042192 | Holland, J.H. (1975). Adaptation in Natural and Artificial Systems. University of Michigan Press. link ↗ |
| उपनाम≠ | AB-ACO, Agent-Based ACO, Multi-Agent Ant Colony Optimization, MAACO | GA, evolutionary algorithm, Genetik Algoritma — Evrimsel Optimizasyon |
| संबंधित | 5 | 5 |
| सारांश≠ | Agent-Based Ant Colony Optimization (AB-ACO) models individual ants as autonomous agents that probabilistically construct solutions by following and depositing pheromone trails on a search graph. By coupling agent-level behavioral rules with a shared pheromone environment, the collective system converges on high-quality solutions to hard combinatorial and simulation-embedded optimization problems without central coordination. | 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डेटासेट ↗ |
|
|