Candidate solution

From Wikipedia, the free encyclopedia

You have new messages (last change).

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. 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.

Image:Mathapplied-stub_ico.png This applied mathematics-related article is a stub. You can help Wikipedia by expanding it.
Retrieved from "http://en.wikipedia.org../../../c/a/n/Candidate_solution.html"
In other languages