Runtime Analysis of an Ant Colony Optimization Algorithm for TSP Instances

Ant colony optimization (ACO) is a relatively new random heuristic approach for solving optimization problems. The main application of the ACO algorithm lies in the field of combinatorial optimization, and the traveling salesman problem (TSP) is the first benchmark problem to which the ACO algorithm...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	IEEE transactions on evolutionary computation Ročník 13; číslo 5; s. 1083 - 1092
Hlavní autor:	Yuren Zhou, Yuren Zhou
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York, NY IEEE 01.10.2009 Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:	Algorithm design and analysis Algorithmics. Computability. Computer arithmetics Algorithms Ant colony optimization Ant colony optimization (ACO) Applied sciences Artificial intelligence Benchmarking Biological system modeling Colonies Combinatorial analysis Computer science; control theory; systems Evolution (biology) Evolutionary algorithms Evolutionary computation Exact sciences and technology Flows in networks. Combinatorial problems Graphs heuristic algorithm Heuristic algorithms Learning and adaptive systems Logistics Operational research and scientific management Operational research. Management science Optimization Particle swarm optimization Partitioning algorithms Runtime runtime analysis Theoretical computing Traveling salesman problem traveling salesman problem (TSP) Traveling salesman problems Insecta Evolutionary algorithm Travelling salesman problem Combinatorial optimization Formicoidea heuristic algorithm Swarm intelligence Ant colony optimization (ACO) Aculeata Mathematical programming Probabilistic approach Complete graph Pheromone Social insect Particle swarm optimization Arthropoda Heuristic method Minimax method Problem solving runtime analysis Visibility Hymenoptera Invertebrata Algorithm analysis traveling salesman problem (TSP)
ISSN:	1089-778X, 1941-0026
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!