interface of a feasible solution space to be searched with tabu search. More...
|Virtual dtor. |
interface of a feasible solution space to be searched with tabu search.
Note that "feasible" is not intended w.r.t. the constraint of the problem but only regarding the space we want the local search to explore. From time to time allowing solutions to explore unfeasible regions is non only allowed, but encouraged to improve tabu search performances. In those cases the objective function should probably account for unfeasibility with a penalty term.
This is the most generic solution type and is useful only if you implement your own solution recorder and max-noimprove. Otherwise you might want to derive from an evaluable_solution or from a permutation_problem class, depending on your problem type.