|
FRODO Version 2.19.1
An open-source framework for Distributed Constraint Optimization (DCOP)
|
A UtilitySolutionSpace iterator that skips infeasible solutions. More...

Public Member Functions | |
| U | nextUtility (U bound, boolean minimize) |
| Returns the next solution strictly better than the input bound. | |
| U | getCurrentUtility (U bound, boolean minimize) |
| Public Member Functions inherited from frodo2.solutionSpaces.BasicUtilitySolutionSpace< V extends Addable< V >, U extends Serializable >.SparseIterator< V, U > | |
| U | nextUtility () |
| U | getCurrentUtility () |
| void | setCurrentUtility (U util) |
| Sets the utility of the current solution. | |
| Public Member Functions inherited from frodo2.solutionSpaces.SolutionSpace< V extends Addable< V > >.SparseIterator< V > | |
| V[] | nextSolution () |
| V[] | getCurrentSolution () |
| String[] | getVariablesOrder () |
| V[][] | getDomains () |
| void | update () |
| It is supposed to be called if the solution space upon which the iterator is based has changed. | |
A UtilitySolutionSpace iterator that skips infeasible solutions.
| <V> | the type used for variable values |
| <U> | the type used for utility values |
| U frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable< U > >.SparseIterator< V, U >.getCurrentUtility | ( | U | bound, |
| boolean | minimize ) |
| bound | a bound on the desired utility |
| minimize | true if the utility must be lower than the bound |
Implemented in frodo2.solutionSpaces.hypercube.JoinOutputHypercube< V extends Addable< V >, U extends Addable< U > >.JoinOutputIterator< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.vehiclerouting.CompoundSpace< U extends Addable< U > >.BestFirstIterator, and frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >.VRPiteratorBestFirst.
Referenced by frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >.addSolutionSpace(), and frodo2.solutionSpaces.JaCoP.JaCoPutilSpace< V extends Addable< V > >.join().
| U frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable< U > >.SparseIterator< V, U >.nextUtility | ( | U | bound, |
| boolean | minimize ) |
Returns the next solution strictly better than the input bound.
| bound | a bound on the desired utility |
| minimize | true if the utility must be lower than the bound |
null if none was found null even if this.hasNext() returns true. Implemented in frodo2.solutionSpaces.hypercube.JoinOutputHypercube< V extends Addable< V >, U extends Addable< U > >.JoinOutputIterator< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.vehiclerouting.CompoundSpace< U extends Addable< U > >.BestFirstIterator, and frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >.VRPiteratorBestFirst.
Referenced by frodo2.benchmarks.vehiclerouting.CordeauToXCSP.createXCSP(), frodo2.solutionSpaces.JaCoP.JaCoPutilSpace< V extends Addable< V > >.equivalent(), frodo2.algorithms.mpc_discsp.MPC_DisCSP4< V extends Addable< V > >.init(), frodo2.solutionSpaces.hypercube.JoinOutputHypercube< V extends Addable< V >, U extends Addable< U > >.JoinOutputIterator< V extends Addable< V >, U extends Addable< U > >.nextUtilBlind(), frodo2.algorithms.dpop.memory.MemoryBoundedUTIL< V extends Addable< V >, U extends Addable< U > >.projectAndSend(), frodo2.solutionSpaces.JaCoP.JaCoPutilSpace< V extends Addable< V > >.resolve(), and frodo2.solutionSpaces.JaCoP.JaCoPutilSpace< V extends Addable< V > >.toHypercube().