Metaheuristics and Parallelism

Parallel Metaheuristics: A New Class of Algorithms

Volumn , Issue , 2005, Pages 79-103

  Alba, E ^a,b   Talbi, E G ^c,d   Luque, G ^a,b   Melab, N ^c,d  

^a UNIVERSITY OF MÁLAGA   (Spain)

^b Campus de Teatinos   (Spain)

^c UNIV LILLE   (France)

^d ECOLE CENTRALE DE LILLE   (France)

Author keywords

Evolutionary algorithms; Exploitation oriented methods; Local search metaheuristics; Parallel tabu search; Simulated annealing

Indexed keywords

EID: 84889447347     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1002/0471739383.ch4     Document Type: Chapter

References (95)

1. P. Adamidis and V. Petridis. Co-operating Populations with Different Evolution Behaviors. In Proc. of the Third IEEE Con$ on Evolutionary Computation, pages 188-191, New York, 1996. IEEE Press.
2. C.W. Ahn, D.E. Goldberg, and R.S. Ramakrishna. Multiple-deme parallel estimation of distribution algorithms: Basic framework and application. Technical Report 20030 16, University of Illinois, 2003.
3. R.M. Aiex, S. Binato, and M.G.C. Resende. Parallel grasp with path-relinking for job shop scheduling. Parallel Computing, 29:293-430,2003.
4. R.M. Aiex, S.L. Martins, C.C. Ribeiro, and N.R. Rodriguez. Cooperative multithread parallel tabu search with an application to circuit partitioning. LNCS 1457, pages 310-331,1998.
5. R.M. Aiex and M.G.C. Resende. A methodology for the analysis of parallel grasp strategies. AT&TLabs Research TR, Apr. 2003.
6. R.M. Aiex, M.G.C. Resende, P.M. Pardalos, and G. Toraldo. Grasp with path relinking for the tree-index assignment problem. TR, AT&T Labs Research, Florham Park, NJ 07932, USA, 2000.
7. E. Alba, F. Luna, A.J. Nebro, and J.M. Troya. Parallel heterogeneous GAS for continuous optimization. Parallel Computing, 30:699-719, 2004.
8. E. Alba, A.J. Nebro, and J.M. Troya. Heterogeneous Computing and Parallel Genetic Algorithms. J of Parallel and Distributed Computing, 62: 1362-1385, 2002.
9. E. Alba and the MALLBA Group. MALLBA: A library of skeletons for combinatorial optimization. LNCS 2400, pages 927-932,2002.
10. E. Alba and M. Tomassini. Parallelism and Evolutionary Algorithms. IEEE Transactions on Evolutionary Computation, 6(5):443-462,2002.
11. D. Andre and J.R. Koza. Parallel genetic programming: a scalable implementation using the transputer network architecture. In Advances in genetic programming: volume 2, pages 317-337. MIT Press, 1996.
12. D. Andre and J.R. Koza. A parallel implementation of genetic programming that achieves super-linear performance. In H.R. Arabnia, editor, Proceedings of the International ConJ on ParaNel and Distributed Processing Techniques and Applications, volume 111, pages 1163-1174, 1996.
13. T. Back, D.B. Fogel, and Z. Michalewicz, editors. Handbook of Evolutionary Computation. Oxford University Press, 1997.
14. M.J. Blesa, L1. Hernandez, and F. Xhafa. Parallel Skeletons for Tabu Search Method. In the Sth Intl. Con$ on Parallel and Distributed Systems, Korea, IEEE Computer Society Press, pages 23-28,2001.
15. 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.
16. B. Bullnheimer, G. Kotsis, and C. Straufl. Parallelization Strategies for the Ant System. Technical Report 8, University of Viena, October 1997.
17. S. Cahon, N. Melab, and E.-G. Talbi. ParadisEO: A Framework for the Reusable Design of Parallel and Distributed Metaheuristics. Journal of Heuristics, 10(3):357-380, May 2004.
18. S. Cahon, N. Melab, and E-G. Talbi. ParadisEO on Condor-MW for optimization on computational grids. http://ww.l if.fr/-cahon/cmw/index. html, 2004.
19. J.A. Chandy and P. Banerjee. Parallel Simulated Annealing Strategies for VLSI Cell Placement. Proc. of the I996 Intl. Con$ on VLSI Design, Bangalore, India, page 37, Jan. 1996.
20. M. Conti, S. Orcioni, and C. Turchetti. Parametric Yield Optimisation of MOS VLSI Circuits Based on SA and its Parallel Implementation. IEEE Proc.-Circuits Devices Syst., 141(5):387-398, 1994.
21. T.G. Crainic and M. Gendreau. Cooperative Parallel Tabu Search for Capacitated Network Design. Journal of Heuristics, 8:601-627,2002.
22. T.G. Crainic, M. Gendreau, P. Hansen, and N. Mladenovic. Cooperative Parallel Variable Neighborhood Search for the p-Median. Journal of Heuristics, 10(3), 2004.
23. T.G. Crainic and M. Toulouse. Parallel Strategies for Meta-heuristics. In F. Glover and G. Cochenberger, eds., Handbook of Metaheuristics, Kluwer Academic Publishers, Norwell, MA, pages 475-514, 2003.
24. I. de Falco, R. del Balio, and E. Tarantino. Testing parallel evolution strategies on the quadratic assignment problem. In Proc. IEEE Int. Con(in Systems, Man and Cybernetics, volume 5, pages 254-259, 1993.
25. K.F. Doerner, R.F. Hartl, G. Kiechle, M. Lucka, and M. Reimann. Parallel Ant Systems for the Capacited VRP. In J. Gottlieb and G.R. Raidl, editors, EvoCOP'04, pages 72-83. Springer-Verlag, 2004.
26. M. Dorigo. Optimization, Learning and Natural Algorithms. PhD thesis, Dipartamento di Elettronica, Politecnico di Milano, 1992.
27. D.C. Dracopoulos and S. Kent. Bulk synchronous parallelisation of genetic programming. Technical report, Brunel University, 1996.
28. A. Oram (Ed.). Peer-to-Peer: Harnessing the Power ofDisruptive Technologies. O'Reilly & Associates, 2001.
29. M.G.Arenas, P. Collet, A.E. Eiben, M. Jelasity, J. J. Merelo, B. Paechter, M. Preuss, M. Schoenauer A framework for distributed evolutionary algorithms. Proceedings ofPPSN VII, Granada, Spain, LNCS 2439, pages 665-675,2002.
30. T.A. Feo and M.G.C. Resende. Greedy randomized adaptive search procedures. Journal of Global Optimization, 6: 109-133, 1999.
31. F. Fernandez, M. Tomassini, W.F. Punch, 111, and J.M. Shchez-Perez. Experimental study of multipopulation parallel genetic programming. In Proc. of the European Conf: on GP, pages 283-293. Springer, 2000.
32. C.N. Fiechter. A parallel tabu search algorithm for large traveling salesman problems. Discrete Applied Mathematics, 5 1:243-267. 1994.
33. G. Folino, C. Pizzuti, and G. Spezzano. CAGE: A tool for parallel genetic programming applications. In J.F. Miller et al., editor, Proceedings ofEuroGP'2001, LNCS 2038, pages 64-73, Italy, 2001. Springer-Verlag.
34. I. Foster and C. Kesselman (eds.). The Grid: Blueprint for a Nav Computing Infrastructure. Morgan Kaufmann, San Fransisco, 1999.
35. L.M. Gambardella, E.D. Taillard, and G. Agazzi. MACS-VRPTW: A Multiple Ant Colony System for Vehicle Routing Problems with Time Windows. In D. Corne, M. Dorigo, and F. Glover, editors, New Ideas in Optimization, pages 63-76. McGraw-Hill, 1999.
36. F. Garcia-Lopez, B. Melian-Batista, J. Moreno-Perez, and J.M. Moreno-Vega. Parallelization of the Scatter Search. Parallel Computing, 29:575-589, 2003.
37. F. Garcia-Lopez, B. Melib-Batista, J.A. Moreno-Perez, and J.M. Moreno-Vega. The Parallel Variable Neighborhood Search for the p-Median Problems. Journal ofHeuristics, 8(3):375-388, 2002.
38. F. Garcia-Lopez, M. Garcia Torres, B. Melian-Batista, J. Moreno-Perez, and J.M. Moreno-Vega. Solving Feature Subset Selection Problem by a Parallel Scatter Search. European Journal of Operational Research, 2006. To appear.
39. F. Glover. Tabu Search, part I. ORSA, Journal of Computing, 1:190-206, 1989.
40. E.D. Goodman. An Introduction to GALOPPS v3.2. Technical Report 96-07-01, GARAGE, I.S. Lab. Dpt. of C. S. and C.C.C.A.E.M., Michigan State Univ., East Lansing, MI, 1996.
41. M. Gorges-Schleuter, ASPARAGOS an asynchronous parallel genetic optimization strategy. In Proceedings of the Third International Conference on Genetic Algorithms, pages 422427. Morgan Kaufinann, 1989.
42. M. Gorges-Schleuter. An Analysis of Local Selection in Evolution Strategies. In W. Banzhaf, J. Daida, A. E. Eiben, M. H. Garzon, V. Honavar, M. Jakiela, and R. E. Smith, editors, Proc. of the Genetic and Evolutionary Computation Conference, volume 1, pages 847-854, 1999.
43. A.M. Haldar, A. Nayak, A. Choudhary, and P. Banerjee. Parallel Algorithms for FPGA Placement. Proc. of the Great Lakes Symposium on VLSI (GVLSI ZOOO), Chicago, IL, 2000.
44. F. Herrera and M. Lozano. Gradual distributed real-coded genetic algorithm. IEEE Transaction in Evolutionary Computation, 4:43-63,2000.
45. T. Hiroyasu, M. Miki, and M. Negami. Distributed Genetic Algorithms with Randomized Migration Rate. In Proc. of the IEEE Con$ of Systems, Man and Cybernetics, volume 1, pages 689-694. IEEE Press, 1999.
46. D. Janaki Ram, T.H. Sreenivas, and K.G. Subramaniam. Parallel Simulated Annealing Algorithms. Journal of Parallel and Distributed Computing, 37:207-212,1996.
47. N. Jozefowiez, F. Semet, and E.-G. Talbi. Parallel and Hybrid Models for Multi-Objective Optimization: Application to the VRP. In Parallel Problem Solving from Nature VII, pages 271-280,2002.
48. H. Juille and J.B. Pollack. Massively parallel genetic programming. In Peter J. Angeline and K. E. Kinnear, Jr., editors, Advances in Genetic Programming 2, pages 339-358. MIT Press, Cambridge, MA, USA, 1996.
49. S. Kirkpatrick, C.D. Gelatt, and M.P. Vecchi. Optimization by Simulated Annealing. Science, 220(4598): 671-680, 1983.
50. S.A. Kravitz and R.A. Rutenbar. Placement by simulated annealing on a multiprocessor. IEEE Trans. in Computer Aided Design, 6:534-549, 1987.
51. A. Le Bouthillier and T.G. Crainic. Co-Operative Parallel Method for Vehicle Computers & Routing Problems with Time Windows. Operation Research, 32(7): 1685-1708,2005.
52. S.Y. Lee and K.G. Lee. Synchronous and asynchronous parallel simulated annealing with multiple markov chains. IEEE Transactions on Parallel and Distributed Systems, 7:993-1008, 1996.
53. Y. Li, P.M. Pardalos, and M.G.C. Resende. A greedy randomized adaptive search procedure for qap. DIMACS Series in Discrete Mathematics and Theoritical Computer Science, 16:237-261, 1994.
54. S.-L. Lin, W.F. Punch, and E.D. Goodman. Coarse-Grain Parallel Genetic Algorithms: Categorization and New Approach. In Shth IEEE Symp. on Parallel and Distributed Processing, pages 28-37, 1994.
55. F.G. Lobo, C.F. Lima, and H. Martires. An architecture for massively parallelization of the compact genetic algorithm. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2004), LNCS 3 103, pages 412-413. Springer-Verlag, 2004.
56. J.A. Lozano, R. Sagama, and P. Larraiiaga. Parallel Estimation of Distribution Algorithms. In P. Larraiiaga and J. A. Lozano, editors, Estimation ofDistribution Algorithms. A New Tool for Evolutionary computation. Kluwer Academis Publishers, pages 129-145,2001.
57. S.L. Martins, C.C. Ribeiro, and M.C. Souza. A parallel grasp for the steiner problem in graphs. LNCS 1457, pages 285-297, 1998.
58. M. Mejia-Olvera and E. Canhi-Paz. DGENESIS-software for the execution of distributed genetic algorithms. In Proceedings XX conf Latinoamericana de Informatica, pages 935-946, 1994.
59. R. Mendes, J.R. Pereira, and J. Neves. A Parallel Architecture for Solving Constraint Satisfaction Problems. In Proceedings of Metaheuristics Int. Conf: 2001, volume 2, pages 109-114, Porto, Portugal, 2001.
60. A. Mendiburu, J.A. Lozano, and J. Miguel-Alonso. Parallel estimation of distribution algorithms: New approaches. Technical Report EHU-KAT-IK-1-3, Department of Computer Architecture and Technology, The University of the Basque Country, 2003.
61. A. Mendiburu, J. Miguel-Alonso, and J.A. Lozano. Implementation and performance evaluation of a parallelization of estimation of bayesian networks algorithms. Technical Report EHU-KAT-IK-XX-04, Computer Architecture and Technology, 2004. Submitted to Parallel Computing.
62. R. Michel and M. Middendorf. An Island Model Based Ant System with Lookahead for the Shortest Supersequence Problem. In A.E. Eiben et al., editor, Fifth Int. ConJ on Parallel Problem Solving.from Nature, LNCS 1498, pages 692-701. Springer-Verlag, 1998.
63. M. Middendorf, F. Reischle, and H. Schmeck. Multi Colony Ant Algorithms. Journal ofHeuristic, 8:305-320,2002.
64. M. Miki, T. Hiroyasu, and M. Kasai. Application of the temperature parallel simulated annealing to continuous optimization problems. IPSL Transaction, 41: 1607-16 16,2000.
65. N. Mladenovic and P. Hansen. Variable neighborhood search. Computers and Opereration Research, 24: 1097-1 100, 1997.
66. H. Miihlenbein, T. Mahnig, and A. Ochoa. Schemata, distributions and graphical models in evolutionary optimization. Journal ofHeuristics, 5(2):215-247, 1999.
67. A.J. Nebro, E. Alba, and F. Luna. Multi-Objective Optimization Using Grid Computing. Soft Computing Journal, 2005. To appear.
68. J. Ocenhsek and J. Schwarz. The parallel bayesian optimization algorithm. In European Symp. on Comp. Inteligence, pages 61-67,2000.
69. J. Ocenasek and J. Schwarz. The distributed bayesian optimization algorithm for combinatorial optimization. In Evolutionary Methods for Design, Optimisation and Control, pages 115-120,2001.
70. P. Pardalos, L. Pitsoulis,, and M.G. Resende. A parallel grasp implementation for the quadratic assignment problem. Parallel algorithms for irregular problems: State of the art, A. Ferreira andJ. Rolim eds., Kluwer, pages 115-133, 1995.
71. K.E. Parsopoulos, D.K. Tasoulis, N.G. Pavlidis, V.P. Plagianakos, and M.N. Vrahatis. Vector Evaluated Differential Evolution for Multiobjective Optimization. In Proceedings of the IEEE Congress on Evolutionary Computation, pages 204-211,2004.
72. S.C. Porto and C.C. Ribeiro. Parallel tabu search message-passing synchronous strategies for task scheduling under precedence constraints. Journal of Heuristics, 1:207-223, 1995.
73. W. Punch. How effective are multiple poplulations in genetic programming. In J.R. Koza et al., editor, Genetic Programming 1998: Proc. of the Third Annual Conference, pages 308-313. Morgan Kaufmann, 1998.
74. M. Rahoual, R. Hadji, and V. Bachelet. Parallel Ant System for the Set Covering Problem. In M. Dorigo et al., editor, 3rd Intl. Workshop on Ant Algorithms, LNCS 2463, pages 262-267. Springer-Verlag, 2002.
75. M. Randall and A. Lewis. A Parallel Implementation of Ant Colony Optimization. Journal of Parallel and Distributed Computing, 62(9):1421-1432,2002.
76. G. Robbins. EnGENEer-The evolution of solutions. In Proc. of theJifth Annual Seminar Neural Networks and Genetic Algorithms, 1992.
77. P. Roussel-Ragot and G. Dreyfus. A problem-independent parallel implementation of simulated annealing: Models and experiments. ZEEE Transactions on Computer-Aided Design, 9:827-835, 1990.
78. J. Rowe, K. Vinsen, and N. Marvin. Parallel GAS for Multiobjective Functions. In Proc. of the 2nd Nordic Workshop on Genetic Algorithms and Their Applications (2NWGA), pages 61-70, 1996.
79. G. Rudoplh. Global optimization by means of distributed evolution strategies. In H.P. Schwefel and R. Miinner, editors, Parallel Problem Solving from Nature, volume 496, pages 209-213, 1991.
80. V. Schnecke and O. Vornberger. Hybrid Genetic Algorithms for Constrained Placement Problems. IEEE Transactions on Evolutionary Computation, 1(4):266-277, 1997.
81. M. Schutz and J. Sprave. Application of Parallel Mixed-Integer Evolution Strategies with Mutation Rate Pooling. In L.J. Fogel, P.J. Angeline, and T. Back, editors, Proc. Fifth Annual Con$ Evolutionary Programming (EP '96), pages 345-354. The MIT Press. 1996.
82. J. Stender, editor. Parallel Genetic Algorithms: Theory and Applications. 10s Press, Amsterdam, The Netherlands, 1993.
83. J. Sprave. Linear Neighborhood Evolution Strategies. In A.V. Sebald and L.J. Fogel, editors, Proc. Third Annual Con$ Evolutionary Programming (EP'94), pages 42-51. World Scientific, Singapore, 1994.
84. N. Srinivas and K. Deb. Multiobjective Optimization Using Nondominated Sorting in Genetic Algorithms. Evolutionary Computation, 2(3):221-248, 1995.
85. T.J. Stanley and T. Mudge. A Parallel Genetic Algorithm for Multiobjetive Microprocessor Design. In Proc. of the Sixth Int. Con$ on Genetic Algorithms, pages 597-604, 1995.
86. R. Szmit and A. Barak. Evolution strategies for a parallel multi-objective genetic algorithm. In D. Whitley et al., editor, GECCO'OO, pages 227-234. Morgan Kaufmann, 2000.
87. T. Stiitzle. 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 Oprimization, volume 24 of Applied Optimization, pages 87-100. Kluwer, 1998.
88. 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.
89. E.G. Talbi, Z. Hafidi, and J.M. Geib. A parallel adaptive tabu search approach. Parallel Computing, 24:2003-2019, 1996.
90. R. Tanese. Distributed genetic algorithms. In J. D. Schaffer, editor, Proceedings of the Third International Conference on Genetic Algorithms, pages 434439. Morgan Kaufmann, 1989.
91. S. Tongchim and P. Chongstitvatana. Parallel Genetic Algorithm with Parameter Adaptation. Information Processing Letters, 82(1):47-54,2002.
92. R. Venkateswaran, Z. Obradović, and C.S. Raghavendra. Cooperative Genetic Algorithm for Optimization Problems in Distributed Computer Systems. In Proc. of the Second Online Workshop on Evolutionary Computation, pages 49-52,1996.
93. K. Weinert, J. Mehnen, and G. Rudolph. Dynamic neighborhood structures in parallel evolution strategies. Complex Systems, 13(3):227-244, 2002.
94. D. Whtley and T. Starkweather. GENITORII: A distributed genetic algorithm. Journal of Experimental and Theoretical AritiJicial Intelligence, 2: 189-214, 1990.
95. Y. Davidor. A naturally occuring niche and species phenomenon: The model and first results. In R.K. Belew and L.B. Booker, editors, Proc. ofthe Fourth Intl. Con$ Genetic Algorithms, pages 257-263, 1991.