The ACO/F-Race algorithm for combinatorial optimization under uncertainty

MaRDI QIDQ3500152zbMATH OpenFDO

Authors Mauro Birattari, Prasanna Balaprakash, Marco Dorigo

Publication date 3 June 2008

zbMATH Keywords

ant colony optimizationcombinatorial optimization under uncertainty

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Recommendations

• Stochastic Algorithms: Foundations and Applications
• Stochastic Algorithms: Foundations and Applications
• A survey on metaheuristics for stochastic combinatorial optimization
• scientific article; zbMATH DE number 1390344
• Combinatorial optimization under uncertainty

Cited in

(9)

• Heuristics for the probabilistic traveling salesman problem with deadlines based on quasi-parallel Monte Carlo sampling
• Recent trends in metaheuristics for stochastic combinatorial optimization
• Analysis of stochastic local search methods for the unrelated parallel machine scheduling problem
• On the finite-time dynamics of ant colony optimization
• Stochastic Algorithms: Foundations and Applications
• Local search for constrained graph clustering in biological networks
• Measuring instance difficulty for combinatorial optimization problems
• Adaptive sample size and importance sampling in estimation-based local search for the probabilistic traveling salesman problem
• A hybrid multi-swarm particle swarm optimization algorithm for the probabilistic traveling salesman problem

This page was built for publication: The \(ACO/F-Race\) algorithm for combinatorial optimization under uncertainty

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3500152)