In optimization (a branch of mathematics) and search algorithms (a topic in computer science), 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 – it is simply in the set that satisfies all constraints.
The space of all candidate solutions is called the feasible region, feasible set, search space, or solution space.
In the case of the genetic algorithm, the candidate solutions are the individuals in the population being evolved by the algorithm.
Famous quotes containing the words candidate and/or solution:
“I have the greatest aversion to being a candidate on a ticket with a man whose record as an upright public man is to be in questionto be defended from the beginning to the end.”
—Rutherford Birchard Hayes (18221893)
“There is a lot of talk now about metal detectors and gun control. Both are good things. But they are no more a solution than forks and spoons are a solution to world hunger.”
—Anna Quindlen (b. 1953)