Skip to main content

Ant Colony Extended: Search in Solution Spaces with a Countably Infinite Number of Solutions

  • Conference paper
Swarm Intelligence (ANTS 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6234))

Included in the following conference series:

  • 2800 Accesses

Abstract

Ant Colony Extended (ACE) is a new framework that allows to apply the ant colony paradigm [1] to solve combinatorial optimization problems, in which the values of each variable are taken from a finite set, and the set of possible solutions is countably infinite.

Previously, we applied ACE to autonomous ship manoeuvre planning [2], where the objective was to minimize the time of a manoeuvre. In this problem, as in the TSP and others, the value of the cost function increases monotonically as new elements are added to the solution sequence. We want to check the algorithm for problems that do not exhibit this feature. For this purpose we select a set of multi-modal functions to minimize with ACE: Griewank’s function (F2), Shekel’s foxholes (F3), Michalewicz’ function (F4) and Langerman’s function (F5). All functions are taken from [4].

These functions have many local minima, where algorithms may get stuck.We select the Simple Genetic Algorithm (SGA), and Differential Evolution (DE) to perform a comparison of local minima avoidance.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Dorigo, M., Stützle, T.: Ant colony optimization. The MIT Press, Cambridge (2004)

    MATH  Google Scholar 

  2. Escario, J.B., Jimenez, J.F., Giron-Sierra, J.M.: Autonomous ship manoeuvring planning based on the ant colony optimization algorithm. In: Proceedings of 8th Conference on Manoeuvring and Control of Marine Craft, MCMC 2009 (2009)

    Google Scholar 

  3. Gordon, D.: Ants at work: how an insect society is organized. Free Press, New York (1999)

    Google Scholar 

  4. Seront, G., Gambardella, L.: Results of the first international contest on evolutionary optimisation. In: Proceedings of 1st ICEO IEEE International Conference on Evolutionary Computation, pp. 611–615 (1996)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Escario, J.B., Jimenez, J.F., Giron-Sierra, J.M. (2010). Ant Colony Extended: Search in Solution Spaces with a Countably Infinite Number of Solutions. In: Dorigo, M., et al. Swarm Intelligence. ANTS 2010. Lecture Notes in Computer Science, vol 6234. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15461-4_56

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-15461-4_56

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-15460-7

  • Online ISBN: 978-3-642-15461-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics