Depending on the amount of data to process, file generation may take longer.

If it takes too long to generate, you can limit the data by, for example, reducing the range of years.

Chapter

Download BibTeX

Title

Tournament-Based Convection Selection in Evolutionary Algorithms

Authors

[ 1 ] Instytut Informatyki, Wydział Informatyki, Politechnika Poznańska | [ P ] employee

Scientific discipline (Law 2.0)

[2.3] Information and communication technology

Year of publication

2018

Chapter type

chapter in monograph / paper

Publication language

english

Keywords
EN
  • evolutionary algorithms
  • selection scheme
  • convection selection
  • diversity
  • exploration
Abstract

EN One of the problems that single-threaded (non-parallel) evolutionary algorithms encounter is premature convergence and the lack of diversity in the population. To counteract this problem and improve the performance of evolutionary algorithms in terms of the quality of optimized solutions, a new subpopulation-based selection scheme – the convection selection – is introduced and analyzed in this work. This new selection scheme is compared against traditional selection of individuals in a single-population evolutionary processes. The experimental results indicate that the use of subpopulations with fitness-based assignment of individuals yields better results than both random assignment and a traditional, non-parallel evolutionary architecture.

Pages (from - to)

466 - 475

DOI

10.1007/978-3-319-78054-2_44

URL

https://link.springer.com/chapter/10.1007/978-3-319-78054-2_44

Book

Parallel Processing and Applied Mathematics : 12th International Conference, PPAM 2017, Lublin, Poland, September 10-13, 2017, Revised Selected Papers, Part II

Presented on

12th International Conference on Parallel Processing and Applied Mathematics, PPAM 2017, 11-13.09.2017, Lublin, Poland

Ministry points / chapter

20

Ministry points / conference (CORE)

20

Publication indexed in

WoS (15)

This website uses cookies to remember the authenticated session of the user. For more information, read about Cookies and Privacy Policy.