Answers.Body: <p>One can overcome the problem of exploding population by increasing the compatibility threshold. This way one need not compromise the mutation rate.</p>
  
Answers.ContentLicense: CC BY-SA 4.0
Answers.CreationDate: 2023-05-17T14:13:04.157Z
Answers.LastActivityDate: 2023-05-17T14:13:04.157Z
Answers.UserDisplayName: eeqesri
Body: <p>Someone has already asked a <a href="https://ai.stackexchange.com/questions/12778/exploding-population-size-in-neat-python">question</a> about this. But I implemented the suggestion made in the comments without success. So I was wondering if anybody had a better idea.
  I changed the mutation power for the bias and the weights to 5. And the number of genomes roughly doubles after every generation. Consequently the genetic algorithm is taken ages.
  Is there any solution for this?</p>
  
Comments.ContentLicense: CC BY-SA 4.0
Comments.CreationDate: 2023-05-16T10:05:46.797Z
Comments.Text: Can you please put your **specific question** in the title and explain in the body why your question is different from the one in the other post? Thanks.
Comments.UserDisplayName: nbro
Comments.ContentLicense: CC BY-SA 4.0
Comments.CreationDate: 2023-05-17T08:30:13.823Z
Comments.Text: @nbro Actually my question is not so different. Should I delete my question? Also I have found an answer myself. Should I answer in the other post?
Comments.UserDisplayName: eeqesri
Comments.ContentLicense: CC BY-SA 4.0
Comments.CreationDate: 2023-05-17T11:49:07.677Z
Comments.Text: If the answers to the other very similar question don't answer your question, then you can keep it, I'd say.
Comments.UserDisplayName: nbro
Tags: <genetic-algorithms><neat>
Title: Neat Python - Population size explodes because of high mutation rate
UserDisplayName: eeqesri
ThreadText: # Neat Python - Population size explodes because of high mutation rate
  
  (Asked by: username_0 on 2023-05-15)
  
  Someone has already asked a [question](https://ai.stackexchange.com/questions/12778/exploding-population-size-in-neat-python) about this. But I implemented the suggestion made in the comments without success. So I was wondering if anybody had a better idea.
  I changed the mutation power for the bias and the weights to 5. And the number of genomes roughly doubles after every generation. Consequently the genetic algorithm is taken ages.
  Is there any solution for this?
  
  **Tags:** genetic-algorithms, neat
  > **Comments:**
  > **username_1**: Can you please put your **specific question** in the title and explain in the body why your question is different from the one in the other post? Thanks.  
  > **username_0**: @nbro Actually my question is not so different. Should I delete my question? Also I have found an answer myself. Should I answer in the other post?  
  > **username_1**: If the answers to the other very similar question don't answer your question, then you can keep it, I'd say.  
  
  ---
  
  ## 1 answers
  
  ### Answer by username_0 on 2023-05-17. Score: 0 | Accepted answer
  
  One can overcome the problem of exploding population by increasing the compatibility threshold. This way one need not compromise the mutation rate.
  
  
  ---
  
  