Abstract
This paper proposes methods of parallel evolutionary algorithms using multi-thread programming on a platform with multi-core processors. For this study, we revise the previously proposed edge histogram sampling algorithm (EHBSA) which we call the enhanced EHBSA (eEHBSA). The parallelization models are designed using eEHBSA to increase the execution speed of the algorithm. We propose two types of parallel models; a synchronous multi-thread model (SMTM), and an asynchronous multi-thread model (AMTM). Experiments are performed using TSP. The results showed that both parallel methods increased the speed of the computation times nearly proportional to the number of cores for all test problems. The AMTM produced especially good run time results for small TSP instances without local search. A consideration on parallel evolutionary algorithms with many-core GPUs was also given for future work.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Cantú-Paz, E.: Efficient and Accurate Parallel Genetic Algorithms. Kluwer Academic Publishers, Dordrecht (2000)
Alba, E.: Parallel Metaheuristics: A New Class of Algorithms. John Wiley & Sons, NJ (2005)
Tsutsui, S.: Probabilistic model-building genetic algorithms in permutation representation domain using edge histogram. In: Guervós, J.J.M., Adamidis, P.A., Beyer, H.-G., Fernández-Villacañas, J.-L., Schwefel, H.-P. (eds.) PPSN 2002. LNCS, vol. 2439, pp. 224–233. Springer, Heidelberg (2002)
Pelikan, M., Goldberg, D., Lobo, F.: A survey of optimization by building and using probabilistic models. Computational Optimization and Applications 21(1), 5–20 (2002)
Larrañaga, P., Lozano, J.: Estimation of distribution algorithms: A new tool for evolutionary computation (2002)
Madera, J., Alba, E., Ochoa, A.: Parallel estimation of distribution algorithms. In: Alba, E. (ed.) Parallel Metaheuristics: A New Class of Algorithms, pp. 203–222. John Wiley & Sons, Chichester (2005)
Bosman, P., Thierens, D.: Permutation optimization by iterated estimation of random keys marginal product factorizations. In: Proc. of the 2002 Prallel Problem Solving from Nature, pp. 331–340 (2002)
Robles, V., Miguel, P., Larrañaga, P.: Solving the traveling salesman problem with edas. Estimation of Distribution Algorithms, 211–229 (2002)
Starkweather, T., McDaniel, S., Mathias, K., Whitley, D., Whitley, C.: A comparison of genetic sequence operators. In: Proc. of the 4th Inter. Conf. on Genetic Algorithms, pp. 69–76. Morgan Kaufmann, San Francisco (1991)
Tsutsui, S., Miki, M.: Using edge histogram models to solve flow shop scheduling problems with probabilistic model-building genetic algorithms (2004)
Tsutsui, S., Wilson, G.: Solving capacitated vehicle routing problems using edge histogram based sampling algorithms. In: Proc. of the 2004 Congress on Evolutionary Computation (CEC’ 04), pp. 1150–1157 (2004)
Tsutsui, S., Pelikan, M., Goldberg, D.E.: Using edge histogram models to solve permutation problems with probabilistic model-building genetic algorithms. IlliGAL Report No. 2003022 (2003)
Dorigo, M., Maniezzo, V., Colorni, A.: The ant system: Optimization by a colony of cooperating agents. IEEE Trans. on SMC-Part B 26(1), 29–41 (1996)
Applegate, D., Bixby, R., Chvatal, V., Cook, W.: Ansi c code as gzipped tar file, concorde tsp solver (2006), http://www.tsp.gatech.edu/concorde.html
Tsutsui, S.: cAS: Ant colony optimization with cunning ants. In: Runarsson, T.P., Beyer, H.-G., Burke, E.K., Merelo-Guervós, J.J., Whitley, L.D., Yao, X. (eds.) PPSN 2006. LNCS, vol. 4193, pp. 162–171. Springer, Heidelberg (2006)
NVIDIA:Cuda programming guide 2.1 (2009)
Maitre, O., Baumes, L.A., Lachiche, N., Corma, A., Collet, P.: Coarse grain parallelization of evolutionary algorithms on GPGPU cards with EASEA. In: GECCO ’09: Proc. of the 11th Annual conference on Genetic and evolutionary computation, pp. 1403–1410. ACM, New York (2009)
Tsutsui, S., Fujimoto, N.: Solving quadratic assignment problems by genetic algorithms with gpu computation: A case study. In: Proc. of the GECCO 2009 Workshop on Computational Intelligence on Consumer Games and Graphics Hardware (CIGPU-2009), pp. 2523–2530. ACM, New York (2009)
Whitley, D.: The genitor algorithm and selective pressure: Why rank-based allocation of re-productive trials is best. In: Proc. of the 3rd Inter. Conf. on Genetic Algorithms, pp. 116–121. Morgan Kaufmann, San Francisco (1989)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tsutsui, S. (2010). Parallelization of an Evolutionary Algorithm on a Platform with Multi-core Processors. In: Collet, P., Monmarché, N., Legrand, P., Schoenauer, M., Lutton, E. (eds) Artifical Evolution. EA 2009. Lecture Notes in Computer Science, vol 5975. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14156-0_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-14156-0_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14155-3
Online ISBN: 978-3-642-14156-0
eBook Packages: Computer ScienceComputer Science (R0)