skip to main content
10.1145/1569901.1569903acmconferencesArticle/Chapter ViewAbstractPublication PagesgeccoConference Proceedingsconference-collections
research-article

Parallel shared memory strategies for ant-based optimization algorithms

Published:08 July 2009Publication History

ABSTRACT

This paper describes a general scheme to convert sequential ant-based algorithms into parallel shared memory algorithms. The scheme is applied to an ant-based algorithm for the maximum clique problem. Extensive experimental results indicate that the parallel version provides noticeable improvements to the running time while maintaining comparable solution quality to that of the sequential version.

References

  1. S. Alonso, O. Cordon, I. Fernandez de Viana, F. Herrera, "Integrating Evolutionary Computation Components in Ant Colony Optimization," Recent Developments in Biologically Inspired Computing, L.Nunes de Castro, F.J. Von Zuben (Eds.), Idea Group Publishing, 2004, pp. 48--180.Google ScholarGoogle Scholar
  2. P. Berman and A. Pelc, "Distributed Fault Diagnosis For Multiprocessor Systems," Proc. of the 20th Annual International Symposium on Fault-Tolerant Computing, Newcastle, UK, 1990, pp. 340--346.Google ScholarGoogle Scholar
  3. E. Bonabeau, M. Dorigo, and G. Theraulaz, "Inspiration for Optimization from Social Insect Behavior," Nature, Vol. 406, July 6, 2000, pp. 39--42.Google ScholarGoogle ScholarCross RefCross Ref
  4. T. Bui and J. Rizzo, "Finding Maximum Cliques with Distributed Ants," Proc. of the Genetic and Evolutionary Computation Conf., 2004, pp. 24--35.Google ScholarGoogle Scholar
  5. T. Bui and G. Sundarraj, "Ant System for the k-Cardinality Tree Problem," Proc. of the Genetic and Evolutionary Computation Conf., 2004, pp. 36--47.Google ScholarGoogle Scholar
  6. T. Bui and L. Strite, "An Ant System Algorithm for Graph Bisection," Proc. of the Genetic and Evolutionary Computation Conf., 2002, pp. 43--51. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. T. Bui and C. Zrncic, "An Ant-Based Algorithm for Finding Degree-Constrained Minimum Spanning Tree," Proc. of the Genetic and Evolutionary Computation Conf., 2006, pp. 11--18. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. B. Bullnheimer, G, Kotsis, and C. Strauss, "Parallelization Strategies for the Ant System," High Performance Algorithms and Software in Nonlinear Optimization, Kluwer, Dordrecht, 1998, pp. 87--100.Google ScholarGoogle Scholar
  9. P. Delisle, M. Krajecki, M. Gravel, and C. Gagne, "Parallel Implementation of An Ant colony Optimization Metaheuristic With OpenMP," Proc. of the 3rd European Workshop on OpenMP (EWOMP'01), Barcelona, Spain, 2001.Google ScholarGoogle Scholar
  10. M. Dorigo, "Optimization, Learning and Natural Algorithms," Ph.D. Thesis, Politecnico di Milano, Italy, {in Italian}, 1992.Google ScholarGoogle Scholar
  11. M. Dorigo and G. Di Caro, "The Ant Colony Optimization Meta-Heuristic," New Ideas in Optimization, McGraw-Hill, 1999, pp. 11--32. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. M. Dorigo and L. Gambardella, "Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem," IEEE Trans. on Evol. Computation, 1(1), 1997, pp. 53--66. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. M. Dorigo, L. Gambardella, and E. Taillard, "Ant Colonies for the Quadratic Assignment Problem," Journal of the Operational Research Society, Vol. 50, 1999, pp. 167--176.Google ScholarGoogle ScholarCross RefCross Ref
  14. I. Ellabib, P. Calamai, and O. Basir, "Exchange Strategies for Multiple Ant Colony System," Information Sciences, 177(5), March 2007, pp. 1248--1264. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. D. Geer, "Chip Makers Turn to Multicore Processors," Computer, Vol. 38, No. 5, May 2005, pp. 11--13. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. J. Hastad, "Clique Is Hard to Approximate within n1-ë," Acta Mathematica, 182, 1999, pp. 105--142.Google ScholarGoogle ScholarCross RefCross Ref
  17. J. Lagarias and P. Shor, "Keller's Cube-Tiling Conjecture Is False In High Dimensions," Bulletin of the American Mathematical Society, 27(2), 1992, pp. 279--283.Google ScholarGoogle ScholarCross RefCross Ref
  18. M. Manfrin, M. Birattari, Thomas Stutzle, and M. Dorigo, "Parallel Ant Colony Optimization for the Traveling Salesman Problem," M. Dorigo et al. (Eds.): ANTS 2006, Lecture Notes in Computer Science, 4150, 2006, pp. 224--234. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. V. Maniezzo and A. Carbonaro, "Ant Colony Optimization: An Overview," Essays and Surveys in Metaheuristics, C. Ribeiro editor, Kluwer Academic Publishers, 2001, pp. 21--44.Google ScholarGoogle Scholar
  20. R. Michels and M. Middendorf, "An Ant System for the Shortest Common Supersequence Problem," in D. Corne, M. Dorigo, F. Glover (Eds.), New Ideas in Optimization, McGraw-Hill, 1999, pp. 51--61. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. M. Middendorf, F. Reischle, and H. Schmeck, "Multi Colony Ant Algorithms," Journal of Heuristic, 8, 2002, pp. 305--320. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. J. Parkhurst, J. Darringer, and B. Grundmann, "From Single Core to Multi-Core: Preparing for a New Exponential," Proc. of the 2006 IEEE/ACM International Conference on Computer-Aided Design, 2006, pp. 67--72. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. D. Patterson and J. Hennessy, "Computer Organization and Design (2nd Edition)," Morgan Kaufmann Publishers, 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. M. Randall and A. Lewis, "A Parallel Implementation of Ant Colony Optimization," Journal of Parallel and Distributed Computing, 62(9), 2002, pp. 1421--1432. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. J. E. Savage and M. Zubair, "A Unified Model for Multicore Architectures," Proc. of the 1st International Forum on Next-Generation Multicore/Manycore Technologies, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. N. Sloane, "Unsolved Problems in Graph Theory Arising from the Study of Codes," Graph Theory Notes of New York, XVIII, 1989, pp. 11--20.Google ScholarGoogle Scholar
  27. N. Sloane and F. MacWilliams, "The Theory of Correcting Codes," North Holland, Amsterdam, 1979.Google ScholarGoogle Scholar
  28. T. Stutzle, "Parallelization Strategies for Ant Colony Optimization," Proc. of Parallel Problem Solving from Nature, Lecture Notes in Computer Science, 1498, Springer, 1998, pp. 722--741. Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. E.-G. Talbi, O. Roux, C. Fonlupt, and D. Robillard, "Parallel Ant Colonies for Combinatorial Optimization Problems," Feitelson&Rudolph (Eds.), Job Scheduling Strategies for Parallel Processing: IPPS '95 Workshop, Lecture Notes in Computer Science, 949, Springer, Vol. 11, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  30. The Beowulf Project. http://www.beowulf.org. Last accessed March 2009.Google ScholarGoogle Scholar
  31. MPI - The Message Passing Interface Standard. http://www-unix.mcs.anl.gov/mpi/. Last accessed March 2009.Google ScholarGoogle Scholar
  32. OpenMP Architecture Review Board. http://www.openmp.org/specs/. Last accessed March 2009.Google ScholarGoogle Scholar
  33. Clique Benchmark Instances. http://www.cs.hbg.psu.edu/benchmarks/. Last accessed March 2009.Google ScholarGoogle Scholar
  34. BHOSLIB: Benchmarks with Hidden Optimum Solutions for Graph Problems. http://www.nlsde.buaa.edu.cn/ kexu/benchmarks/graphbenchmarks.htm. Last accessed March 2009.Google ScholarGoogle Scholar
  35. Supplemental results. http://www.cs.unm.edu/~tnguyen/Files/Papers/mcsup.pdf. Last accessed March 2009.Google ScholarGoogle Scholar

Index Terms

  1. Parallel shared memory strategies for ant-based optimization algorithms

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Published in

        cover image ACM Conferences
        GECCO '09: Proceedings of the 11th Annual conference on Genetic and evolutionary computation
        July 2009
        2036 pages
        ISBN:9781605583259
        DOI:10.1145/1569901

        Copyright © 2009 ACM

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 8 July 2009

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • research-article

        Acceptance Rates

        Overall Acceptance Rate1,669of4,410submissions,38%

        Upcoming Conference

        GECCO '24
        Genetic and Evolutionary Computation Conference
        July 14 - 18, 2024
        Melbourne , VIC , Australia

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader