Science Fair Project Encyclopedia
Candidate solution
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.
Last updated: 10-18-2005 09:52:14
10-26-2009 08:16:03
The contents of this article is licensed from www.wikipedia.org under the GNU Free Documentation License. Click here to see the transparent copy and copyright details
The contents of this article is licensed from www.wikipedia.org under the GNU Free Documentation License. Click here to see the transparent copy and copyright details