Counter-Based ant colony optimization as a hardware-oriented meta-heuristic

Authors:
Bernd Scheuermann;Martin Middendorf
Affiliations:
Institute AIFB, University of Karlsruhe, Germany;Department of Computer Science, University of Leipzig, Germany
Venue:
EC'05 Proceedings of the 3rd European conference on Applications of Evolutionary Computing
Year:
2005

Citing 5
Cited 1

The ant colony optimization meta-heuristic

New ideas in optimization
Fast Ant Colony Optimization on Runtime Reconfigurable Processor Arrays

Genetic Programming and Evolvable Machines
A parallel implementation of ant colony optimization

Journal of Parallel and Distributed Computing - Problems in parallel and distributed computing: Solutions based on evolutionary paradigms
Pheromone Modification Strategies for Ant Algorithms Applied to Dynamic TSP

Proceedings of the EvoWorkshops on Applications of Evolutionary Computing
Ant colony system: a cooperative learning approach to the traveling salesman problem

IEEE Transactions on Evolutionary Computation

Quick-ACO: accelerating ant decisions and pheromone updates in ACO

EvoCOP'11 Proceedings of the 11th European conference on Evolutionary computation in combinatorial optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present the Counter-based Ant Colony Optimization (C-ACO) algorithm as a meta-heuristic, which allows for a resource-efficient implementation on Field Programmable Gate Arrays. In comparison to the standard ACO approach in software on a sequential machine, the implementation of C-ACO in hardware leads to significant asymptotic speed-ups. In experimental studies, we investigate the performance of the proposed C-ACO algorithm. Furthermore, we introduce and examine alternative means of integrating heuristic information into the optimization process, thereby considering the requirements of the hardware architecture.