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:
“Hear, then, a mortal Muse thy praise rehearse,
In no ignoble verse;
But such as thy own voice did practise here,
When thy first-fruits of Poesy were given,
To make thyself a welcome inmate there;
While yet a young probationer,
And candidate of Heaven.”
—John Dryden (1631–1700)
“Coming out, all the way out, is offered more and more as the political solution to our oppression. The argument goes that, if people could see just how many of us there are, some in very important places, the negative stereotype would vanish overnight. ...It is far more realistic to suppose that, if the tenth of the population that is gay became visible tomorrow, the panic of the majority of people would inspire repressive legislation of a sort that would shock even the pessimists among us.”
—Jane Rule (b. 1931)