Parallel Ant Colony Algorithms

Parallel Metaheuristics: A New Class of Algorithms

Volumn , Issue , 2005, Pages 171-201

  Janson, Stefan ^a   Merkle, Daniel ^a   Middendorf, Martin ^a  

^a UNIVERSITY OF LEIPZIG   (Germany)

Author keywords

Ant colony optimization metaheuristic; Combinatorial optimization problems; Hardware parallelization; Information exchange; Topology

Indexed keywords

EID: 84889434260     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1002/0471739383.ch8     Document Type: Chapter

References (48)

1. P. Albuquerque, and A. Dupuis: A Parallel Cellular Ant Colony Algorithm for Clustering and Sorting. Proc. of ACRI 2002, LNCS 2493, Springer, 220-230 (2002).
2. M. Bolondi, and M. Bondaza: Parallelizzazione di un algoritmo per la risoluzione del problema del comesso viaggiatore; Master's thesis, Politecnico di Milano, (1993).
3. E. Bonabeau, M. Dorigo, and G. Theraulaz: Swarm Intelligence: From Natural to Artificial Systems. Oxford University Press (1999).
4. B. Bullnheimer, G. Kotsis, and C. Strauss: Parallelization Strategies for the Ant System; in: R. De Leone et al. (Eds.), High Performance Algorithms and Sofmare in Nonlinear Optimization; series: Applied Optimization, Vol. 24, Kluwer, 87-100 (1998).
5. S.-C. Chu, J.F. Roddick, and J.-S. Pan: Ant colony system with communication strategies. Information Sciences 167( 1-4):63-76, (2004).
6. Cordon, O., F. Herrera, and T. Stiitzle. A Review on the Ant Colony Optimization Metaheuristic: Basis, Models and New Trends. Mathware and Sofi Computing, 9(2-3): 141-175, (2002).
7. P. Delisle, M. Krajeclu, M. Gravel, and C. Gagne: Parallel implementation of an ant colony optimization metaheuristic with OpenMP. International Conference on Parallel Architectures and Compilation Techniques, Proceedings of the 3rd European Workshop on OpenMP (EWOMP'OI), (2001).
8. J. L. Deneubourg, S. Aron, S. Goss, and J. M. Pasteels: The self-organizing exploratory pattern of the Argentine ant. J. Insect Behav. 32: 159-168 (1990).
9. J. L. Deneubourg, S. Goss, N. Franks, A. Sendova-Franks, C. Detrain, and L. Chretien: The Dynamics of Collective Sorting. From Animals to Animats: International Conference on Simulation of Adaptive Behavior, The MIT Press, 356-363 (1990).
10. G. Di Caro, and M. Dorigo: AntNet: Distributed Stigmergetic Control for Communications Networks. Journal of Artzjicial Intelligence Research (JAIR), 9: 317-365 (1998).
11. M. Dorigo: Optimization, Learning and Natural Algorithms (in Italian). PhD thesis, Dipartimento di Elettronica, Politecnico di Milano, (1992).
12. M. Dorigo: Parallel ant system: An experimental study; unpublished manuscript, (1993).
13. M. Dorigo, V. Maniezzo, and A. Colorni. Positive feedback as a search strategy, Tech. Rep. 91-016, Politecnico di Milano, Italy (1991).
14. M. Dorigo and T. Stiitzle: Ant Colony Optimization. MIT Press, (2004).
15. A. Dupuis and B. Chopard. An object oriented approach to lattice gas modeling. Future Generation Computer Systems, 16(5):523-532 (2000).
16. M.S. Fiorenzo Catalano and F. Malucelli: Parallel randomized heuristics for the set covering problem. International Journal of Practical Parallel Computing, 10(4): 113-132 (2001).
17. L.M. Gambardella, E. Taillard, and G. Agazzi: MACS-VRPTW A Multiple Ant Colony System for Vehicle Routing Problems with Time Windows. In D. Come, M. Dorigo and F. Glover (Eds.) New Ideas in Optimization. McGraw-Hill, 63-76 (1999).
18. S. Goss, S. Aron, J.L. Deneubourg, and J.M. Pasteels. Self-organized shortcuts in the Argentine ant. Natunvissenschaften 76:579-581 (1989).
19. M. Guntsch and M. Middendorf. A population based approach for ACO. In Applications of Evolutionary Computing - Proc. Evo Workshops 2002, Springer
20. M. Guntsch and M. Middendorf: Applying Population Based ACO to Dynamic Optimization Problems. Proceedings of Third International Workshop ANTS 2002, Brussels, Springer, LNCS 2463, 111-122 (2002). LNCS 2279,724 1 (2002).
21. M. Guntsch, M. Middendorf, B. Scheuermann, O. Diessel, H. ElGindy, H. Schmeck, and K. So: Population based Ant Colony Optimization on FPGA. Proceedings 2002 IEEE International Conference on Field-Programmable Technology (FPT'02), IEEE, Hong Kong, 125-132 (2002).
22. M. Gunes, U. Sorges, and I. Bouazizi: AFL4 The Ant-Colony Based Routing Algorithm for MANETs. Proc. International Conference on Parallel Processing Workshops (ICPPWSOZ), 79-85 (2002).
23. J. Hoeflinger, B. Kuhn, P. Petersen, H. Rajic, S. Shah, J. Vetter, M. Voss, and R. Woo: An integrated performance visualizer for OpenMPMPI programs. Proc. Intei-national Workshop on OpenMP Applications and Tools, Springer, LNCS 2104,40-52 (2001).
24. O. Hussein and T. Saadawi: Ant routing algorithm for mobile ad-hoc networks (ARAMA). Proceedings of the 2003 IEEE International on Performance, Computing, and Communications Conference, 281-290 (2003).
25. Hadeli, P. Valckenaers, M. Kollingbaum, and H. Van Brussel: Multi-agent coordination and control using stigmergy. Computers in Industry, 53( 1): 75-96 (2004).
26. H. Kawamura, M. Yamamoto, K. Suzuki, and A. Ohuchi: Multiple ant colonies algorithm based on colony level interactions. IEICE Transactions on Fundamentals, E83-A(2): 371-379 (2000).
27. P. Korosec, J. Silc, and B. Robi: Solving the mesh-partitioning problem with an ant-colony algorithm. Parallel Computing, 30(5-6): 785-801, (2004)
28. F. Kriiger, D. Merkle, and M. Middendorf, : Studies on a Parallel Ant Systemfor the BSP Model; Unpub. manuscript (1998).
29. A.E. Langham and P.W. Grant. Using competing ant colonies to solve k-way partitioning problems with foraging and raiding strategies. In Proc. 5th European Conference on Artificial Life, ECAL'99, Springer, LNCS 1674,621-625 (1999).
30. D. Merkle and M. Middendorf. A New Approach to Solve Permutation Scheduling Problems with Ant Colony Optimization. In: E.J.W. Boers et al. (Eds.) Applications of Evolutionary Computing: Proceedings of EvoWorkshops 200 1, Springer, LNCS 2037,484-493 (2001).
31. D. Merkle and M. Middendorf: Fast Ant Colony Optimization on Runtime Reconfigurable Processor Arrays. Genetic Programming and Ei~olvableM achines, 3(4): 345-361 (2002).
32. D. Merkle and M. Middendorf: Swarm Intelligence. Appears in E. Burke, G. Kendall (Eds.), Introductory Tutorials in Optimisation, Search and Decision Support Methodology, Kluwer (2004).
33. 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, 51-61 (1999).
34. M. Middendorf, F. Reischle, and H. Schmeck: Multicolony Ant Algorithms. Journal oflieuristics, X(3): 305-320 (2002). Preliminary version in: J. Rolim (Ed.) Parallel and Distributed Computing, Proc. of the 15 IPDPS 2000 Workshops, Springer-Verlag, LNCS 1800,645-652 (2000).
35. R. Miller, V.K. Prasanna, D.L Reisis, and Q.F Stout: Parallel Computations on Reconfigurable Meshes. IEEE Transactions on Computers, 42(6): 678-692 (1993).
36. V. Nugala, S.J. Allan, and J.W. Haefner: Parallel implementations of individualbased models in biology: bulletin- and non-bulletin-board approaches. Biosystems, 45(2): 87-97 (1998).
37. D.A.L. Piriyakumar, and P. Levi: A New Approach to Exploiting Parallelism in Ant Colony Optimization. International Symposium on Micromechatronics and Human Science(MHS), 7 pp. (2002).
38. M. Randall and A. Lewis, A parallel implementation of ant colony optimization. Journal ofParallel and Distributed Computing, 62(9): 1421-1432 (2002).
39. B. Scheuennann, M. Guntscki, M. Middendorf, and H. Schmeck: Time-Scattered Heuristic Guidance for a Hardware Implementation of ACO. Proc. Fourth International Workshop ANTS, LNCS 3 172,250-261 (2004).
40. B. Scheuermann, K. So, M. Guntsch, M. Middendorf, 0. Diessel, H. EIGindy, and H. Schmeck: FPGA Implementation of Population-based Ant Colony Optimization. Applied Soft Computing, 4: 303-322 (2004).
41. R. Schoonderwoerd, O.E. Holland, J.L. Bruten, and L.J.M. Rothkrantz: Antbased load balancing in telecommunications networks. Adaptive Behavior, 5(2): 169-207 (1996).
42. R.P. Souto, H.F. de Campos Velho, and S. Stephany (2004): Reconstruction of Chlorophyll Concentration Profile in Offshore Ocean Water using a Parallel Ant Colony Code. In Proc. 16th European Conference on Artificial Intelligence (ECAI-2004), Hybrid Metaheuristics (HM-2004), 19-24 (2004).
43. T. Stiitzle: Parallelization strategies for ant colony optimization. In A. E. Eiben, T. Back, M. Schonauer, H.-P. Schwefel (Eds.), Parallel Problem Solving ,from Nature - PPSN V, Springer-Verlag, LNCS 1498, 722-731 (1998).
44. E-G. Talbi, O. Roux, C. Fonlupt, and D. Robilliard: Parallel ant colonies for the quadratic assignment problem. Future Generation Computer Systems, 17(4):441-449 (2001). Preliminary version in J. Rolim et al. (Eds.) Parallel and Distributed Processing, 11 IPPSBPDP'99 Workshops, LNCS 1586, Springer, 239-247 (1999).
45. C.-F. Tsai, C.-W. Tsai, and C.-C. Tseng: A new and efficient ant-based heuristic method for solving the traveling salesman problem. Wxpert systems, 20: 179-185 (2003).
46. C.-F. Tsai, C.-W. Tsai, and C.-C. Tseng: A new hybrid heuristic approach for solving large traveling salesman problem. Information Sciences, 166( 14):67-81 (2004).
47. R. Vaidyanathan and J. L. Trahan: Dynamic Reconfiguration: Architectures and Algorithms. Kluwer, (2004).
48. http://www.iwr.uni-heidelberg.de/iwr/comopt/soft/TSPLIB/TSPLIB.html