Skip to main content
SpringerLink
Log in

Improving Evolutionary Algorithms with Multi-representation Island Models

  • Conference paper
Parallel Problem Solving from Nature - PPSN VIII (PPSN 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3242))

Included in the following conference series:

Abstract

We present an island model that uses different representations in each island. The model transforms individuals from one representation to another during migrations. We show that such a model helps the evolutionary algorithm to escape from local optima and to solve problems that are difficult for single representation EAs. We illustrate this approach with a two population island model in which one island uses a standard binary encoding and the other island uses a standard reflective Gray code. We compare the performance of this multi-representation island model with single population EAs using only binary or Gray codes. We show that, on a variety of difficult multi-modal test functions, the multi-representation island model does no worse than a standard EA on all of the functions, and produces significant improvements on a subset of them.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Wright, S.: The roles of mutation, inbreeding, crossbreeding and selection in evolution. In: Jones, D.F. (ed.) Proceedings of the Sixth International Conference of Genetics, Brooklyn Botanic Garden, pp. 356–366 (1932)

    Google Scholar 

  2. Grosso, P.: Computer Simulations of Genetic Adaptation: Parallel Subcomponent Interaction in a Multilocus Model. PhD thesis, University of Michigan, Ann Arbor, MI (1985)

    Google Scholar 

  3. Gordon, V., Whitley, D., Bohn, A.: Dataflow parallelism in genetic algorithms. In: Manner, R., Manderick, B. (eds.) Parallel Problem Solving from Nature, vol. 2, pp. 542–553. Elsevier Science, Amsterdam (1992)

    Google Scholar 

  4. Manderick, B., Spiessens, P.: Fine-grained parallel genetic algorithms. In: Schaffer, J.D. (ed.) Proceedings of the Third Int. Conf. on Genetic Algorithms, p. 428. Morgan Kauffman, San Francisco (1989)

    Google Scholar 

  5. Mühlenbein, H.: Parallel genetic algorithms, population genetic and combinatorial optimization. In: Schaffer, J. (ed.) Proceedings on the Third International Conference on Genetic Algorithms, pp. 416–421. Morgan Kaufmann, San Francisco (1989)

    Google Scholar 

  6. Sarma, J.: An Analysis of Decentralized and Spatially Distributed Genetic Algorithms. PhD thesis, George Mason University, Fairfax, VA (1998)

    Google Scholar 

  7. Cantú-Paz, E.: Migration policies, selection pressure, and parallel evolutionary algorithms. Journal of Heuristics 7, 311–334 (2001)

    Article  MATH  Google Scholar 

  8. Whitley, D., Rana, S., Heckendorn, R.B.: The island model genetic algorithm: On separability, population size and convergence. Journal of Computing and Information Technology 7, 33–47 (1999)

    Google Scholar 

  9. Toussaint, M.: Self-adaptive exploration in evolutionary search. Technical Report IRINI-2001-05, Institute for Neuroinformatics, Ruhr-University Bochum (2001)

    Google Scholar 

  10. Toussaint, M., Igel, C.: Neutrality: A necessity for self-adaptation. In: Proceedings of the IEEE Congress on Evolutionary Computation (CEC 2002), pp. 1354–1359 (2002)

    Google Scholar 

  11. Eby, D., Averill, R., Goodman, E., Punch, W.: The optimization of flywheels using an injection island genetic algorithm. In: Bentley, P. (ed.) Evolutionary Design by Computers, pp. 167–190. Morgan Kaufmann, San Francisco (1999)

    Google Scholar 

  12. Rana, S., Whitley, L.: Bit representation with a twist. In: Proceedings of the Seventh International Conference on Genetic Algorithms (ICGA 1997), Morgan Kaufmann, San Francisco (1997)

    Google Scholar 

  13. Barbulescu, L., Watson, J.P., Whitley, D.: Dynamic representations and escaping local optima: Improving genetic algorithms and local search. In: AAAI/IAAI, pp. 879–884 (2000)

    Google Scholar 

  14. Rowe, J., Whitley, D., Barbulescu, L., Watson, J.P.: Properties of gray and binary representations. Evolutionary Computation 12, 47–76 (2004)

    Article  Google Scholar 

  15. Whitley, D.L., Rana, S., Heckendorn, R.B.: Representation issues in neighborhood search and evolutionary algorithms. In: Quagliarelli, D., Periaux, J., Poloni, C., Winter, G. (eds.) Genetic Algorithms in Engineering and Computer Science, pp. 39–57. John Wiley & Sons Ltd, Chichester (1997)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. George Mason University, 4400 University Drive, Fairfax, VA, 22031, USA

    Zbigniew Skolicki & Kenneth De Jong

Authors
  1. Zbigniew Skolicki
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kenneth De Jong
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Birmingham, Birmingham, UK

    Xin Yao

  2. Automated Scheduling, Optimisation and Planning Group, School of Computer Science & IT, University of Nottingham, NG8 1BB, Nottingham, UK

    Edmund K. Burke

  3. Intelligent Systems Group Department of Computer Science and Artificial Intelligence, University of the Basque Country, Paseo Manuel de Lardizábal 1, 20018, San Sebastian, Donostia, Spain

    José A. Lozano

  4. University of the West of England, Bristol, United Kingdom

    Jim Smith

  5. GeNeura Team, Depto. Arquitectura y Tecnología de Computadores, Universidad de Granada, Spain

    Juan Julián Merelo-Guervós

  6. School of Computer Science, The University of Birmingham, B15 1TT, Edgbaston, Birmingham, UK

    John A. Bullinaria

  7. School of Computer Science, University of Birmingham, B15 2TT, Birmingham, Great Britain

    Jonathan E. Rowe

  8. School of Computer Science, University of Birmingham, United Kingdom

    Peter Tiňo

  9. School of Computer Science, The University of Birmingham, B15 2TT, Birmingham, UK

    Ata Kabán

  10. Faculty of Computer Science, Dortmund University of Technology, 44221, Dortmund, Germany

    Hans-Paul Schwefel

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Skolicki, Z., De Jong, K. (2004). Improving Evolutionary Algorithms with Multi-representation Island Models. In: Yao, X., et al. Parallel Problem Solving from Nature - PPSN VIII. PPSN 2004. Lecture Notes in Computer Science, vol 3242. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30217-9_43

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30217-9_43

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23092-2

  • Online ISBN: 978-3-540-30217-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation