Skip to main content
SpringerLink
Log in

When Ants Attack: Ant Algorithms for Constraint Satisfaction Problems

A short Exposition of the concept

  • Published:
Artificial Intelligence Review Aims and scope Submit manuscript

Abstract

We describe an ant algorithm for solving constraint problems (Solnon 2002, IEEE Transactions on Evolutionary Computation 6(4): 347–357). We devise a number of variants and carry out experiments. Our preliminary results suggest that the best way to deposit pheromone and the best heuristics for state transitions may differ from current practice

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Achlioptas D., Gomes C.P., Kautz H.A., Selman B. (2000). Generating Satisfiable Problem Instances. In Proceedings of AAAI, 256–261

  • Achlioptas D., Kirousis L.M., Kranakis E., Krizanc D., Molloy M., Stamatiou Y. (2001). Random Constraint Satisfaction: A More Accurate Picture. Constraints 6(4):329–344

    Article  MathSciNet  MATH  Google Scholar 

  • Bullnheimer B., Hartl R., Strauss C. (1998). Applying the Ant System to the Vehicle Routing Problem. In: Osman I., Voss S., Martello S., Roucairol C (eds). Metaheuristics: Advances and Trends in Local Search Paradigms for Optimization Kluwer 109–120

  • Clark, D. A., Frank, J., Gent, I. P., MacIntyre, E., Tomov, N. & Walsh, T. (1996). Local Search and the Number of Solutions. In E. C. Freuder (ed.) Principles and Practice of Constraint Programming (Proceedings of CP’96), 119–133. LNCS 1118. Springer

  • Dorigo M., Caro G.D., Gambardella L.M. (1999). Ant Algorithms for Discrete Optimization. Artificial Life 5(2):137–172

    Article  PubMed  Google Scholar 

  • Dorigo M., Maniezzo V., Colorni A. (1996). The Ant System: Optimization by a Colony of Cooperating Agents. IEEE Transactions on Systems, Man, and Cybernetics – Part B 26(1):1–13

    Google Scholar 

  • Gent I.P., MacIntyre E., Prosser P., Smith B.M., Walsh T. (2001). Random Constraint Satisfaction: Flaws and Structure. Journal of Constraints 6(4):345–372

    MATH  MathSciNet  Google Scholar 

  • Gent, I. P., MacIntyre, E., Prosser, P., & Walsh, T. (1996). The Constrainedness of Search. In Proceedings of 13th AAAI, 246–252.

  • Mertens, K., Steegmans, E. & Holvoet, T. (2002). Cyclic Path-Based Environment: an Ant Environment for Solving Distributed Constraint Satisfaction Problems. In M. Yokoo (ed.) Proceedings of the 3rd International Workshop on Distributed Constraint Reasoning, 94–103

  • Roli, A., Blum, C. & Dorigo, M. (2001). ACO for Maximal Constraint Satisfaction Problems. In Proceedings of the 4th Metaheuristics International Conference, 187–191

  • Schoofs L., Naudts B. (2000). Ant Colonies are Good at Solving Constraint Satisfaction Problems. In Proceedings of the 2000 Congress on Evolutionary Computation 2:1190–1195

    Article  Google Scholar 

  • Smith B.M., Dyer M.E. (1996). Locating the Phase Transitions in Binary Constraint Satisfaction Problems. Artificial Intelligence 18(1–2):155–181

    Article  MathSciNet  Google Scholar 

  • Solnon C. (2002). Ants Can Solve Constraint Satisfaction Problems. IEEE Transactions on Evolutionary Computation 6(4): 347–357

    Article  Google Scholar 

  • Stützle, T. & Hoos, H. (1998). Improvements on the Ant System: Introducing the \(\user1{MAX}-\user1{MIN}\) Ant System. In G. Smith, N. Steele & R. Albrecht (eds.) Proceedings of Artificial Neural Nets and Genetic Algorithms 1997, Springer, 245–249

  • Tsang E. (1993). Foundations of Constraint Satisfaction. Academic Press

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University College Cork, Cork, Ireland

    Finbarr Tarrant & Derek Bridge

Authors
  1. Finbarr Tarrant
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Derek Bridge
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Derek Bridge.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tarrant, F., Bridge, D. When Ants Attack: Ant Algorithms for Constraint Satisfaction Problems. Artif Intell Rev 24, 455–476 (2005). https://doi.org/10.1007/s10462-005-9005-7

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10462-005-9005-7

Keywords

Search

Navigation