The Convergence Control to the ACO Metaheuristic Using Annotated Paraconsistent Logic

  • Luiz Eduardo da Silva
  • Helga Gonzaga Martins
  • Maurilio Pereira Coutinho
  • Germano Lambert-Torres
  • Luiz Eduardo Borges da Silva
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, 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.

Keywords

artificial intelligence ant colony hybrid system paraconsistent logic 
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Goss, S., Aron, S., Deneubourg, J.L., Pasteels, J.M.: Self-organized Shortcuts in the Argentine Ant. Naturwissenschaften 76, 579–581 (1989)CrossRefGoogle Scholar
  2. 2.
    Dorigo, M., Stützle, T.: The Ant Colony Optimization Metaheuristic: Algorithms, Applications, and Advances. In: Handbook of Metaheuristics (2002)Google Scholar
  3. 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. 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. 5.
    Dorigo, M.: Optimization, Learning and Natural Algorithms. Ph.D.Thesis, Politecnico di Milano, Italy, (in Italian) (1992)Google Scholar
  6. 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)MathSciNetMATHGoogle Scholar
  7. 7.
    Stützle, T., Hoos, H.H.: MAX-MIN Ant System. Future Generation Computer Systems 16(8), 889–914 (2000)CrossRefMATHGoogle Scholar
  8. 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)CrossRefGoogle Scholar
  9. 9.
    Abe, J.M.: Fundamentals of Annotated Logic, Ph. D. thesis, FFLCH/USP, SP, Brazil (1992)Google Scholar
  10. 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. 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. 12.
    Da Costa, N.C.A.: The Philosophic Importance of Paraconsistent Logic. Bol. Soc. Paranaense of Mathematic 11(2) (1990)Google Scholar
  13. 13.
    Da Costa, N.C.A.: On the Theory of Inconsistent Formal Systems. Notre Dame Journal of Formal Logic 11 (1974)Google Scholar
  14. 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. 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. 16.
    Martins, H.G., Lambert-Torres, G., Pontin, L.F.: Annotated Paraconsistent Logic, Ed. Communicar (2007) (in Portuguese)Google Scholar
  17. 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. 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/ CrossRefMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Luiz Eduardo da Silva
    • 1
  • Helga Gonzaga Martins
    • 2
  • Maurilio Pereira Coutinho
    • 1
  • Germano Lambert-Torres
    • 2
  • Luiz Eduardo Borges da Silva
    • 2
  1. 1.Alfenas Federal UniversityBrasil
  2. 2.Itajuba Federal UniversityItajubáBrasil

Personalised recommendations