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)
“All the followers of science are fully persuaded that the processes of investigation, if only pushed far enough, will give one certain solution to each question to which they can be applied.... This great law is embodied in the conception of truth and reality. The opinion which is fated to be ultimately agreed to by all who investigate is what we mean by the truth, and the object represented in this opinion is the real.”
—Charles Sanders Peirce (1839–1914)