Skip to main content
Presentation
A new parallel genetic algorithm
Sixth International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN'02), IEEE Computer Society Press (2002)
  • Ling Tan, ACER
  • D Taniar
  • K A Smith
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).

Keywords
  • Parellel genetic algorithms,
  • Genetic algorithm,
  • PGA,
  • Virtual Community PGA
Publication Date
2002
Comments
Proceedings of The Sixth International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN'02), IEEE Computer Society Press, pp. 321-326.
Citation Information
Ling Tan, D Taniar and K A Smith. "A new parallel genetic algorithm" Sixth International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN'02), IEEE Computer Society Press (2002)
Available at: http://works.bepress.com/ling_tan/8/