Skip to main content

The Convergence Control to the ACO Metaheuristic Using Annotated Paraconsistent Logic

  • Conference paper

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

Abstract

An approach to solve complex combinatorial optimizations problems is the Ant Colony Optimization Metaheuristic (ACO). There are several variations of this metaheuristic. One of them, the Max-Min Ant System, is an algorithm that presents excellent performance for some classes of combinatorial problems, such as Traveling Salesman Problem and the Quadratic Assignment Problem. This paper presents a method of convergence control of the Max-Min variation of Ant Colony Optimization Metaheuristic using paraconsistent logic. The proposed method can be adapted to any variation of the Ant Colony Optimization Metaheuristic.

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

Buying options

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
Softcover Book
USD   109.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Goss, S., Aron, S., Deneubourg, J.L., Pasteels, J.M.: Self-organized Shortcuts in the Argentine Ant. Naturwissenschaften 76, 579–581 (1989)

    Article  Google Scholar 

  2. Dorigo, M., Stützle, T.: The Ant Colony Optimization Metaheuristic: Algorithms, Applications, and Advances. In: Handbook of Metaheuristics (2002)

    Google Scholar 

  3. Dorigo, M., Birattari, M., Stützle, T.: Ant Colony Optimization– Artificial Ants as a Computational Intelligence Technique. In: IEEE Computational Intelligence Magazine (2006)

    Google Scholar 

  4. Dorigo, M., Maniezzo, V., Colorni, A.: Ant System: Optimization by a Colony of Cooperating Agents. In: IEEE Transactions on Systems, Man, and Cybernetics-Part B, vol. 26(1), pp. 29–41 (1996)

    Google Scholar 

  5. Dorigo, M.: Optimization, Learning and Natural Algorithms. Ph.D.Thesis, Politecnico di Milano, Italy, (in Italian) (1992)

    Google Scholar 

  6. Bullnheimer, B., Hartl, R.F., Strauss, C.: A New Rank Based Version of the Ant System: A Computational Study. Central European Journal for Operations Research and Economics 7(1), 25–38 (1999)

    MathSciNet  MATH  Google Scholar 

  7. Stützle, T., Hoos, H.H.: MAX-MIN Ant System. Future Generation Computer Systems 16(8), 889–914 (2000)

    Article  MATH  Google Scholar 

  8. Dorigo, M., Gambardella, L.M.: Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem. IEEE Transactions on Evolutionary Computation 1(1), 53–66 (1997)

    Article  Google Scholar 

  9. Abe, J.M.: Fundamentals of Annotated Logic, Ph. D. thesis, FFLCH/USP, SP, Brazil (1992)

    Google Scholar 

  10. Da Costa, N. C. A., Hensche, L. J. and Subrahmanin, V. S.: Automatic Theorem Proving in Paraconsistent Logics: Theory and Implementation, Estudos Avançados, Coleção Documentos (3) USP, SP, Brazil (1990)

    Google Scholar 

  11. Subrahmanian, V.S.: On the Semantics of Quantitative Logic Programs. In: Proc. 4th IEEE Symposium on Logic Programming. Computer Society Press, Washington (1987)

    Google Scholar 

  12. Da Costa, N.C.A.: The Philosophic Importance of Paraconsistent Logic. Bol. Soc. Paranaense of Mathematic 11(2) (1990)

    Google Scholar 

  13. Da Costa, N.C.A.: On the Theory of Inconsistent Formal Systems. Notre Dame Journal of Formal Logic 11 (1974)

    Google Scholar 

  14. Da Costa, N.C.A., Subrahamanian, V.S., Vago, C.: The Paraconsistent Logic Pt, Zeitschrift fur Mathematische Logik und Grundlagen der Mathematik, vol. 37, pp. 139–148 (1991)

    Google Scholar 

  15. Martins, H.G.: The Four-Valued Annotated Paraconsistent Logic – 4vAPL Applied in a Case-Based Reasoning System for Restoration of Electrical Substations, Ph. D. Thesis, UNIFEI, Brazil (2003)

    Google Scholar 

  16. Martins, H.G., Lambert-Torres, G., Pontin, L.F.: Annotated Paraconsistent Logic, Ed. Communicar (2007) (in Portuguese)

    Google Scholar 

  17. Jünger, M., Reinelt, G., Rinaldi, G.: The Traveling Salesman Problem: a Bibliography. In: Dellamico, M., Maffioli, F., Martello, S. (eds.) Annotated Bibliography in Combinatorial Optimization, pp. 199–221. Willey (1997)

    Google Scholar 

  18. Reinelt, G.: TSPlib: A Traveling Salesman Problem Library. ORSA Journal on Computing 3, 376–384 (1991) (Accessed in 04/30/2009 ), http://www.iwr.uni-heidelberg.de/groups/comopt/software/TSPLIB95/

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

da Silva, L.E., Martins, H.G., Coutinho, M.P., Lambert-Torres, G., da Silva, L.E.B. (2009). The Convergence Control to the ACO Metaheuristic Using Annotated Paraconsistent Logic. In: Cai, Z., Li, Z., Kang, Z., Liu, Y. (eds) Advances in Computation and Intelligence. ISICA 2009. Lecture Notes in Computer Science, vol 5821. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04843-2_41

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-04843-2_41

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-04842-5

  • Online ISBN: 978-3-642-04843-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics