By Topic

An ant-based algorithm for annular sorting

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Marlyn Amos ; Department of Computing and Mathematics, Manchester Metropolitan University, UK ; Oliver Don

We present an ant-based algorithm for spatially sorting objects into an annular structure. The model is minimal, as it requires only stochastic ant behaviour coupled with a pheromone-inspired "attraction-repulsion" mechanism. This is the first annular sorting algorithm to consider the problem of objects with non-uniform size, as well as the situation where objects are pre-sorted. The algorithm consistently generates high-quality annular structures, and is particularly powerful in situations where the initial configuration of objects is similar to those observed in nature. We suggest that this model provides a powerful algorithmic framework, as well as a contribution to the study of "attraction-repulsion" models of animal behaviour.

Published in:

2007 IEEE Congress on Evolutionary Computation

Date of Conference:

25-28 Sept. 2007