How large should the genetic-algorithm population be according to the video?

Conditions

• $n$ is the number of cities.
• This is a heuristic guideline mentioned in the video, not a theorem proved here.
• The context is the genetic-algorithm TSP implementation.

Reasoning, step by step

1. Identify the need for a rich initial set of solutions.
2. State the guideline: population size should be 30 to 60 times $n$.
3. Note the example value: 1000 for 30 cities.

Example

The narrator says the implementation uses a very large population size of one thousand and that some people suggest using 30 to 60 times the number of cities. The genetic-programming input panel shows "population size: 1000" and "numberOfCities: 30".

Common misconceptions

• Assuming a small initial population is sufficient for the genetic algorithm.
• Thinking that the population size guideline is a strict mathematical requirement rather than a heuristic.

Watch the explanation

Explore next

• Why does the video say population size 50 does not get a good solution?
• What does greedy crossover do in the genetic-algorithm TSP demo?
• Which two machine-learning approaches does the playground use for TSP?