Parallel shared memory strategies for ant-based optimization algorithms

Proceedings of the 11th Annual Genetic and Evolutionary Computation Conference, GECCO-2009

Volumn , Issue , 2009, Pages 1-8

  Bui, Thang N ^a   Nguyen, Thanhvu ^b   Rizzo Jr , Joseph R ^c  

^a PENNSYLVANIA STATE UNIVERSITY   (United States)

^b UNIVERSITY OF NEW MEXICO   (United States)

^c Concurrent Technologies Corporation ^*  (United States)

Author keywords

Ant based algorithms; Distributed memory; Max Clique; MPI; OpenMP; Shared memory

Indexed keywords

DISTRIBUTED MEMORY; MAX CLIQUE; MAXIMUM CLIQUE PROBLEMS; MPI; OPTIMIZATION ALGORITHMS; PARALLEL VERSION; RUNNING TIME; SHARED MEMORIES; SOLUTION QUALITY;

PARALLEL ALGORITHMS;

EID: 72749117394     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1569901.1569903     Document Type: Conference Paper

References (35)

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.
2. th Annual International Symposium on Fault-Tolerant Computing, Newcastle, UK, 1990, pp. 340-346.
3. E. Bonabeau, M. Dorigo, and G. Theraulaz, "Inspiration for Optimization from Social Insect Behavior," Nature, Vol. 406, July 6, 2000, pp. 39-42.
4. T. Bui and J. Rizzo, "Finding Maximum Cliques with Distributed Ants," Proc. of the Genetic and Evolutionary Computation Conf., 2004, pp. 24-35.
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.
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.
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.
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.
9. P. Delisle, M. Krajecki, M. Gravel, and C. Gagné, "Parallel Implementation of An Ant colony Optimization Metaheuristic With OpenMP," Proc. of the 3rd European Workshop on OpenMP (EWOMP' 01), Barcelona, Spain, 2001.
10. M. Dorigo, "Optimization, Learning and Natural Algorithms," Ph.D. Thesis, Politecnico di Milano, Italy, [in Italian], 1992.
11. M. Dorigo and G. Di Caro, "The Ant Colony Optimization Meta-Heuristic," New Ideas in Optimization, McGraw-Hill, 1999, pp. 11-32.
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.
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.
14. I. Ellabib, P. Calamai, and O. Basir, "Exchange Strategies for Multiple Ant Colony System," Information Sciences, 177(5), March 2007, pp. 1248-1264.
15. D. Geer, "Chip Makers Turn to Multicore Processors," Computer, Vol. 38, No. 5, May 2005, pp. 11-13.
16. 1-ε," Acta Mathematica, 182, 1999, pp. 105-142.
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.
18. M. Manfrin, M. Birattari, Thomas Stützle, 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.
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.
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.
21. M. Middendorf, F. Reischle, and H. Schmeck, "Multi Colony Ant Algorithms," Journal of Heuristic, 8, 2002, pp. 305-320.
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.
23. nd Edition)," Morgan Kaufmann Publishers, 1998.
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.
25. st International Forum on Next-Generation Multicore/Manycore Technologies, 2008.
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.
27. N. Sloane and F. MacWilliams, "The Theory of Correcting Codes," North Holland, Amsterdam, 1979.
28. T. Stützle, "Parallelization Strategies for Ant Colony Optimization," Proc. of Parallel Problem Solving from Nature, Lecture Notes in Computer Science, 1498, Springer, 1998, pp. 722-741.
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.
30. The Beowulf Project. http://www.beowulf.org. Last accessed March 2009.
31. MPI - The Message Passing Interface Standard. http://www-unix.mcs.anl. gov/mpi/. Last accessed March 2009.
32. OpenMP Architecture Review Board. http://www.openmp.org/specs/. Last accessed March 2009.
33. Clique Benchmark Instances. http://www.cs.hbg.psu.edu/benchmarks/. Last accessed March 2009.
34. BHOSLIB: Benchmarks with Hidden Optimum Solutions for Graph Problems. http://www.nlsde.buaa.edu.cn/ kexu/benchmarks/graphbenchmarks. htm. Last accessed March 2009.
35. Supplemental results. http://www.cs.unm.edu/~tnguyen/Files/Papers/mcsup. pdf. Last accessed March 2009.