Genetic algorithms evolve in fewer generations with a larger population, but also take longer to compute a generation. Are there some guide lines for balancing those two factors, in order to arrive at a viable solution as soon as possible?

Also, is this the best place for the question?

  • $\begingroup$ The question probably belongs on Cross Validated. $\endgroup$ Commented Feb 26, 2011 at 6:45
  • 5
    $\begingroup$ I think this question is fine here, and I would like to see it answered here. As far as I understand genetic algorithms do not have as rigorous analysis as many of the common topics on cstheory, but this question is still a cstheory question and I would argue at the research level. We have answered genetic algorithm questions before: cstheory.stackexchange.com/questions/844/… There's also a meta discussion on these sort of questions: meta.cstheory.stackexchange.com/questions/73/… $\endgroup$ Commented Feb 26, 2011 at 7:56

1 Answer 1


There are some works on this issue. Since you don't specify for what problems you want guidelines I will list some major and some last papers of general interest. They are:


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.