GAVaPS-a genetic algorithm with varying population size

The size of the population can be critical in many applications of genetic algorithms. If the population size is too small, the genetic algorithm may converge too quickly; if it is too large, the genetic algorithm may waste computational resources; the waiting time for an improvement might be too lo...

Full description

Saved in:
Bibliographic Details
Main Authors: Arabas, J., Michalewicz, Z., Mulawka, J.
Format: Conference Proceeding
Language:English
Subjects:
Convergence
Genetic algorithms
Stochastic processes
Utility programs
Wheels
Citations: Items that cite this one
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The size of the population can be critical in many applications of genetic algorithms. If the population size is too small, the genetic algorithm may converge too quickly; if it is too large, the genetic algorithm may waste computational resources; the waiting time for an improvement might be too long. We propose an adaptive method for maintaining variable population size, which grows and shrinks together according to some characteristic of the search. The first experimental results indicate some merits of the proposed method.< >
DOI:10.1109/ICEC.1994.350039