Skip to main content
Log in

Influence of the Migration Policy in Parallel Distributed GAs with Structured and Panmictic Populations

  • Published:
Applied Intelligence Aims and scope Submit manuscript

Abstract

Parallel genetic algorithms (PGAs) have been traditionally used to overcome the intense use of CPU and memory that serial GAs show in complex problems. Non-parallel GAs can be classified into two classes: panmictic and structured-population algorithms. The difference lies in whether any individual in the population can mate with any other one or not. In this work, they are both considered as two reproductive loop types executed in the islands of a parallel distributed GA. Our aim is to extend the existing studies from more conventional sequential islands to other kinds of evolution. A key issue in such a coarse grain PGA is the migration policy, since it governs the exchange of individuals among the islands. This paper investigates the influence of migration frequency and migrant selection in a ring of islands running either steady-state, generational, or cellular GAs. A diversity analysis is also offered from an entropy point of view. The study uses different problem types, namely easy, deceptive, multimodal, NP-Complete, and epistatic search landscapes in order to provide a wide spectrum of problem difficulties to support the results. Large isolation values and random selection of the migrants are demonstrated as providing a larger probability of success and a smaller number of visited points. Also, interesting observations on the relative performance of the different models are offered, as well as we point out the considerable benefits that can accrue from asynchronous migration.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. T. Bäck, D. Fogel, and Z. Michalewicz (eds.), Handbook of Evolutionary Computation, Oxford University Press, 1997.

  2. E. CantÚ-Paz, "A survey of parallel genetic algorithms," Calculateurs Prallèles, Reseaux et Systems Repartis, vol. 10, no. 2, pp. 141–171, 1998.

    Google Scholar 

  3. A. Chipperfield and P. Fleming, "Parallel genetic algorithms," in Parallel and Distributed Computing Handbook, edited by A.Y.H. Zomaya, MacGraw-Hill, pp. 1118–1143, 1996.

  4. D.E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley, 1989.

  5. R. Shonkwiler, "Parallel genetic algorithms," in Proceedings of the Fifth International Conference on Genetic Algorithms, edited by S. Forrest, Morgan Kaufmann, San Mateo, CA, 1993, pp. 199–205.

    Google Scholar 

  6. P. Spiessens and B. Manderick, "A massively parallel genetic algorithm," in Proceedings, of the Fourth International Conference on Genetic Algorithms, edited by R.K. Belew, and L.B. Booker, Morgan Kaufmann, San Mateo, CA, 1991, pp. 279–286.

    Google Scholar 

  7. R. Tanese, "Distributed genetic algorithms," in Proceedings of the Third International Conference on Genetic Algorithms, edited by J.D. Schaffer, Morgan Kaufmann, San Mateo, CA, 1989, pp. 434–439.

    Google Scholar 

  8. V.S. Gordon and D. Whitley, "Serial and parallel genetic algorithms as function optimizers," in Proceedings of the Fifth International Conference on Genetic Algorithms, edited by S. Forrest, Morgan Kaufmann, San Mateo, CA, 1993, pp. 177–183.

    Google Scholar 

  9. D.H. Wolpert and W.G. Macready, "No free lunch theorems for optimization," IEEE Transactions on Evolutionary Computation, vol. 1, no. 1, 1997, pp. 67–82.

    Google Scholar 

  10. T.C. Belding, "The distributed genetic algorithm revisited," in Proceedings of the Sixth International Conference on Genetic Algorithms, edited by L.J. Eshelman, Morgan Kaufmann, San Francisco, CA, 1995, pp. 114–121.

    Google Scholar 

  11. C.C. Pettey and M.R. Leuze, "A theoretical investigation of a parallel genetic algorithm," in Proceedings of the Third International Conference on Genetic Algorithms, edited by J.D. Schaffer, Morgan Kaufmann, San Mateo, CA, 1989, pp. 398–405.

    Google Scholar 

  12. C. Cotta, E. Alba, and J.M. Troya, "A study on the robustness of parallel genetic algorithms," Inteligencia Artificial, vol. 5, no. V/98, pp. 6–13, 1998 (in Spanish).

    Google Scholar 

  13. E. Alba and J.M. Troya, "An analysis of synchronous and asynchronous parallel distributed genetic algorithms with structured and panmictic islands," in Parallel and Distributed Processing, edited by J. Rolim et al., Springer-Verlag, pp. 248–256, 1999. Lecture Notes in Computer Science 1586.

  14. E. Alba and J.M. Troya, "A survey of parallel distributed genetic algorithms," Complexity, vol. 4, no. 4, pp. 31–52, 1999.

    Google Scholar 

  15. T. Bäck, Evolutionary Algorithms in Theory and Practice, Oxford University Press, 1996.

  16. G. Syswerda, "A study of reproduction in generational and steady-state genetic algorithms," in Foundations of GAs 1, edited by G. Rawlins, Morgan Kaufmann, pp. 94–101, 1991.

  17. D. Whitley, "Cellular genetic algorithms," in Proceedings of the Fifth International Conference on Genetic Algorithms, edited by S. Forrest, Morgan Kaufmann, San Mateo, CA, 1993, p. 658.

    Google Scholar 

  18. D. Whitley and T. Starkweather, "GENITOR II: A distributed genetic algorithm," J. Expt. Theor. Artificial Intelligence, vol. 2, pp. 189–214, 1990.

    Google Scholar 

  19. M. Munetomo, Y. Takai, and Y. Sato, "An efficient migration scheme for subpopulation-based asynchronously parallel genetic algorithms," in Proceedings of the Fifth International Conference on Genetic Algorithms, edited by S. Forrest, Morgan Kaufmann, San Mateo, CA, 1993, p. 649.

    Google Scholar 

  20. T. Maruyama, T. Hirose, and A. Konagaya, "A fine-grained parallel genetic algorithm for distributed parallel systems," in Proceedings of the Fifth International Conference on Genetic Algorithms, edited by S. Forrest, Morgan Kaufmann, San Mateo, CA, 1993, pp.184–190.

    Google Scholar 

  21. N.J. Radcliffe, P.D. Surry, "The reproductive plan language RPL2: Motivation, architecture and applications," in Genetic Algorithms in Optimisation, Simulation and Modelling, edited by J. Stender, E. Hillebrand, and J. Kingdon, IOS Press, 1994.

  22. F. Gruau, "Neural networks synthesis using cellular encoding and the genetic algorithm," Ph.D. Thesis. Univ. Claude Bernard-Lyon I, 1994.

  23. J.G. Maresky, "On efficient communication in distributed genetic algorithms," Master Thesis Dissertation, Institute of Computer Science, The Hebrew Univ. of Jerusalem, 1994.

  24. S.H. Lin, E.D. Goodman, and W.F. Punch, "Investigating parallel genetic algorithms on job shop scheduling problems," in Proceedings of the Sixth International Conference on Evolutionary Programming, edited by P. Angeline, R. Reynolds, J. McDonnell, and R. Eberhart, Springer Verlag, Berlin, 1997, pp. 383–393.

    Google Scholar 

  25. E. Alba, "Analysis and design of parallel distributed genetic algorithms," Ph.D. Dissertation, University of M´alaga, Spain, March, 1999 (in Spanish).

    Google Scholar 

  26. J. Holland, Adaptation in Natural and Artificial Systems, University of Michigan Press, Ann Arbor, 1975.

    Google Scholar 

  27. J.M. Daida, S.J. Ross, and B.C. Hannan, "Biological symbiosis as a metaphor for computational hybridization," in Proceedings of the Sixth International Conference on Genetic Algorithms, edited by L.J. Eshelman, Morgan Kaufmann, San Francisco, CA., 1995, pp. 328–335.

    Google Scholar 

  28. J. Sarma and K. DeJong, "An analysis of local selection algorithms in a spatially structured evolutionary algorithm," in Proceedings of the Seventh International Conference on GAs, edited by T. Bäck, Morgan Kaufmann, San Francisco, CA, 1997, pp. 181–186.

    Google Scholar 

  29. W.E. Hart, S. Baden, R.K. Belew, and S. Kohn, "Analysis of the numerical effects of parallelism on a parallel genetic algorithm," in Proc. of theWorkshop on Solving Combinatorial Optimization Problems in Parallel, edited by IEEE, CD-ROM IPPS97, 1997.

  30. E. CantÚ-Paz and D.E. Goldberg, "Predicting speedups of idealized bounding cases of parallel genetic algorithms," in Proceedings of the Seventh International Conference on GAs, edited by T. Bäck, Morgan Kaufmann, San Francisco, CA, 1997, pp. 113–120.

    Google Scholar 

  31. E. Alba, J.F. Aldana, and J.M. Troya, "Genetic algorithms as heuristics for optimizing ANN design," in Artificial Neural Nets and Genetic Algorithms, edited by R.F. Albrecht, C.R. Reeves, N.C. Steele, Springer-Verlag, pp. 683–690, 1993.

  32. D. Whitley and T. Hanson, "Optimizing neural networks using faster, more accurate genetic search," in Proceedings of the Third International Conferenceon Genetic Algorithms, edited by J.D. Schaffer, Morgan Kaufmann, San Mateo, CA, 1989, pp. 391–396.

    Google Scholar 

  33. D.E. Goldberg, K. Deb, and J. Horn, "Massively multimodality, deception and genetic algorithms," in Parallel Problem Solving from Nature 2, edited by R. Männer and B. Manderick, North-Holland, pp. 37–46, 1992.

  34. J.P. Cohoon, S.U. Hegde, W.N. Martin, and D. Richards, "Punctuated equilibria: A parallel genetic algorithm," in Proceedings of the Second International Conference on GAs, edited by J.J. Grefenstette, Lawrence Erlbaum Associates, 1987, pp. 148–154.

  35. J.M. Yang, J.T. Horng, and C.Y. Kao, "A continuous genetic algorithm for global optimization," in Proceedings of the Seventh International Conference on Genetic Algorithms, edited by T. Bäck, Morgan Kaufmann, San Francisco, CA, 1997, pp. 230–237.

    Google Scholar 

  36. M. Jelasity, "Awave analysis of the subset sum problem," in Proceedings of the Seventh International Conference on Genetic Algorithms, edited by T. Bäck, Morgan Kaufmann, San Francisco, CA, 1997, pp. 89–96.

    Google Scholar 

  37. B. Naudts, D. Suys, and A. Verschoren, "Epistasis as a basic concept in formal landscape analysis," in Proceedings of the Seventh International Conference on GAs, edited by T. Bäck, Morgan Kaufmann, San Francisco, CA, 1997, pp. 65–72.

    Google Scholar 

  38. D. Whitley, T. Starkweather, and C. Bogart, "Genetic algorithms and neural networks: Optimizing connections and connectivity," Parallel Computing, vol. 14, pp. 347–361, 1990.

    Google Scholar 

  39. S.G. Romaniuk, "Evolutionary growth perceptrons," in Proceedings of the Fifth International Conference on Genetic Algorithms, edited by S. Forrest, Morgan Kaufmann, San Mateo, CA, 1993, pp. 334–341.

    Google Scholar 

  40. G. Cammarata, S. Cavalieri, A. Fichera, and L. Marletta, "Noise prediction in urban traffic by a neural approach," in Proc. of the International Workshop on Artificial Neural Networks, edited by J. Mira, J. Cabestany, and A. Prieto, Springer-Verlag, 1993, pp. 611–619.

  41. G. Syswerda, "Uniform crossover in genetic algorithms," in Proceedings of the Third International Conference on Genetic Algorithms, edited by J.D. Schaffer, Morgan Kaufmann, San Mateo, CA, 1989, pp. 2–9.

    Google Scholar 

  42. Z. Michalewicz, Genetic Algorithms + Data Structures = Evolution Programs, Springer-Verlag, 1992.

  43. D. Whitley, "A genetic algorithm tutorial," Statistics and Computing, vol. 4, pp. 65–85, 1994.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Alba, E., Troya, J.M. Influence of the Migration Policy in Parallel Distributed GAs with Structured and Panmictic Populations. Applied Intelligence 12, 163–181 (2000). https://doi.org/10.1023/A:1008358805991

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1008358805991

Navigation