FANT: Fast ant system

Authors:
E. D. Taillard
Affiliations:
-
Venue:
FANT: Fast ant system
Year:
1998

Citing 0
Cited 7

Ant Colonies for the RCPS Problem

CCIA '02 Proceedings of the 5th Catalonian Conference on AI: Topics in Artificial Intelligence
A fast hybrid genetic algorithm for the quadratic assignment problem

Proceedings of the 8th annual conference on Genetic and evolutionary computation
Ant colony optimization with parameter adaptation for multi-mode resource-constrained project scheduling

Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology - Fuzzy theory and technology with applications
The single-finger keyboard layout problem

Computers and Operations Research
Testing of Hybrid Genetic Algorithms for Structured Quadratic Assignment Problems

Informatica
Chemical-reaction-inspired metaheuristic for optimization

IEEE Transactions on Evolutionary Computation
Parallelization strategies for hybrid metaheuristics using a single GPU and multi-core resources

PPSN'12 Proceedings of the 12th international conference on Parallel Problem Solving from Nature - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a new point of view of ant systems that is more general than previous ones, identifying artificial ants with processes that cooperate through a shared memory and a Queen process that co-ordinates the Ant processes. Then, we present FANT, a new meta-heuristic based on ant systems. The technique is very simple to implement while incorporating a number of search strategies such as intensification, diversification and learning mechanisms. FANT is used to solve various hard assignment problems and shown to be very competitive with other implementations using various meta-heuristics.