เปรียบเทียบวิธี
ดูวิธีที่เลือกเทียบกันแบบเคียงข้าง แถวที่ต่างกันจะถูกเน้นไว้
| Ant Colony Optimization× | Simulated Annealing× | |
|---|---|---|
| สาขาวิชา | การหาค่าเหมาะที่สุด | การหาค่าเหมาะที่สุด |
| ตระกูล | Process / pipeline | Process / pipeline |
| ปีกำเนิด≠ | 1992 (foundational thesis); 1997 (Ant Colony System formalization) | 1983 |
| ผู้ริเริ่ม | — | — |
| ประเภท≠ | Metaheuristic — swarm intelligence | Probabilistic metaheuristic / local search |
| แหล่งต้นตำรับ≠ | 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 ↗ | Kirkpatrick, S., Gelatt, C.D. & Vecchi, M.P. (1983). Optimization by Simulated Annealing. Science, 220(4598), 671-680. DOI ↗ |
| ชื่อเรียกอื่น | ACO, Karınca Kolonisi Optimizasyonu (ACO), ant colony system | Benzetimli Tavlama (Simulated Annealing), SA, probabilistic local search |
| ที่เกี่ยวข้อง | 5 | 5 |
| สรุป≠ | 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. | Simulated annealing is a probabilistic local-search metaheuristic introduced by Kirkpatrick, Gelatt, and Vecchi in 1983. It models the physical annealing process in metallurgy — where a material is heated and then slowly cooled to reach a low-energy crystalline state — and uses this analogy to escape local optima in combinatorial and continuous optimization problems. |
| ScholarGateชุดข้อมูล ↗ |
|
|