A formal relationship between ant colony optimizers and classifier systems

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper demonstrates that, with minimal modifications, a classifier system can be made to operate just as an ant colony optimizer does for solving the TSP. The paper contains a formal proof of this result, and suggests that the modifications made could be useful in other ways. In effect, the paper suggests that there may be a new role for classifier systems in optimization, inspired by the way that ant colony optimizers have achieved their successes. The paper also suggests that there may be ways suggested by classifier systems to modify ant colony optimization practice. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Davis, L. (2007). A formal relationship between ant colony optimizers and classifier systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4399 LNAI, pp. 258–269). Springer Verlag. https://doi.org/10.1007/978-3-540-71231-2_17

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free