ACOℝ-V - An algorithm that incorporates the visibility heuristic to the ACO in continuous domain

Ant Colony Optimization (ACO) is an optimization metaheuristic based on the foraging behavior of ants. This metaheuristic was originally proposed to find good solutions to discrete combinatorial problems. Many extensions of the ACO heuristic for continuous domain have been proposed, but even those t...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Conti, C. R., Roisenberg, M., Neto, G. S.
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Ant colony optimization Benchmark testing Cities and towns continuous domain Convergence convergence speed Equations heuristic Heuristic algorithms Optimization visibility
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!