방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 강건 개미 군집 최적화× | 개미 군집 최적화× | |
|---|---|---|
| 분야≠ | 시뮬레이션 | 최적화 |
| 계열 | Process / pipeline | Process / pipeline |
| 기원 연도≠ | 1992 (ACO); robust variants from ~2005 | 1992 (foundational thesis); 1997 (Ant Colony System formalization) |
| 창시자≠ | Dorigo, M. (ACO); robust extensions by multiple authors in 2000s–2010s | — |
| 유형≠ | Metaheuristic with robustness wrapper | Metaheuristic — swarm intelligence |
| 원전≠ | Dorigo, M. (1992). Optimization, learning and natural algorithms. PhD Thesis, Politecnico di Milano, Italy. 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 ↗ |
| 별칭≠ | Robust ACO, Uncertainty-aware ACO, Min-max ACO, Robust ACO Metaheuristic | ACO, Karınca Kolonisi Optimizasyonu (ACO), ant colony system |
| 관련 | 5 | 5 |
| 요약≠ | Robust Ant Colony Optimization (Robust ACO) extends the classic ant colony metaheuristic by explicitly incorporating parameter uncertainty and worst-case or expected-case robustness criteria into the solution search. Rather than optimizing for a single nominal scenario, it seeks solutions that perform well across a range of plausible problem realizations, making it suitable for real-world combinatorial problems where input data (costs, demands, travel times) are uncertain or variable. | 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데이터셋 ↗ |
|
|