|
FRODO Version 2.19.1
An open-source framework for Distributed Constraint Optimization (DCOP)
|

Private Member Functions | |
| AddableInteger[] | nextSolBlind () |
Private Attributes | |
| final U | minCost |
| The optimal cost for serving only the already selected customers. | |
Additional Inherited Members | |
| Protected Member Functions inherited from frodo2.solutionSpaces.hypercube.ScalarSpaceIter< V extends Addable< V >, U extends Addable< U > > | |
| ScalarSpaceIter () | |
| Empty constructor. | |
| ScalarSpaceIter (U utility, String[] variables, V[][] domains, V[] assignment, U infeasibleUtil, U skippedUtil) | |
| Constructor. | |
| Protected Member Functions inherited from frodo2.solutionSpaces.hypercube.ScalarBasicSpaceIter< V, U > | |
| ScalarBasicSpaceIter () | |
| Empty constructor. | |
| void | init (U utility, String[] variables, V[][] domains, V[] assignment) |
| Helper method called by the constructor. | |
| void | iter () |
| Moves to the next solution. | |
| Protected Attributes inherited from frodo2.solutionSpaces.hypercube.ScalarBasicSpaceIter< V, U > | |
| U | utility |
| Current utility value. | |
| V[] | solution |
| Current variable assignments. | |
| long | nbrSolLeft |
| The number of solutions left to iterate over. | |
| U | skippedUtil |
| The utility value that should be skipped, if any. | |
| U | inf |
| The infeasible utility. | |
| frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >.VRPiterator.VRPiterator | ( | String[] | variables, |
| AddableInteger | domains[][], | ||
| U | skippedUtil ) |
Constructor.
| variables | variables over which to iterate |
| domains | the domains for the iteration variables |
| skippedUtil | the utility value to skip, if any |
References frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >.customers, frodo2.solutionSpaces.hypercube.ScalarBasicSpaceIter< V, U >.domains, frodo2.solutionSpaces.AddableInteger.equals(), frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >.getUtility(), frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >.infeasibleUtil, frodo2.solutionSpaces.AddableInteger.intValue(), frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >.selectedCustomers, frodo2.solutionSpaces.hypercube.ScalarBasicSpaceIter< V, U >.skippedUtil, frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >.splitDeliveries, frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >.uncertainties, frodo2.solutionSpaces.hypercube.ScalarBasicSpaceIter< V, U >.variables, and frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >.zero.

| U frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >.VRPiterator.getCurrentUtility | ( | ) |
References frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >.getUtility(), and frodo2.solutionSpaces.hypercube.ScalarBasicSpaceIter< V, U >.solution.
Referenced by getCurrentUtility(), and nextUtility().

| U frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >.VRPiterator.getCurrentUtility | ( | U | bound, |
| final boolean | minimize ) |
Reimplemented from frodo2.solutionSpaces.hypercube.ScalarSpaceIter< V extends Addable< V >, U extends Addable< U > >.
References getCurrentUtility(), and minCost.

|
private |
References frodo2.solutionSpaces.hypercube.ScalarBasicSpaceIter< V, U >.iter(), frodo2.solutionSpaces.hypercube.ScalarBasicSpaceIter< V, U >.nbrSolLeft, and frodo2.solutionSpaces.hypercube.ScalarBasicSpaceIter< V, U >.solution.
Referenced by nextSolution().

| AddableInteger[] frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >.VRPiterator.nextSolution | ( | ) |
Implements frodo2.solutionSpaces.SolutionSpace< V extends Addable< V > >.SparseIterator< V >.
References frodo2.solutionSpaces.hypercube.ScalarBasicSpaceIter< V, U >.inf, nextSolBlind(), and frodo2.solutionSpaces.hypercube.ScalarBasicSpaceIter< V, U >.skippedUtil.
Referenced by nextUtility().

| U frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >.VRPiterator.nextUtility | ( | ) |
References getCurrentUtility(), nextSolution(), and frodo2.solutionSpaces.hypercube.ScalarBasicSpaceIter< V, U >.solution.
Referenced by frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >.blindProjectAll(), and nextUtility().

| U frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >.VRPiterator.nextUtility | ( | U | bound, |
| final boolean | minimize ) |
Reimplemented from frodo2.solutionSpaces.hypercube.ScalarSpaceIter< V extends Addable< V >, U extends Addable< U > >.
References minCost, and nextUtility().

|
private |
The optimal cost for serving only the already selected customers.
Referenced by getCurrentUtility(), and nextUtility().