A new parallel genetic algorithm

Ling Tan, D Taniar, K A Smith

Research output: Contribution to conferencePresentation

Abstract

One problem of propagating the globally fittest individual via neighbourhood evolution in both the island model and the cellular model of existing parallel genetic algorithms (PGAs) is that the migration of the globally best individual is delayed to non-adjacent processors. This may cause an inferior search in those sub-populations. The propagation delay of the globally best individual is proportional to the network distance between two processors. Delayed migration of the best individual in PGAs is an essential deviation from the sequential version of the genetic algorithm, in which the best individuals are always used to compete with other individuals. To solve this problem, this paper proposes an extended version of the island PGA called the Virtual Community PGA (VC-PGA).

Original languageEnglish
Publication statusPublished - 2002
Externally publishedYes
EventSixth International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN'02), IEEE Computer Society Press -
Duration: 1 Jan 2002 → …

Conference

ConferenceSixth International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN'02), IEEE Computer Society Press
Period1/01/02 → …

Keywords

  • Genetic algorithm
  • PGA
  • Parellel genetic algorithms
  • Virtual Community PGA

Disciplines

  • Educational Assessment, Evaluation, and Research

Cite this