title: Genetic Algorithm Tournament Selection
body: <p>I'm writing a genetic algorithm and I plan to move from roulette wheel selection to tournament selection, but I suspect my understanding may be flawed.</p>
  
  <p>If I'm only selecting the n/2 best solutions in the population, surely I run out of population quite quickly?</p>
  
  <p>My understanding of the algorithm is:</p>
  
  <pre><code>for(Member m in currentPopulation){
      Member randomMember1 = random member of currentPopulation which is then removed from currentPopulation
      Member randomMember2 = as above;
      //Mutate and crossover
  
      if(randomMember1.getScore() &gt; randomMember2.getScore()){
          nextGeneration.add(randomMember1);
      } else {
          nextGeneration.add(randomMember2);
      }
  }
  </code></pre>
  
  <p>Am I understanding this correctly?</p>