방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 강건 개미 군집 최적화× | 다목적 개미 군집 최적화 (MOACO)× | |
|---|---|---|
| 분야 | 시뮬레이션 | 시뮬레이션 |
| 계열 | Process / pipeline | Process / pipeline |
| 기원 연도≠ | 1992 (ACO); robust variants from ~2005 | 1999 |
| 창시자≠ | Dorigo, M. (ACO); robust extensions by multiple authors in 2000s–2010s | Gambardella, Taillard & Agazzi; Dorigo & Stützle |
| 유형≠ | Metaheuristic with robustness wrapper | Population-based metaheuristic |
| 원전≠ | Dorigo, M. (1992). Optimization, learning and natural algorithms. PhD Thesis, Politecnico di Milano, Italy. link ↗ | Gambardella, L. M., Taillard, E., & Agazzi, G. (1999). MACS-VRPTW: A multiple ant colony system for vehicle routing problems with time windows. In D. Corne, M. Dorigo, & F. Glover (Eds.), New Ideas in Optimization (pp. 63–76). McGraw-Hill. link ↗ |
| 별칭 | Robust ACO, Uncertainty-aware ACO, Min-max ACO, Robust ACO Metaheuristic | MOACO, Multi-Objective ACO, Pareto Ant Colony Optimization, Multi-objective ACO |
| 관련≠ | 5 | 4 |
| 요약≠ | 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. | Multi-Objective Ant Colony Optimization (MOACO) is a swarm-intelligence metaheuristic that extends the classic Ant Colony Optimization framework to simultaneously optimize two or more conflicting objectives. Artificial ants construct candidate solutions guided by pheromone trails and heuristic information, progressively building an archive of Pareto-optimal solutions rather than converging to a single best answer. |
| ScholarGate데이터셋 ↗ |
|
|