Sammenlign metoder

	Robust Ant Colony Optimization	Robust Particle Swarm Optimization
Fagfelt	Simulering	Simulering
Familie	Process / pipeline	Process / pipeline
Opprinnelsesår	1992 (ACO); robust variants from ~2005	2000s
Opphavsperson	Dorigo, M. (ACO); robust extensions by multiple authors in 2000s–2010s	Kennedy, J. & Eberhart, R. C. (PSO); robustness extensions by multiple authors, 2000s
Type	Metaheuristic with robustness wrapper	Metaheuristic — robust swarm-based optimizer
Opprinnelig kilde	Dorigo, M. (1992). Optimization, learning and natural algorithms. PhD Thesis, Politecnico di Milano, Italy.	Kennedy, J., Eberhart, R. C., & Shi, Y. (2001). Swarm Intelligence. Morgan Kaufmann Publishers. ISBN: 9781558605954
Alias	Robust ACO, Uncertainty-aware ACO, Min-max ACO, Robust ACO Metaheuristic	Robust PSO, RPSO, Uncertainty-robust PSO, PSO with robustness
Relaterte	5	6
Sammendrag	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.	Robust Particle Swarm Optimization (Robust PSO) extends the classical PSO metaheuristic to explicitly account for uncertainty in the objective function, constraints, or decision variables. Rather than optimizing a single nominal objective, each candidate solution is evaluated over a set of uncertainty scenarios, and fitness is judged by a robustness criterion such as worst-case performance or expected value, yielding solutions that remain near-optimal even when conditions deviate from nominal assumptions.