In optimization (a branch of mathematics), a candidate solution is a member of a set of possible solutions to a given problem. A candidate solution does not have to be a likely or reasonable solution to the problem. In the case of the genetic algorithm, the candidate solutions are the individuals in the population being evolved by the algorithm.