Analysis of the Best-Worst Ant System and Its Variants on the QAP

Authors:
Oscar Cordón;Iñaki Fernández de Viana;Francisco Herrera
Affiliations:
-;-;-
Venue:
ANTS '02 Proceedings of the Third International Workshop on Ant Algorithms
Year:
2002

Citing 2
Cited 5

ACO algorithms for the quadratic assignment problem

New ideas in optimization
Ant algorithms for discrete optimization

Artificial Life

Ant Algorithms: Theory and Applications

Programming and Computing Software
Artificial Intelligence techniques: An introduction to their use for modelling environmental systems

Mathematics and Computers in Simulation
Analysis of the efficacy of a Two-Stage methodology for ant colony optimization: Case of study with TSP and QAP

Expert Systems with Applications: An International Journal
Modeling the performance of evolutionary algorithms on the root identification problem: A case study with pbil and chc algorithms

Evolutionary Computation
Replicating multi-quality web applications using ACO and bipartite graphs

ANTS'06 Proceedings of the 5th international conference on Ant Colony Optimization and Swarm Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this contribution, we will study the influence of the three components of the Best-Worst Ant System (BWAS) algorithm. As the importance of each of them as the fact whether all of them are necessary will be analyzed. Besides, we will introduce a new algorithm called Best-Worst Ant Colony System by combining the basis of the Ant Colony System with the special components of the BWAS. The performance of different variants of these algorithms will be tested when solving different instances of the QAP.