Abstract
In this chapter, a clear difference is made between the parallel design aspect and the parallel implementation aspect of evolutionary algorithms (GlossaryTerm
EA
s). From the algorithmic design point of view, the main parallel models for GlossaryTermEA
s are presented. A unifying view of parallel models for GlossaryTermEA
s is outlined. This chapter is organized as follows. In Sect. 55.2, the main parallel models for designing GlossaryTermEA
s are presented. Section 55.3 deals with the implementation issues of parallel GlossaryTermEA
s. In this section, the main concepts of parallel architectures and parallel programming paradigms, which interfere with the design and implementation of parallel GlossaryTermEA
s, are outlined. The main performance indicators that can be used to evaluate a parallel GlossaryTermEA
s in terms of efficiency are detailed. Finally, Sect. 55.4 deals with the design and implementation of different parallel models for GlossaryTermEA
s based on the software framework ParadisEO.Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Abbreviations
- ACO:
-
ant colony optimization
- ALU:
-
arithmetic logic unit
- COP:
-
cluster of processors
- COW:
-
cluster of workstations
- CPU:
-
central processing unit
- CUDA:
-
compute unified device architecture
- DMA:
-
direct memory access
- DREAM:
-
distributed resource evolutionary algorithm machine
- EA:
-
evolutionary algorithm
- ECJ:
-
Java evolutionary computation
- FPGA:
-
field programmable gate array
- FPU:
-
floating point unit
- GPU:
-
graphics processing unit
- HPC:
-
high-performance computing
- JDEAL:
-
Java distributed evolutionary algorithms library
- LAN:
-
local network
- MAFRA:
-
Java mimetic algorithms framework
- MPI:
-
message passing interface
- MPP:
-
massively parallel machine
- NOW:
-
networks of workstation
- RAM:
-
random access memory
- RMI:
-
remote method invocation
- RPC:
-
remote procedure call
- SMP:
-
symmetric multiprocessor
- WAN:
-
wide area network
References
E.-G. Talbi: Metaheuristics: From Design to Implementation (Wiley, Hoboken 2009)
H. Mühlenbein: Parallel genetic algorithms, population genetics and combinatorial optimization, 3rd Int. Conf. Genet. Algorithms (1989) pp. 416–421
E. Alba, M. Tomassini: Parallelism and evolutionary algorithms, IEEE Trans. Evol. Comput. 6(5), 443–462 (2002)
E. Alba, E.-G. Talbi, G. Luque, N. Melab: Metaheuristics and parallelism. In: Parallel Metaheuristics, ed. by E. Alba (Wiley, Hoboken 2005)
J. Cohoon, S. Hedge, W. Martin, D. Richards: Punctuated equilibria: A parallel genetic algorithm, Second Int. Conf. Genet. Algorithms (1987) pp. 148–154
T. Belding: The distributed genetic algorithm revisited, 6th Int. Conf. Genet. Algorithms (1995)
E. Cantú-Paz: Efficient and Accurate Parallel Genetic Algorithms (Kluwer, Boston 2000)
E. Alba, J.M. Troya: Influence of the migration policy in parallel distributed GAs with structured and panmictic populations, Appl. Intell. 12(3), 163–181 (2000)
T. Hiroyasu, M. Miki, M. Negami: Distributed genetic algorithms with randomized migration rate, Proc. IEEE Conf. Systems, Man Cybern. 1 (1999) pp. 689–694
S.-L. Lin, W.F. Punch, E.D. Goodman: Coarse-grain parallel genetic algorithms: Categorization and new approach, 6th IEEE Symp. Parallel Distrib. Proces. (1994) pp. 28–37
P. Spiessens, B. Manderick: A massively parallel genetic algorithm, Proc. 4th Int. Conf. Genet. Algorithms (1991) pp. 279–286
G. von Laszewski, H. Mühlenbein: Partitioning a graph with parallel genetic algorithm, Lect. Notes Comput. Sci. 496, 165–169 (1990)
E.G. Talbi, P. Bessière: A parallel genetic algorithm for the graph partitioning problem, Proc. 5th Int. Conf. Supercomput. (1991) pp. 312–320
E.G. Talbi, P. Bessière: Superlinear speedup of a parallel genetic algorithm on the supernode, SIAM News 24(4), 12–27 (1991)
J.M. Ahuactzin, E.G. Talbi, P. Bessière, E. Mazer: Using genetic algorithms for robot motion planning, Lect. Notes Comput. Sci. 708, 84–93 (1993)
K.F. Doerner, R.F. Hartl, G. Kiechle, M. Lucka, M. Reimann: Parallel ant systems for the capacited vehicle routing problem, Lect. Notes Comput. Sci. 3004, 72–83 (2004)
M. Rahoual, R. Hadji, V. Bachelet: Parallel ant system for the set covering problem, Lect. Notes Comput. Sci. 2463, 262–267 (2002)
M. Randall, A. Lewis: A parallel implementation of ant colony ptimization, J. Parallel Distrib. Comput. 62(9), 1421–1432 (2002)
E.-G. Talbi, O. Roux, C. Fonlupt, D. Robillard: Parallel ant colonies for combinatorial optimization problems, Lect. Notes Comput. Sci. 1586, 239–247 (1999)
E.G. Talbi, S. Cahon, N. Melab: Designing cellular networks using a parallel hybrid metaheuristic on the computational grid, Comput. Commun. 30(4), 698–713 (2007)
N. Melab, S. Cahon, E.-G. Talbi: Grid computing for parallel bioinspired algorithms, J. Parallel Distrib. Comput. 66(8), 1052–1061 (2006)
I. Foster, C. Kesselman (Eds.): The Grid: Blueprint for a New Computing Infrastructure (Morgan Kaufmann, San Mateo 1999)
R. Zeidman: Designing with FPGAs and CPLDs (CMP, Lawrence 2002)
M. Pharr, R. Fernando: GPU Gems 2: Programming Techniques for High-Performance Graphics and General-Purpose Computation (Addison-Wesley, Upper Saddle River 2005)
T.-V. Luong, N. Melab, E.-G. Talbi: Parallel hybrid evolutionary algorithms on GPU, IEEE Congr. Evol. Comput. (2010) pp. 1–8
D.R. Butenhof: Programming with POSIX Threads (Addison-Wesley, Upper Saddle River 1997)
P. Hyde: Java Thread Programming (Sams, Indianapolis 1999)
B. Chapman, G. Jost, R. VanderPas, D.J. Kuck: Using OpenMP: Portable Shared Memory Parallel Programming (MIT, Cambridge 2007)
B. Sotomayor, L. Childers: Globus Toolkit 4: Programming Java Services (Morgan Kaufmann, San Mateo 2005)
V. Kumar, A. Grama, A. Gupta, G. Karypis: Introduction to Parallel Computing: Design and Analysis of Algorithms (Addison-Wesley, Upper Saddle River 1994)
E.-G. Talbi: Parallel Combinatorial Optimization (Wiley, Hoboken 2006)
H. Juille, J.B. Pollack: Massively parallel genetic programming. In: Advances in Genetic Programming 2, ed. by P.J. Angeline, K.E. Kinnear Jr. (MIT, Cambridge 1996) pp. 339–358
G. Folino, C. Pizzuti, G. Spezzano: CAGE: A tool for parallel genetic programming applications, Lect. Notes Comput. Sci. 2038, 64–73 (2001)
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, Lect. Notes Comput. Sci. 2439, 665–675 (2002)
G.C. Wilson, A. McIntyre, M.I. Heywood: Resource review: Three open source systems for evolving programs-Lilgp, ECJ and grammatical evolution, Genet. Program. Evol. Mach. 5(19), 103–105 (2004)
C. Gagné, M. Parizeau, M. Dubreuil: Distributed Beagle: An environment for parallel and distributed evolutionary computations, Proc. 17th Ann. Int. Symp. High Perform. Comput. Syst. Appl. (2003) pp. 201–208
E. Alba, F. Almeida, M. Blesa, C. Cotta, M. Díaz, I. Dorta, J. Gabarró, J. González, C. León, L. Moreno, J. Petit, J. Roda, A. Rojas, F. Xhafa: MALLBA: A library of skeletons for combinatorial optimisation, Lect. Notes Comput. Sci. 2400, 927–932 (2002)
N. Krasnogor, J. Smith: MAFRA: A Java memetic algorithms framework, Workshop Proc. GECCO (2002)
E. Gamma, R. Helm, R. Johnson, J. Vlissides: Design Patterns, Elements of Reusable Object-Oriented Software (Addison-Wesley, Upper Saddle River 1994)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Talbi, EG. (2015). Parallel Evolutionary Combinatorial Optimization. In: Kacprzyk, J., Pedrycz, W. (eds) Springer Handbook of Computational Intelligence. Springer Handbooks. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-43505-2_55
Download citation
DOI: https://doi.org/10.1007/978-3-662-43505-2_55
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-43504-5
Online ISBN: 978-3-662-43505-2
eBook Packages: EngineeringEngineering (R0)