A Converging ACO Algorithm for Stochastic Combinatorial Optimization

The paper presents a general-purpose algorithm for solving stochastic combinatorial optimization problems with the expected value of a random variable as objective and deterministic constraints. The algorithm follows the Ant Colony Optimization (ACO) approach and uses Monte-Carlo sampling for estima...

Ausführliche Beschreibung

Bibliographische Detailangaben

1. Verfasser:	Gutjahr, Walter J.
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Algorithmics. Computability. Computer arithmetics Ant colony optimization Applied sciences combinatorial optimization Computer science control theory systems convergence results Exact sciences and technology metaheuristics Monte-Carlo simulation Software stochastic optimization Theoretical computing
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!