Uses of Class
jopt.csp.solution.SolverSolution

Packages that use SolverSolution

jopt.csp
jopt.csp.search	The interfaces to all your searching needs.
jopt.csp.solution	Defines structures for storing solutions to constraint satisfaction problems

Uses of SolverSolution in jopt.csp

Methods in jopt.csp that return SolverSolution

SolverSolution

CspSolver.storeSolution(SolutionScope scope) Returns a solution that has recorded the variable domain information for the variables within the scope specified.

Methods in jopt.csp with parameters of type SolverSolution

abstract void	CspSolver.storeSolution(SolverSolution solution) Records domain values for variables that are defined in the scope of the specified solution.
void	CspSolver.restoreSolution(SolverSolution solution, boolean reset) Calls CspSolver.reset() before calling CspSolver.restoreSolution(SolverSolution) depending on boolean flag passed
abstract void	CspSolver.restoreSolution(SolverSolution solution) Restores domain state information for variables defined within a solution.
abstract void	CspSolver.restoreNeighboringSolution(SolverSolution initial, SolverSolution neighbor) Restores a neighboring solution to another solution that was previously stored.

Uses of SolverSolution in jopt.csp.search

Methods in jopt.csp.search that return SolverSolution

SolverSolution	WeightedRandomizedNeighborhood.getNeighbor(int index)
SolverSolution	UnifiedNeighborhood.getNeighbor(int index)
SolverSolution	SimpleNeighborhood.getNeighbor(int i)
SolverSolution	RandomizedNeighborhood.getNeighbor(int index)
SolverSolution	Neighborhood.getNeighbor(int i) Returns the neighboring solution at index i
SolverSolution	CurrentNeighbor.getSolution()

Methods in jopt.csp.search with parameters of type SolverSolution

void	WeightedRandomizedNeighborhood.setInitialSolution(SolverSolution initial)
void	UnifiedNeighborhood.setInitialSolution(SolverSolution initial)
void	SimpleNeighborhood.setInitialSolution(SolverSolution initial)
void	SimpleNeighborhood.add(SolverSolution neighbor) Adds a new neighbor to the neighborhood.
SearchAction	SearchActions.storeSolution(SolverSolution solution) Creates an action that will store all information for the current problem state in a solution that can be restored at a later date.
SearchAction	SearchActions.restoreSolution(SolverSolution solution) Action that will push all current changes onto the stack and restore another solution.
void	RandomizedNeighborhood.setInitialSolution(SolverSolution initial)
void	Neighborhood.setInitialSolution(SolverSolution initial) Sets the initial solution to which this neighborhood is related
boolean	Metaheuristic.setInitialSolution(SolverSolution initial) Sets the initial solution for this metaheuristic
boolean	Metaheuristic.isAcceptableNeighbor(SolverSolution neighbor) Used to check the validity of the specified neighbor.
boolean	Metaheuristic.isRestoredNeighborValid(SolverSolution neighbor) Notifies the metaheuristic that a neighboring solution has just been restored to the problem allowing the heuristic to determine if the move has produced an allowed result.
void	Metaheuristic.neighborSelected(SolverSolution neighbor) Called when a current neighbor has been selected to allow metaheuristic to store data that will determine how future neighbors will be selected.
SearchAction	LocalSearch.browseNeighbors(SolverSolution initial, SolverSolution[] neighbors) This action will browse a list of neighboring solutions based on an initial solution.
SearchAction	LocalSearch.moveToNeighbor(SolverSolution initial, SolverSolution neighbor) Restores a neighboring solution to the solver
SearchAction	LocalSearch.browseNeighborhood(SolverSolution initial, Neighborhood hood, CurrentNeighbor current) This action will browse a list of neighbors produced from a Neighborhood and attempt to apply each in turn in order to locate other valid solutions to the problem.
SearchAction	LocalSearch.browseNeighborhood(SolverSolution initial, Neighborhood hood, Metaheuristic meta, CurrentNeighbor current) This action will browse a list of neighboring solutions with the guidance of a metaheuristic used to determine which solutions are acceptable.
SearchAction	LocalSearch.selectCurrentNeighbor(SolverSolution initial, CurrentNeighbor current) Advises neighborhoods that the current neighbor is about to be made the new initial solution.
SearchAction	LocalSearch.improve(SolverSolution solution, int step) Action that will post a constraint during searching that will require additional solutions located to be better than the solution given to this action.
SearchAction	LocalSearch.improve(SolverSolution solution, float step) Action that will post a constraint during searching that will require additional solutions located to be better than the solution given to this action.
SearchAction	LocalSearch.improve(SolverSolution solution, long step) Action that will post a constraint during searching that will require additional solutions located to be better than the solution given to this action.
SearchAction	LocalSearch.improve(SolverSolution solution, double step) Action that will post a constraint during searching that will require additional solutions located to be better than the solution given to this action.
SearchAction	LocalSearch.neighborMove(SolverSolution solution, Neighborhood hood, Metaheuristic meta, SearchGoal goal) Advanced action that performs all actions necessary to move to a neighboring solution during local search operations and will only return the first valid neighboring solution
SearchAction	LocalSearch.neighborMove(SolverSolution solution, Neighborhood hood, Metaheuristic meta) Advanced action that performs all actions necessary to move to a neighboring solution during local search operations and will only return the first valid neighboring solution
SearchAction	LocalSearch.neighborMove(SolverSolution solution, Neighborhood hood, SearchGoal goal) Advanced action that performs all actions necessary to move to a neighboring solution during local search operations and will only return the first valid neighboring solution
SearchAction	LocalSearch.neighborMove(SolverSolution solution, Neighborhood hood) Advanced action that performs all actions necessary to move to a neighboring solution during local search operations and will only return the first valid neighboring solution
SearchAction	LocalSearch.tabuMove(SolverSolution solution, Neighborhood hood, Metaheuristic meta, SearchGoal goal, int numToCheck)
SearchAction	LocalSearch.tabuMove(SolverSolution solution, Neighborhood hood, Metaheuristic meta, int numToCheck)
SearchAction	LocalSearch.tabuMove(SolverSolution solution, Neighborhood hood, SearchGoal goal, int numToCheck)
SearchAction	LocalSearch.tabuMove(SolverSolution solution, Neighborhood hood, int numToCheck)
void	CurrentNeighbor.setSolution(SolverSolution solution) Sets a neighboring solution that was produced by the neighborhood

Uses of SolverSolution in jopt.csp.solution

Methods in jopt.csp.solution that return SolverSolution

static SolverSolution

SolverSolution.createNeighbor(SolverSolution initial, SolverSolution result) Creates a neighboring solution that will produce a resulting solution from an initial solution

Methods in jopt.csp.solution with parameters of type SolverSolution

void	SolverSolution.copy(SolverSolution sol) Copies all data in one solution over the data in this solution.
boolean	SolverSolution.isDifferent(SolverSolution neighbor) Returns true if any of the variables in the specified SolverSolution differ from those contained in this SolverSolution object
static SolverSolution	SolverSolution.createNeighbor(SolverSolution initial, SolverSolution result) Creates a neighboring solution that will produce a resulting solution from an initial solution