Comparer des méthodes
Examinez les méthodes sélectionnées côte à côte ; les lignes qui diffèrent sont mises en évidence.
| Optimisation par Colonies de Fourmis à Base d'Agents× | Algorithme génétique× | |
|---|---|---|
| Domaine≠ | Simulation | Optimisation |
| Famille | Process / pipeline | Process / pipeline |
| Année d'origine≠ | 1992-2004 | 1975 |
| Auteur d'origine≠ | Dorigo, M. and colleagues; agent-based framing developed in swarm intelligence community | John Henry Holland |
| Type≠ | Metaheuristic optimization — agent-based swarm simulation | Population-based metaheuristic |
| Source fondatrice≠ | 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 ↗ |
| Alias≠ | AB-ACO, Agent-Based ACO, Multi-Agent Ant Colony Optimization, MAACO | GA, evolutionary algorithm, Genetik Algoritma — Evrimsel Optimizasyon |
| Apparentées | 5 | 5 |
| Résumé≠ | 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. |
| ScholarGateJeu de données ↗ |
|
|