Open Access. Powered by Scholars. Published by Universities.®
University of Arkansas, Fayetteville
Computer Science and Computer Engineering Undergraduate Honors Theses
Articles 1 - 1 of 1
Full-Text Articles in Theory and Algorithms
Ant Colony Optimization For Continuous Spaces, Rachel Findley
Ant Colony Optimization For Continuous Spaces, Rachel Findley
Computer Science and Computer Engineering Undergraduate Honors Theses
Ant Colony Optimization (ACO) is an optimization algorithm designed to find semi-optimal solutions to Combinatorial Optimization Problems. The challenge of modifying this algorithm to effectively optimize over a continuous domain is one that has been tackled by several researchers. In this paper, ACO has been modified to use several variations of the algorithm for continuous spaces. An aspect of ACO which is crucial to its success when optimizing over a continuous space is choosing the appropriate object (solution component) out of an infinite set to add to the ant's path. This step is highly important in shaping good solutions. Important …