A New Parallel Ant Colony Optimization Algorithm Based On Message Passing Interface

Proceedings - 2008 Pacific-Asia Workshop on Computational Intelligence and Industrial Application, PACIIA 2008

Volumn 2, Issue , 2008, Pages 178-182

  Xiong, Jie ^a   Liu, Cai Yun ^c   Chen, Zhong ^b  

^a College of Electronics and Information ^*

^b YANGTZE UNIVERSITY   (China)

^c NONE

Author keywords

[No Author keywords available]

Indexed keywords

ACO ALGORITHMS; ANT COLONIES; ANT-COLONY OPTIMIZATIONS; COMBINATORIAL OP-TIMIZATION PROBLEMS; COMPUTATIONAL NODES; COMPUTATIONAL TIME; CONVERGENCE SPEED; INFORMATION EXCHANGES; MESSAGE PASSING INTERFACES; META-HEURISTIC; NUMERICAL RESULTS; PARALLEL ANT COLONY OPTIMIZATIONS; PARALLEL COMPUTERS; PARALLEL IMPLEMENTATIONS; PROBLEM SIZES; QUALITY OF SOLUTIONS; TRAVELING SALESMAN;

ARTIFICIAL INTELLIGENCE; COMBINATORIAL OPTIMIZATION; COMPUTATIONAL COMPLEXITY; CONVERGENCE OF NUMERICAL METHODS; INDUSTRIAL APPLICATIONS; INTELLIGENT CONTROL; MESSAGE PASSING; PARALLEL PROCESSING SYSTEMS; SCALABILITY; SEQUENTIAL SWITCHING; TRAVELING SALESMAN PROBLEM;

PARALLEL ALGORITHMS;

EID: 63149172206     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/PACIIA.2008.248     Document Type: Conference Paper

References (19)

1. Blum, C. and A. Roli, Metaheuristics in combinatorial optimization: Overview and conceptual comparison. ACM Computing Surveys (CSUR), 2003. 35(3): p. 268-308.
2. Dorigo, M. and L.M. Gambardella, Ant colonies for the travelling salesman problem. BioSystems, 1997. 43(2): p. 73-81.
3. Gambardella, L.M., E.D. Taillard, and M. Dorigo, Ant colonies for the quadratic assignment problem. Journal of the Operational Research Society, 1999. 50(2): p. 167-176.
4. Korosec, P., J. ilc, and B. Robi, Solving the meshpartitioning problem with an ant-colony algorithm. Parallel Computing, 2004. 30(5-6): p. 785-801.
5. Shmygelska, A. and H.H. Hoos, An Improved Ant Colony Optimisation Algorithm for the 2D HP Protein Folding Problem. Proceedings of the 16th Canadian Conference on Artificial Intelligence, 2003: p. 400-417.
6. Holden, N. and A.A. Freitas, Web page classification with an ant colony algorithm. Parallel Problem Solving from Nature-PPSN VIII, LNCS, 2004. 3242: p. 1092-1102.
7. Bullnheimer, B., G. Kotsis, and C. Strauss, Parallelization strategies for the Ant System. 1998: Vienna University of Economics and Business Administration.
8. Talbi, E.G., et al., Parallel Ant Colonies for the quadratic assignment problem. Future Generation Computer Systems, 2001. 17(4): p. 441-449.
9. Piriyakumar, D.A.L. and P. Levi, A new approach to exploiting parallelism in ant colony optimization. 2002. p. 237-243.
10. Randall, M. and A. Lewis, A Parallel Implementation of Ant Colony Optimization. Journal of Parallel and Distributed Computing, 2004. 62: p. 1421-1432.
11. Blum, C., A. Roli, and M. Dorigo, HC-ACO: The hypercube framework for Ant Colony Optimization. InProceedingsofMIC'2001-Meta-heuristicsInternational Conference, volume2, pages399- 403, Porto, Portugal, 2001. AlsoavailableastechnicalreportTR. 2004, IRIDIA/2001-16, IRIDIA, Universite Libre de Bruxelles, Brussels, Belgium.
12. Merkle, D. and M. Middendorf, Fast Ant Colony Optimization on Runtime Reconfigurable Processor Arrays. Genetic Programming and Evolvable Machines, 2002. 3(4): p. 345-361.
13. Stutzle, T. and H. Hoos, MAX-MIN Ant System and local search for the traveling salesmanproblem. 1997. p. 309-314.
14. TSPACO, www.aco-metaheuristic.org/aco-code.
15. Manfrin, M., et al., Parallel Ant Colony Optimization for the Traveling Salesman Problem, in ANTS 2006. 2006, Springer. p. 224-234.
16. Middendorf, M., F. Reischle, and H. Schmeck, Multi Colony Ant Algorithms. 2002, Springer. p. 305-320.
17. TSPLIB, www.iwr.uniheidelberg.de/groups/comopt/software/TSPLIB95/.
18. Dorigo, M. and T. Stützle, Ant Colony Optimization. 2004: Mit Press.
19. Barr, R.S. and B. Hickman, Reporting computational experiments with parallel algorithms: Issues, measures, and experts' opinions. ORSA Journal on Computing, 1993. 5(1): p. 2-18.