Skip to main content

Anti-pheromone as a Tool for Better Exploration of Search Space

  • Conference paper
  • First Online:
Ant Algorithms (ANTS 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2463))

Included in the following conference series:

Abstract

Many animals use chemical substances known as pheromones to induce behavioural changes in other members of the same species. The use of pheromones by ants in particular has lead to the development of a number of computational analogues of ant colony behaviour including Ant Colony Optimisation. Although many animals use a range of pheromones in their communication, ant algorithms have typically focused on the use of just one, a substance that encourages succeeding generations of (artificial) ants to follow the same path as previous generations. Ant algorithms for multi-objective optimisation and those employing multiple colonies have made use of more than one pheromone, but the interactions between these different pheromones are largely simple extensions of single criterion, single colony ant algorithms. This paper investigates an alternative form of interaction between normal pheromone and anti-pheromone. Three variations of Ant Colony System that apply the anti-pheromone concept in different ways are described and tested against benchmark travelling salesman problems. The results indicate that the use of anti-pheromone can lead to improved performance. However, if anti-pheromone is allowed too great an influence on ants’ decisions, poorer performance may result.

This author is a PhD scholar supported by an Australian Postgraduate Award.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Vander Meer, R.K., Breed, M.D., Winston, M.L., Espelie, K.E. (eds.): Pheromone Communication in Social Insects. Ants, Wasps, Bees, and Termites. Westview Press, Boulder, Colorado (1997)

    Google Scholar 

  2. Heck, P.S., Ghosh, S.: A Study of Synthetic Creativity through Behavior Modeling and Simulation of an Ant Colony. IEEE Intelligent Systems 15 (2000) 58–66

    Article  Google Scholar 

  3. Kawamura, H., Yamamoto, M., Ohuchi, A.: Improved Multiple Ant Colonies System for Traveling Salesman Problems. In Kozan, E., Ohuchi, A. (eds.): Operations Research/Management Science at Work. Kluwer, Boston (2002) 41–59

    Google Scholar 

  4. Kawamura, H., Yamamoto, M., Suzuki, K., Ohuchi, A.: Multiple Ant Colonies Algorithm Based on Colony Level Interactions. IEICE Transactions, Fundamentals E83-A (2000) 371–379

    Google Scholar 

  5. Schoonderwoerd, R., Holland, O.E., Bruten, J.L., Rothkrantz, L.J.M.: Ant-Based Load Balancing in Telecommunications Networks. Adaptive Behavior 2 (1996) 169–207

    Google Scholar 

  6. Mariano, C.E., Morales, E.: MOAQ: An Ant-Q Algorithm for Multiple Objective Optimization Problems. Genetic and Evolutionary Computation Conference (GECCO-99), Orlando, Florida (1999) 894–901

    Google Scholar 

  7. Michels, R., Middendorf, M.: An Ant System for the Shortest Common Supersequence Problem. In Corne, D., Dorigo, M., Glover, F. (eds.): New Ideas in Optimization. McGraw-Hill, London (1999) 51–61

    Google Scholar 

  8. Middendorf, M., Reischle, F., Schmeck, H.: Multi Colony Ant Algorithms. Parallel and Distributed Computing, Proceedings of the 15 IPDPS 2000 Workshops, Third Workshop on Biologically Inspired Solutions to Parallel Processing Problems (BioSP3), Cancun, Mexico (2000) 645–652

    Google Scholar 

  9. Iredi, S., Merkle, D., Middendorf, M.: Bi-Criterion Optimization with Multi Colony Ant Algorithms. Evolutionary Multi-Criterion Optimization, First International Conference (EMO’01), Zurich (2001) 359–372

    Google Scholar 

  10. Dorigo, M., Caro, G.D.: The Ant Colony Optimization Meta-heuristic. In Corne, D., Dorigo, M., Glover, F. (eds.): New Ideas in Optimization. McGraw-Hill, London (1999) 11–32

    Google Scholar 

  11. Dorigo, M., Gambardella, L.M.: Ant Colonies for the Traveling Salesman Problem. BioSystems 43 (1997) 73–81

    Article  Google Scholar 

  12. Dorigo, M., Di Caro, G., Gambardella, L.M.: Ant Algorithms for Distributed Discrete Optimization. Artificial Life 5 (1999) 137–172

    Article  Google Scholar 

  13. Randall, M., Montgomery, J.: The Accumulated Experience Ant Colony for the Travelling Salesman Problem. Proceedings of Inaugural Workshop on Artificial Life, Adelaide, Australia (2001) 79–87

    Google Scholar 

  14. Reinelt, G.: TSPLIB-A Traveling Salesman Problem Library. ORSA Journal of Computing 3 (1991) 376–384

    MATH  Google Scholar 

  15. Montgomery, J., Randall, M.: Alternative Pheromone Applications for Ant Colony Optimisation. Technical Report TR02-07, School of Information Technology, Bond University, Qld, Australia. Submitted to AI2002, 15th Australian Joint Conference on Artificial Intelligence, Canberra, Australia (2002)

    Google Scholar 

  16. Randall, M.: A General Framework for Constructive Meta-heuristics. In Kozan, E., Ohuchi, A. (eds.): Operations Research/Management Science at Work. Kluwer, Boston, MA (2002) 111–128

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Montgomery, J., Randall, M. (2002). Anti-pheromone as a Tool for Better Exploration of Search Space. In: Dorigo, M., Di Caro, G., Sampels, M. (eds) Ant Algorithms. ANTS 2002. Lecture Notes in Computer Science, vol 2463. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45724-0_9

Download citation

  • DOI: https://doi.org/10.1007/3-540-45724-0_9

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44146-5

  • Online ISBN: 978-3-540-45724-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics