เปรียบเทียบวิธี
ดูวิธีที่เลือกเทียบกันแบบเคียงข้าง แถวที่ต่างกันจะถูกเน้นไว้
| Genetic Algorithm× | Ant Colony Optimization× | |
|---|---|---|
| สาขาวิชา | การหาค่าเหมาะที่สุด | การหาค่าเหมาะที่สุด |
| ตระกูล | Process / pipeline | Process / pipeline |
| ปีกำเนิด≠ | 1975 | 1992 (foundational thesis); 1997 (Ant Colony System formalization) |
| ผู้ริเริ่ม≠ | John Henry Holland | — |
| ประเภท≠ | Population-based metaheuristic | Metaheuristic — swarm intelligence |
| แหล่งต้นตำรับ≠ | Holland, J.H. (1975). Adaptation in Natural and Artificial Systems. University of Michigan Press. link ↗ | Dorigo, M. & Gambardella, L.M. (1997). Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem. IEEE Transactions on Evolutionary Computation, 1(1), 53-66. DOI ↗ |
| ชื่อเรียกอื่น | GA, evolutionary algorithm, Genetik Algoritma — Evrimsel Optimizasyon | ACO, Karınca Kolonisi Optimizasyonu (ACO), ant colony system |
| ที่เกี่ยวข้อง | 5 | 5 |
| สรุป≠ | 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. | Ant Colony Optimization (ACO) is a metaheuristic algorithm introduced by Marco Dorigo and colleagues in the early 1990s that solves combinatorial optimisation problems by simulating the collective foraging behaviour of ants. Real ants lay pheromone trails on paths and preferentially follow stronger trails; ACO turns this positive-feedback mechanism into a search procedure that finds high-quality solutions to graph-structured problems such as the Travelling Salesman Problem, vehicle routing, and scheduling. |
| ScholarGateชุดข้อมูล ↗ |
|
|