方法对比

	鲁棒蚁群优化	鲁棒模拟退火
领域	仿真	仿真
方法族	Process / pipeline	Process / pipeline
起源年份	1992 (ACO); robust variants from ~2005	1983 (SA); robust variant emerged 1990s–2000s
提出者	Dorigo, M. (ACO); robust extensions by multiple authors in 2000s–2010s	Kirkpatrick, Gelatt & Vecchi (SA basis); robust formulation developed across the operations research community
类型	Metaheuristic with robustness wrapper	Metaheuristic with robustness evaluation
开创性文献	Dorigo, M. (1992). Optimization, learning and natural algorithms. PhD Thesis, Politecnico di Milano, Italy.	Kirkpatrick, S., Gelatt, C. D., Vecchi, M. P. (1983). Optimization by simulated annealing. Science, 220(4598), 671-680.
别名	Robust ACO, Uncertainty-aware ACO, Min-max ACO, Robust ACO Metaheuristic	RSA, Robust SA, Uncertainty-robust simulated annealing, Worst-case simulated annealing
相关	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.	Robust Simulated Annealing (RSA) adapts the classical simulated annealing metaheuristic to seek solutions that perform well not just under nominal conditions but across the full range of uncertain or adversarial parameter values. By embedding a robustness evaluation — worst-case, expected-case, or regret-based — into the SA acceptance step, RSA trades some nominal optimality for resilience, making it valuable when problem parameters are imprecisely known or subject to environmental variation.