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:
“We have fought too much rhetoric and red tape to be lulled and comforted by a paid political advertisement showing a candidate tossing his grandchild in the air while a disembodied voice espouses “family values” in the background.”
—Bernice Weissbourd (20th century)
“I herewith commission you to carry out all preparations with regard to ... a total solution of the Jewish question in those territories of Europe which are under German influence.... I furthermore charge you to submit to me as soon as possible a draft showing the ... measures already taken for the execution of the intended final solution of the Jewish question.”
—Hermann Goering (1893–1946)