Analyzing the behavior of parallel ant colony systems for large instances of the task scheduling problem

Proceedings - 19th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2005

Volumn 2005, Issue , 2005, Pages

  Alba, Enrique ^a   Leguizamón, Guillermo ^b   Ordoñez, Guillermo ^b  

^a UNIVERSITY OF MÁLAGA   (Spain)

^b UNIVERSIDAD NACIONAL DE SAN LUIS   (Argentina)

Author keywords

Ant colony optimization; Minimum tardy task problem; Parallel ant models

Indexed keywords

ANT COLONY OPTIMIZATION; MINIMUM TARDY TASK PROBLEM (MTTP); PARALLEL ANT MODELS;

HEURISTIC METHODS; INFORMATION THEORY; PARALLEL ALGORITHMS; PROBLEM SOLVING; SCHEDULING;

PARALLEL PROCESSING SYSTEMS;

EID: 33746295702     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2005.109     Document Type: Conference Paper

References (24)

1. E. Alba and S. Khuri. Applying evolutionary algorithms to combinatorial optimization problems. volume I, Part 11 of Lecture Notes in Computer Science, pages 689-700. Springer-Verlag, Berlin, Heidelberg, 2001.
2. E. Alba and J. M. Troya. Analyzing synchronous and asynchronous parallel distributed genetic algorithms. Future Generation Computer Systems, 17:451-465, January 2001.
3. J. E. Beasley. OR-Library: Distributing test problems by electronic mail. Journal of the Operational Research Society, 41(11):1069-1072, 1990.
4. M. Bolondi and M. Bondaza. Parallelizzazione di un Algoritmo per la Risoluzione del Problema del Commesso Viaggiatore. Master's thesis, Politecnico di Milano, Dipartamento di Elettronica e Informazione, 1993.
5. B. Bullnheimer, G. Kotsis, and C. Strauß. Parallelization Strategies for the Ant System. Technical Report 8, Unervisty of Viena, October 1997.
6. B. Bullnheimer, G. Kotsis, and C. Strauß. Parallelization Strategies for the Ant System. In R. De Leone, A. Murli, P. Pardalos, and G. Toraldo, editors, High Performance Algorithms and Software in Nonlinear Optimization, volume 24 of Applied Optimization, pages 87-100. Kluwer, 1998.
7. F. Glover D. Corne, M. Dorigo. New Ideas in Optimization. McGrawHill, 1999.
8. M. Dorigo and T. Stützle. Handbook of Metaheuristics, volume 57 of International Series In Operations Research and Management Science, chapter 9.-The Ant Colony Optimization Metaheuristic: Algorithms, Applications, and Advances, pages 251-285. Kluwer Academic Publisher, 2003.
9. G. Ordoñez E. Alba, G. Leguizamón. Evolutionary algorithms for the minimum tardy task problem. In Proceedings of the International Conference on Computer Science, Software Engineering, Information Technology, e-Business, and Applications, pages 401-413, Rio de Janeiro, Brasil, 2003.
10. G. Ordoñez E. Alba, G. Leguizamón. Parallel ant algorithms for the minimum tardy task problem. In Proceedings del X Congreso Argentino de Ciencias de la Computaci'on (CACiC04), San Justo, Buenos Aires, Argentina, 2004.
11. M. Schütz G. Leguizamón, Z. Michalewicz. An ant system for the maximum independent set problem. In Proceedings of the 2001 Argentinian Congress on Computer Science, pages 1027-1040, El Calafate, Argentina, 2001.
12. Z. Michalewicz G. Leguizamón. New version of ant system for subset problems. In Proceedings of the 1999 Congress on Evolutionary Computation, pages 1459-1464, Piscataway, NJ., 1999. IEEE Press.
13. L. M. Gambardella, É. D. 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, editors, New Ideas in Optimization, pages 63-76. McGraw-Hill, 1999.
14. T. Stützte M. Dorigo. The ant colony optimization metaheuristic: Algorithms, applications, and advances. Technical Report IRIDIA/2000-32, IRIDIA Universite Libre de Bruxells, Belgium, 2000.
15. D. S. Johnson M. R. Garey. W. H. Freeman and Co., San Francisco, CA, 1979.
16. N. Meuleau M. Zlochin, M. Birattari and M. Dorigo. Model-based search for combinatorial optimization. Technical report, TR/IRIDIA/2001-15, 2001.
17. R. Michel and M. Middendorf. An Island Model Based Ant System with Lookahead for the Shortest Supersequence Problem. In A. E. Eiben, T. Back, M. Schoenauer, and H.-P. Schwefel, editors, Fifth International Conference on Parallel Problem Solving from Nature (PPSN-V), volume 1498 of Lecture Notes in Computer Science, pages 692-701. Springer-Verlag, 1998.
18. M. Middendorf, F. Reischle, and H. Schmeck. Information Exchange in Multi Colony Ant Algorithms. In J. Rolim et al., editor, Fifteenth IPDPS Workshops, volume 1800 of Lecture Notes in Computer Science, pages 645-652. Springer-Verlag, 2000.
19. M. Middendorf, F. Reischle, and H. Schmeck. Multi Colony Ant Algorithms. Journal of Heuristic, 8:305-320, 2002.
20. M. Randall and A. Lewis. A parallel implementation of ant colony optimization. Jounal of Parallel and Distributed Computing, 62:1421-1432, 2002.
21. T. Bäck S. Khuri and J. Heitkötter. An evolutionary approach to combinatorial optimization problems. In Proceedings of the 22nd Annual ACM Computer Science Conference, pages 66-73. ACM Press, NY., 1994.
22. D.R. Stinson. An Introduction to the Design and Analysis of Algorithms. The Charles Babbage Research Center, Winnipeg, Manitoba, Canada, 2nd edition edition, 1987.
23. T. Stützle. Parallelization Strategies for Ant Colony Optimization. In R. De Leone, A. Murli, P. Pardalos, and G. Toraldo, editors, High Performance Algorithms and Software in Nonlinear Optimization, volume 24 of Applied Optimization, pages 87-100. Kluwer, 1998.
24. E.-G. Talbi, O. Roux, C. Fonlupt, and D. Robillard. Parallel Ant Colonies for Combinatorial Optimization Problems. In Feitelson & Rudolph (Eds.), Job Scheduling Strategies for Parallel Processing: IPPS '95 Workshop, Springer LNCS 949, volume 11. 1999.