A solution space for Vehicle Routing Problems. More...

Inheritance diagram for frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace >:

[legend]

Classes
class	VRPiterator
	Iterator. More...
class	VRPiteratorBestFirst
	Best first iterator. More...
class	CustomerAssignment
	Convenience class used by the iterator. More...

Public Member Functions
	VehicleRoutingSpace (int nbrVehicles, float maxDist, int maxLoad, float depotX, float depotY, String[] vars, HashMap< String, AddableInteger[]> domsHashMap, HashMap< String, Customer > customers, HashSet< Customer > selectedCustomers, HashMap< String, Customer > uncertainties, String name, String owner, U infeasibleUtil, final int minSplit, ProblemInterface< AddableInteger, ?> problem)
	Constructor.
String	toString ()
VehicleRoutingSpace< U >	changeVariablesOrder (String[] variablesOrder)
VehicleRoutingSpace< U >	clone ()
UtilitySolutionSpace< AddableInteger, U >	compose (String[] vars, BasicUtilitySolutionSpace< AddableInteger, ArrayList< AddableInteger > > substitution)
frodo2.solutionSpaces.UtilitySolutionSpace.ProjOutput< AddableInteger, U >	consensus (String varOut, Map< String, UtilitySolutionSpace< AddableInteger, U > > distributions, boolean maximum)
frodo2.solutionSpaces.UtilitySolutionSpace.ProjOutput< AddableInteger, U >	consensusAllSols (String varOut, Map< String, UtilitySolutionSpace< AddableInteger, U > > distributions, boolean maximum)
frodo2.solutionSpaces.UtilitySolutionSpace.ProjOutput< AddableInteger, U >	consensusExpect (String varOut, Map< String, UtilitySolutionSpace< AddableInteger, U > > distributions, boolean maximum)
frodo2.solutionSpaces.UtilitySolutionSpace.ProjOutput< AddableInteger, U >	consensusAllSolsExpect (String varOut, Map< String, UtilitySolutionSpace< AddableInteger, U > > distributions, boolean maximum)
UtilitySolutionSpace< AddableInteger, U >	expectation (Map< String, UtilitySolutionSpace< AddableInteger, U > > distributions)
boolean	isIncludedIn (UtilitySolutionSpace< AddableInteger, U > space)
IteratorBestFirst< AddableInteger, U >	iteratorBestFirst (boolean maximize)
IteratorBestFirst< AddableInteger, U >	iteratorBestFirst (boolean maximize, String[] fixedVariables, AddableInteger[] fixedValues)
UtilitySolutionSpace< AddableInteger, U >	join (UtilitySolutionSpace< AddableInteger, U > space, String[] totalVariables)
UtilitySolutionSpace< AddableInteger, U >	join (UtilitySolutionSpace< AddableInteger, U > space)
UtilitySolutionSpace< AddableInteger, U >	join (UtilitySolutionSpace< AddableInteger, U >[] spaces)
UtilitySolutionSpace< AddableInteger, U >	joinMinNCCCs (UtilitySolutionSpace< AddableInteger, U > space)
UtilitySolutionSpace< AddableInteger, U >	joinMinNCCCs (UtilitySolutionSpace< AddableInteger, U >[] spaces)
UtilitySolutionSpace< AddableInteger, U >	blindProject (String varOut, boolean maximize)
UtilitySolutionSpace< AddableInteger, U >	blindProject (String[] varsOut, final boolean maximize)
U	blindProjectAll (final boolean maximize)
UtilitySolutionSpace< AddableInteger, U >	min (String variable)
UtilitySolutionSpace< AddableInteger, U >	max (String variable)
UtilitySolutionSpace< AddableInteger, U >	multiply (UtilitySolutionSpace< AddableInteger, U > space, String[] totalVariables)
UtilitySolutionSpace< AddableInteger, U >	multiply (UtilitySolutionSpace< AddableInteger, U > space)
UtilitySolutionSpace< AddableInteger, U >	multiply (UtilitySolutionSpace< AddableInteger, U >[] spaces)
ProjOutput< AddableInteger, U >	project (String[] varsToProj, final boolean maximum)
frodo2.solutionSpaces.UtilitySolutionSpace.ProjOutput< AddableInteger, U >	project (int numberToProject, boolean maximum)
UtilitySolutionSpace.ProjOutput< AddableInteger, U >	project (String variableName, boolean maximum)
ProjOutput< AddableInteger, U >	projectAll (final boolean maximum)
frodo2.solutionSpaces.UtilitySolutionSpace.ProjOutput< AddableInteger, U >	projectAll (boolean maximum, String[] order)
Hypercube< AddableInteger, U >	resolve ()
Hypercube< AddableInteger, U >	resolve (boolean sparse)
Hypercube< AddableInteger, U >	toHypercube ()
Map< AddableInteger, Double >	sample (int nbrSamples)
UtilitySolutionSpace< AddableInteger, U >	slice (String[] varNames, AddableInteger[][] subDomains)
UtilitySolutionSpace< AddableInteger, U >	slice (String[] varNames, AddableInteger[] values)
UtilitySolutionSpace< AddableInteger, U >	slice (String var, AddableInteger[] subDomain)
UtilitySolutionSpace< AddableInteger, U >	slice (String var, AddableInteger val)
UtilitySolutionSpace< AddableInteger, U >	slice (AddableInteger[] variablesValues)
UtilitySolutionSpace< AddableInteger, U >	split (U threshold, boolean maximum)
void	augment (AddableInteger[] variablesValues, U utilityValue)
boolean	equivalent (BasicUtilitySolutionSpace< AddableInteger, U > space)
Class< U >	getClassOfU ()
U	getDefaultUtility ()
U	getUtility (AddableInteger[] values)
U	getUtility (String[] varNames, AddableInteger[] values)
U	getUtility (Map< String, AddableInteger > assignments)
void	setProblem (ProblemInterface< AddableInteger, ?> problem)
boolean	countsCCs ()
U	getUtility (long index)
boolean	isIncludedIn (BasicUtilitySolutionSpace< AddableInteger, U > space)
VRPiterator	iterator ()
VRPiterator	sparseIter ()
VRPiterator	iterator (String[] variables, AddableInteger[][] domains)
VRPiterator	sparseIter (String[] variables, AddableInteger[][] domains)
Iterator< AddableInteger, U >	iterator (String[] variables, AddableInteger[][] domains, AddableInteger[] assignment)
SparseIterator< AddableInteger, U >	sparseIter (String[] variables, AddableInteger[][] domains, AddableInteger[] assignment)
String	prettyPrint (U ignoredUtil)
void	setDefaultUtility (U utility)
void	setInfeasibleUtility (U utility)
boolean	setUtility (AddableInteger[] variablesValues, U utility)
void	setUtility (long index, U utility)
void	augment (AddableInteger[] variablesValues)
AddableInteger[]	getDomain (String variable)
AddableInteger[]	getDomain (int index)
AddableInteger[]	getDomain (String variable, int index)
AddableInteger[][]	getDomains ()
int	getIndex (String variable)
String	getName ()
long	getNumberOfSolutions ()
int	getNumberOfVariables ()
String	getRelationName ()
String	getVariable (int index)
String[]	getVariables ()
VRPiterator	iterator (String[] order)
VRPiterator	sparseIter (String[] order)
SolutionSpace< AddableInteger >	join (SolutionSpace< AddableInteger > space, String[] totalVariables)
SolutionSpace< AddableInteger >	join (SolutionSpace< AddableInteger > space)
SolutionSpace< AddableInteger >	join (SolutionSpace< AddableInteger >[] spaces, String[] totalVariablesOrder)
SolutionSpace< AddableInteger >	join (SolutionSpace< AddableInteger >[] spaces)
boolean	knows (Class<?> spaceClass)
SolutionSpace< AddableInteger >	renameAllVars (String[] newVarNames)
void	renameVariable (String oldName, String newName)
void	setDomain (String var, AddableInteger[] dom)
void	setName (String name)
void	setRelationName (String name)
frodo2.solutionSpaces.UtilitySolutionSpace.ProjOutput< AddableInteger, U >	projExpectMonotone (String varOut, Map< String, UtilitySolutionSpace< AddableInteger, U > > distributions, boolean maximum)
String	getOwner ()
void	setOwner (String owner)
UtilitySolutionSpace< AddableInteger, U >	rescale (U add, U multiply)
Public Member Functions inherited from frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable< U > >
boolean	isIncludedIn (UtilitySolutionSpace< V, U > space)
	Checks if this UtilitySolutionSpace is included in the provided UtilitySolutionSpace.
UtilitySolutionSpace< V, U >	join (UtilitySolutionSpace< V, U > space, String[] total_variables)
	Returns a UtilitySolutionSpace object obtained by joining this UtilitySolutionSpace object with the one provided as a parameter.
UtilitySolutionSpace< V, U >	slice (String[] variables_names, V[][] sub_domains)
	Returns a slice of this UtilitySolutionSpace.
UtilitySolutionSpace< V, U >	slice (String[] variables_names, V[] values)
	Returns a slice of this UtilitySolutionSpace.
UtilitySolutionSpace< V, U >	slice (String var, V[] subDomain)
	Slices this UtilitySolutionSpace over a single variable.
UtilitySolutionSpace< V, U >	slice (String var, V val)
	Slices this UtilitySolutionSpace over a single variable-value assignment.
UtilitySolutionSpace< V, U >	slice (V[] variables_values)
	Returns a slice of this UtilitySolutionSpace.
UtilitySolutionSpace< V, U >	join (UtilitySolutionSpace< V, U > space)
	Computes the join of this UtilitySolutionSpace with the input UtilitySolutionSpace.
UtilitySolutionSpace< V, U >	joinMinNCCCs (UtilitySolutionSpace< V, U > space)
	A version of the join method that minimizes the utility lookups in the caller space and the input spaces.
UtilitySolutionSpace< V, U >	join (UtilitySolutionSpace< V, U >[] spaces)
	Returns a UtilitySolutionSpace object obtained by joining the UtilitySolutionSpace for which this method is called and the UtilitySolutionSpace present in the array of UtilitySolutionSpace given to this method as a parameter.
UtilitySolutionSpace< V, U >	joinMinNCCCs (UtilitySolutionSpace< V, U >[] spaces)
	A version of the join method that minimizes the utility lookups in the caller space and the input spaces.
UtilitySolutionSpace< V, U >	multiply (UtilitySolutionSpace< V, U > space, String[] total_variables)
	Returns a UtilitySolutionSpace object obtained by joining this UtilitySolutionSpace object with the one provided as a parameter.
UtilitySolutionSpace< V, U >	multiply (UtilitySolutionSpace< V, U > space)
	Computes the join of this UtilitySolutionSpace with the input UtilitySolutionSpace.
UtilitySolutionSpace< V, U >	multiply (UtilitySolutionSpace< V, U >[] spaces)
	Returns a UtilitySolutionSpace object obtained by joining the UtilitySolutionSpace for which this method is called and the UtilitySolutionSpace present in the array of UtilitySolutionSpace given to this method as a parameter.
ProjOutput< V, U >	consensus (String varOut, Map< String, UtilitySolutionSpace< V, U > > distributions, boolean maximum)
	A projection operation that uses the consensus approach.
ProjOutput< V, U >	consensusExpect (String varOut, Map< String, UtilitySolutionSpace< V, U > > distributions, boolean maximum)
	The composition of the consensus and expectation operations.
ProjOutput< V, U >	consensusAllSols (String varOut, Map< String, UtilitySolutionSpace< V, U > > distributions, boolean maximum)
	A projection operation that uses the advanced consensus approach.
ProjOutput< V, U >	consensusAllSolsExpect (String varOut, Map< String, UtilitySolutionSpace< V, U > > distributions, boolean maximum)
	The composition of the consensusAllSols and expectation operations.
UtilitySolutionSpace< V, U >	compose (String[] vars, BasicUtilitySolutionSpace< V, ArrayList< V > > substitution)
UtilitySolutionSpace< V, U >	expectation (Map< String, UtilitySolutionSpace< V, U > > distributions)
	Computes the expectation of this utility space over the input random variables, conditioned on the input probability space.
ProjOutput< V, U >	projExpectMonotone (String varOut, Map< String, UtilitySolutionSpace< V, U > > distributions, boolean maximum)
	An optimize expectation().project() operator that assumes that all costs are non-negative (or all utilities non-positive).
IteratorBestFirst< V, U >	iteratorBestFirst (boolean maximize, String[] fixedVariables, V[] fixedValues)
SparseIterator< V, U >	sparseIter (String[] variables, V[][] domains)
SparseIterator< V, U >	sparseIter (String[] variables, V[][] domains, V[] assignment)
Iterator< V, U >	iterator (String[] variables, V[][] domains)
Iterator< V, U >	iterator (String[] variables, V[][] domains, V[] assignment)
Public Member Functions inherited from frodo2.solutionSpaces.UtilitySolutionSpaceLimited< V, U, U >
UtilitySolutionSpaceLimited< V, U, UL >	join (UtilitySolutionSpace< V, U > space)
	Binary join operation.
UtilitySolutionSpaceLimited< V, U, UL >	joinMinNCCCs (UtilitySolutionSpace< V, U > space)
	A version of the join method that minimizes the utility lookups in the caller space and the input space.
UtilitySolutionSpaceLimited< V, U, UL >	blindProject (String varOut, boolean maximize)
	Projects out the input variable without computing the corresponding optimal assignments.
UL	blindProjectAll (boolean maximize)
	Projects out all variables without computing the corresponding optimal assignments.
UtilitySolutionSpaceLimited< V, U, UL >	min (String variable)
	Project out a variable by minimizing over it, without computing the argmin.
UtilitySolutionSpaceLimited< V, U, UL >	max (String variable)
	Project out a variable by maximizing over it, without computing the argmax.
UtilitySolutionSpaceLimited< V, U, UL >	slice (String var, V val)
UtilitySolutionSpaceLimited< V, U, UL >	resolve ()

Protected Member Functions
VehicleRoutingSpace< U >	newInstance (int nbrVehicles, float maxDist, int maxLoad, float depotX, float depotY, String[] vars, HashMap< String, AddableInteger[]> domsHashMap, HashMap< String, Customer > customers, HashSet< Customer > selectedCustomers, HashMap< String, Customer > uncertainties, String name, U infeasibleUtil, final int minSplit, ProblemInterface< AddableInteger, ?> problem)
	Constructs a new instance of this class.
U	getUtility (final HashSet< Customer > toBeServed)
	Computes the optimal cost of serving a set of customers.

Protected Attributes
String	name
	The name of this constraint.
final int	nbrVehicles
	The number of vehicles available to this depot.
final float	maxDist
	The maximum distance each vehicle is allowed to travel.
final int	maxLoad
	The maximum load each vehicle is allowed to carry.
final int	totalMaxLoad
	The total maximum load across all vehicles.
final float	depotX
	The X coordinate of the depot.
final float	depotY
	The Y coordinate of the depot.
U	infeasibleUtil
	The infeasible utility.
Composite	solver
	The VRP solver.
ProblemInterface< AddableInteger, ?>	problem
	The problem to be notified of constraint checks.

Static Package Functions
	[static initializer]

Private Member Functions
boolean	containsAllVars (String[] vars2)
	Checks whether this space contains all the input variables.

Private Attributes
HashMap< String, Customer >	customers
	The customers, indexed by their variable name.
HashSet< Customer >	selectedCustomers
	Customers that the depot is required to serve.
int	selectedLoad
	The total load of the selected customers.
String[]	vars
	The constraint's variables.
final boolean	splitDeliveries
	Whether orders can be split among depots.
AddableInteger[][]	doms
	The domains of the variables.
HashMap< String, Customer >	uncertainties
	For each random variable, the customer it refers to.
final int	minSplit
	The minimum split size (no split if <= 0).
String	owner
	The owner of this space.

Static Private Attributes
static final long	serialVersionUID = 6651845834019201776L
	Used for serialization.
static final AddableInteger	zero = new AddableInteger (0)
	The domain value indicating that the customer should not be served.
static final AddableInteger	one = new AddableInteger (1)
	The domain value indicating that the customer should be served.
static HashSet< Class<?> >	knownSpaces
	The types of spaces that we know how to handle.

Detailed Description

A solution space for Vehicle Routing Problems.

Author: Thomas Leaute

Parameters

<U>	the type used for utility values (default is AddableReal)

Constructor & Destructor Documentation

◆ VehicleRoutingSpace()

frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >.VehicleRoutingSpace	(	int	nbrVehicles,
		float	maxDist,
		int	maxLoad,
		float	depotX,
		float	depotY,
		String[]	vars,
		HashMap< String, AddableInteger[]>	domsHashMap,
		HashMap< String, Customer >	customers,
		HashSet< Customer >	selectedCustomers,
		HashMap< String, Customer >	uncertainties,
		String	name,
		String	owner,
		U	infeasibleUtil,
		final int	minSplit,
		ProblemInterface< AddableInteger, ?>	problem )

Constructor.

Parameters

nbrVehicles	The number of vehicles available to this depot
maxDist	The maximum distance each vehicle is allowed to travel
maxLoad	The maximum load each vehicle is allowed to carry
depotX	The X coordinate of the depot
depotY	The Y coordinate of the depot
vars	The constraint's variables
domsHashMap	The desired domains for some of the variables
customers	The customers, indexed by their variable names
selectedCustomers	Customers that the depot is required to serve
uncertainties	For each random variable, the customer it refers to
name	The name of this constraint
owner	The owner
infeasibleUtil	The infeasible utility
minSplit	The minimum split size (no split if <= 0)
problem	The problem to be notified of constraint checks

Todo: Choose the algorithm more carefully

References frodo2.solutionSpaces.vehiclerouting.Customer.angles, customers, frodo2.solutionSpaces.vehiclerouting.Customer.demand, depotX, depotY, infeasibleUtil, maxDist, maxLoad, minSplit, name, nbrVehicles, one, owner, problem, selectedCustomers, solver, uncertainties, vars, and zero.

Referenced by [static initializer](), changeVariablesOrder(), clone(), joinMinNCCCs(), joinMinNCCCs(), newInstance(), frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace >.CustomerAssignment >.setUtility(), slice(), frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace >.VRPiteratorBestFirst.VRPiteratorBestFirst(), and frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace >.VRPiteratorBestFirst.VRPiteratorBestFirst().

Member Function Documentation

◆ [static initializer]()

frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace >.[static initializer]

staticpackage

References knownSpaces, and VehicleRoutingSpace().

Here is the call graph for this function:

◆ augment() [1/2]

void frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace >.augment ( AddableInteger[] variablesValues )

See also: SolutionSpace#augment(Addable[])

Todo: Auto-generated method stub

◆ augment() [2/2]

void frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >.augment	(	AddableInteger[]	variablesValues,
		U	utilityValue )

See also: BasicUtilitySolutionSpace.augment(Addable[], java.io.Serializable)

Todo: Auto-generated method stub

◆ blindProject() [1/2]

UtilitySolutionSpace< AddableInteger, U > frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >.blindProject	(	String	varOut,
		boolean	maximize )

See also: UtilitySolutionSpace.blindProject(String, boolean)

Implements frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable >.

References blindProject().

Referenced by blindProject(), max(), and min().

Here is the call graph for this function:

◆ blindProject() [2/2]

UtilitySolutionSpace< AddableInteger, U > frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >.blindProject	(	String[]	varsOut,
		final boolean	maximize )

See also: UtilitySolutionSpaceLimited.blindProject(String[], boolean)

Implements frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable >.

References blindProjectAll(), getDomain(), and getNumberOfVariables().

Here is the call graph for this function:

◆ blindProjectAll()

U frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace >.blindProjectAll ( final boolean maximize )

See also: UtilitySolutionSpaceLimited.blindProjectAll(boolean)

Implements frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable >.

References frodo2.solutionSpaces.hypercube.ScalarBasicSpaceIter< V extends Addable< V >, U extends Serializable >.hasNext(), iterator(), and frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace >.VRPiterator.nextUtility().

Referenced by blindProject().

Here is the call graph for this function:

◆ changeVariablesOrder()

VehicleRoutingSpace frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace >.changeVariablesOrder ( String[] variablesOrder )

See also: UtilitySolutionSpace.changeVariablesOrder(String[])

Implements frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable >.

References customers, depotX, depotY, infeasibleUtil, maxDist, maxLoad, name, newInstance(), selectedCustomers, toString(), and VehicleRoutingSpace().

Here is the call graph for this function:

◆ clone()

VehicleRoutingSpace frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace >.clone ( )

See also: java.lang.Object#clone()

Implements frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable >.

References clone(), depotX, depotY, doms, infeasibleUtil, maxDist, maxLoad, minSplit, name, nbrVehicles, owner, problem, vars, and VehicleRoutingSpace().

Referenced by clone(), expectation(), and slice().

Here is the call graph for this function:

◆ compose()

UtilitySolutionSpace< AddableInteger, U > frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >.compose	(	String[]	vars,
		BasicUtilitySolutionSpace< AddableInteger, ArrayList< AddableInteger > >	substitution )

See also: frodo2.solutionSpaces.UtilitySolutionSpace.compose(java.lang.String[], frodo2.solutionSpaces.BasicUtilitySolutionSpace)

Todo: Auto-generated method stub

References vars.

◆ consensus()

frodo2.solutionSpaces.UtilitySolutionSpace.ProjOutput< AddableInteger, U > frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >.consensus	(	String	varOut,
		Map< String, UtilitySolutionSpace< AddableInteger, U > >	distributions,
		boolean	maximum )

See also: frodo2.solutionSpaces.UtilitySolutionSpace.consensus(java.lang.String, java.util.Map, boolean)

Todo: Auto-generated method stub

◆ consensusAllSols()

frodo2.solutionSpaces.UtilitySolutionSpace.ProjOutput< AddableInteger, U > frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >.consensusAllSols	(	String	varOut,
		Map< String, UtilitySolutionSpace< AddableInteger, U > >	distributions,
		boolean	maximum )

See also: frodo2.solutionSpaces.UtilitySolutionSpace.consensusAllSols(java.lang.String, java.util.Map, boolean)

Todo: Auto-generated method stub

◆ consensusAllSolsExpect()

frodo2.solutionSpaces.UtilitySolutionSpace.ProjOutput< AddableInteger, U > frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >.consensusAllSolsExpect	(	String	varOut,
		Map< String, UtilitySolutionSpace< AddableInteger, U > >	distributions,
		boolean	maximum )

See also: frodo2.solutionSpaces.UtilitySolutionSpace.consensusAllSolsExpect(java.lang.String, java.util.Map, boolean)

Todo: Auto-generated method stub

◆ consensusExpect()

frodo2.solutionSpaces.UtilitySolutionSpace.ProjOutput< AddableInteger, U > frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >.consensusExpect	(	String	varOut,
		Map< String, UtilitySolutionSpace< AddableInteger, U > >	distributions,
		boolean	maximum )

See also: frodo2.solutionSpaces.UtilitySolutionSpace.consensusExpect(java.lang.String, java.util.Map, boolean)

Todo: Auto-generated method stub

◆ containsAllVars()

boolean frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace >.containsAllVars ( String[] vars2 )

private

Checks whether this space contains all the input variables.

Parameters

vars2 the input variables

Returns: whether this space contains all the input variables

References getDomain().

Referenced by project().

Here is the call graph for this function:

◆ countsCCs()

boolean frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace >.countsCCs ( )

See also: UtilitySolutionSpace#countsCCs()

◆ equivalent()

boolean frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace >.equivalent ( BasicUtilitySolutionSpace< AddableInteger, U > space )

See also: frodo2.solutionSpaces.BasicUtilitySolutionSpace.equivalent(frodo2.solutionSpaces.BasicUtilitySolutionSpace)

Todo: Auto-generated method stub

◆ expectation()

UtilitySolutionSpace< AddableInteger, U > frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace >.expectation ( Map< String, UtilitySolutionSpace< AddableInteger, U > > distributions )

See also: UtilitySolutionSpace.expectation(java.util.Map)

References clone(), and getDomain().

Here is the call graph for this function:

◆ getClassOfU()

Class frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace >.getClassOfU ( )

See also: BasicUtilitySolutionSpace.getClassOfU()

References getClassOfU().

Referenced by getClassOfU().

Here is the call graph for this function:

◆ getDefaultUtility()

U frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace >.getDefaultUtility ( )

See also: frodo2.solutionSpaces.BasicUtilitySolutionSpace.getDefaultUtility()

Todo: Auto-generated method stub

◆ getDomain() [1/3]

AddableInteger[] frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace >.getDomain ( int index )

See also: SolutionSpace.getDomain(int)

◆ getDomain() [2/3]

AddableInteger[] frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace >.getDomain ( String variable )

See also: SolutionSpace.getDomain(java.lang.String)

Referenced by blindProject(), containsAllVars(), expectation(), join(), project(), and slice().

◆ getDomain() [3/3]

AddableInteger[] frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >.getDomain	(	String	variable,
		int	index )

See also: frodo2.solutionSpaces.SolutionSpace.getDomain(java.lang.String, int)

Todo: Auto-generated method stub

◆ getDomains()

AddableInteger[][] frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace >.getDomains ( )

See also: frodo2.solutionSpaces.SolutionSpace.getDomains()

Referenced by iterator(), iterator(), iteratorBestFirst(), iteratorBestFirst(), sparseIter(), and sparseIter().

◆ getIndex()

int frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace >.getIndex ( String variable )

See also: frodo2.solutionSpaces.SolutionSpace.getIndex(java.lang.String)

Todo: Auto-generated method stub

◆ getName()

String frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace >.getName ( )

See also: SolutionSpace.getName()

Referenced by frodo2.benchmarks.vehiclerouting.XCSPparserVRP >.parseConstraint().

◆ getNumberOfSolutions()

long frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace >.getNumberOfSolutions ( )

See also: SolutionSpace.getNumberOfSolutions()

Referenced by resolve().

◆ getNumberOfVariables()

int frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace >.getNumberOfVariables ( )

See also: SolutionSpace.getNumberOfVariables()

Referenced by blindProject().

◆ getOwner()

String frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace >.getOwner ( )

See also: SolutionSpace.getOwner()

◆ getRelationName()

String frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace >.getRelationName ( )

See also: frodo2.solutionSpaces.SolutionSpace.getRelationName()

◆ getUtility() [1/5]

U frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace >.getUtility ( AddableInteger[] values )

See also: BasicUtilitySolutionSpace#getUtility(Addable[])

References getUtility().

Referenced by frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace >.VRPiterator.getCurrentUtility(), getUtility(), getUtility(), getUtility(), frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace >.CustomerAssignment >.setUtility(), slice(), and frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace >.VRPiterator.VRPiterator().

Here is the call graph for this function:

◆ getUtility() [2/5]

U frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace >.getUtility ( final HashSet< Customer > toBeServed )

protected

Computes the optimal cost of serving a set of customers.

Parameters

toBeServed the customers

Returns: the optimal cost of the routes to serve the input customers

Todo: cloning is a hack because setPosition() is buggy

References frodo2.solutionSpaces.ProblemInterface< V extends Addable< V >, U extends Addable >.incrNCCCs(), and solver.

Here is the call graph for this function:

◆ getUtility() [3/5]

U frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace >.getUtility ( long index )

See also: BasicUtilitySolutionSpace.getUtility(long)

Todo: Auto-generated method stub

◆ getUtility() [4/5]

U frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace >.getUtility ( Map< String, AddableInteger > assignments )

See also: BasicUtilitySolutionSpace.getUtility(java.util.Map)

References frodo2.solutionSpaces.AddableInteger.equals(), getUtility(), frodo2.solutionSpaces.AddableInteger.intValue(), frodo2.solutionSpaces.vehiclerouting.Customer.setPosition(), and zero.

Here is the call graph for this function:

◆ getUtility() [5/5]

U frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >.getUtility	(	String[]	varNames,
		AddableInteger[]	values )

See also: BasicUtilitySolutionSpace.getUtility(java.lang.String[], Addable[])

References frodo2.solutionSpaces.AddableInteger.equals(), getUtility(), frodo2.solutionSpaces.AddableInteger.intValue(), frodo2.solutionSpaces.vehiclerouting.Customer.setPosition(), and zero.

Here is the call graph for this function:

◆ getVariable()

String frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace >.getVariable ( int index )

See also: SolutionSpace.getVariable(int)

◆ getVariables()

String[] frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace >.getVariables ( )

See also: SolutionSpace.getVariables()

◆ isIncludedIn() [1/2]

boolean frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace >.isIncludedIn ( BasicUtilitySolutionSpace< AddableInteger, U > space )

See also: frodo2.solutionSpaces.BasicUtilitySolutionSpace.isIncludedIn(frodo2.solutionSpaces.BasicUtilitySolutionSpace)

Todo: Auto-generated method stub

◆ isIncludedIn() [2/2]

boolean frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace >.isIncludedIn ( UtilitySolutionSpace< AddableInteger, U > space )

See also: frodo2.solutionSpaces.UtilitySolutionSpace.isIncludedIn(frodo2.solutionSpaces.UtilitySolutionSpace)

Todo: Auto-generated method stub

◆ iterator() [1/4]

VRPiterator frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace >.iterator ( )

See also: BasicUtilitySolutionSpace.iterator()

Implements frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable >.

References getDomains().

Referenced by blindProjectAll(), iterator(), project(), and projectAll().

Here is the call graph for this function:

◆ iterator() [2/4]

VRPiterator frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace >.iterator ( String[] order )

See also: SolutionSpace.iterator(java.lang.String[])

Implements frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable >.

References getDomains(), and iterator().

Here is the call graph for this function:

◆ iterator() [3/4]

VRPiterator frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >.iterator	(	String[]	variables,
		AddableInteger	domains[][] )

See also: BasicUtilitySolutionSpace.iterator(java.lang.String[], Addable[][])

◆ iterator() [4/4]

Iterator< AddableInteger, U > frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >.iterator	(	String[]	variables,
		AddableInteger	domains[][],
		AddableInteger[]	assignment )

See also: UtilitySolutionSpace.iterator(java.lang.String[], Addable[][], Addable[])

Todo: Improve by making use of assignments

◆ iteratorBestFirst() [1/2]

IteratorBestFirst< AddableInteger, U > frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace >.iteratorBestFirst ( boolean maximize )

See also: UtilitySolutionSpace.iteratorBestFirst(boolean)

Implements frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable >.

References getDomains().

Here is the call graph for this function:

◆ iteratorBestFirst() [2/2]

IteratorBestFirst< AddableInteger, U > frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >.iteratorBestFirst	(	boolean	maximize,
		String[]	fixedVariables,
		AddableInteger[]	fixedValues )

See also: UtilitySolutionSpace.iteratorBestFirst(boolean, java.lang.String[], Addable[])

References getDomains().

Here is the call graph for this function:

◆ join() [1/7]

SolutionSpace< AddableInteger > frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace >.join ( SolutionSpace< AddableInteger > space )

See also: frodo2.solutionSpaces.SolutionSpace.join(frodo2.solutionSpaces.SolutionSpace)

Todo: Auto-generated method stub

◆ join() [2/7]

SolutionSpace< AddableInteger > frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >.join	(	SolutionSpace< AddableInteger >	space,
		String[]	totalVariables )

See also: frodo2.solutionSpaces.SolutionSpace.join(frodo2.solutionSpaces.SolutionSpace, java.lang.String[])

Todo: Auto-generated method stub

◆ join() [3/7]

SolutionSpace< AddableInteger > frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace >.join ( SolutionSpace< AddableInteger >[] spaces )

See also: SolutionSpace#join(SolutionSpace[])

Todo: Auto-generated method stub

◆ join() [4/7]

SolutionSpace< AddableInteger > frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >.join	(	SolutionSpace< AddableInteger >[]	spaces,
		String[]	totalVariablesOrder )

See also: SolutionSpace.join(SolutionSpace[], java.lang.String[])

Todo: Auto-generated method stub

◆ join() [5/7]

UtilitySolutionSpace< AddableInteger, U > frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace >.join ( UtilitySolutionSpace< AddableInteger, U > space )

See also: UtilitySolutionSpace#join(UtilitySolutionSpace)

Todo: Check also when split deliveries are allowed

References customers, frodo2.solutionSpaces.AddableInteger.equals(), getDomain(), join(), frodo2.solutionSpaces.hypercube.Hypercube< V extends Addable< V >, U extends Addable >.NullHypercube< V extends Addable< V >, U extends Addable >.NULL, one, frodo2.solutionSpaces.hypercube.Hypercube< V extends Addable< V >, U extends Addable >.union(), and zero.

Here is the call graph for this function:

◆ join() [6/7]

UtilitySolutionSpace< AddableInteger, U > frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >.join	(	UtilitySolutionSpace< AddableInteger, U >	space,
		String[]	totalVariables )

See also: frodo2.solutionSpaces.UtilitySolutionSpace.join(frodo2.solutionSpaces.UtilitySolutionSpace, java.lang.String[])

Todo: Auto-generated method stub

Referenced by join().

◆ join() [7/7]

UtilitySolutionSpace< AddableInteger, U > frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace >.join ( UtilitySolutionSpace< AddableInteger, U >[] spaces )

See also: UtilitySolutionSpace#join(UtilitySolutionSpace[])

Todo: Implement more efficiently

References frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable >.join().

Here is the call graph for this function:

◆ joinMinNCCCs() [1/2]

UtilitySolutionSpace< AddableInteger, U > frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace >.joinMinNCCCs ( UtilitySolutionSpace< AddableInteger, U > space )

See also: UtilitySolutionSpace#joinMinNCCCs(UtilitySolutionSpace)

References frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable >.joinMinNCCCs(), and VehicleRoutingSpace().

Here is the call graph for this function:

◆ joinMinNCCCs() [2/2]

UtilitySolutionSpace< AddableInteger, U > frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace >.joinMinNCCCs ( UtilitySolutionSpace< AddableInteger, U >[] spaces )

See also: UtilitySolutionSpace#joinMinNCCCs(UtilitySolutionSpace[])

References frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable >.joinMinNCCCs(), resolve(), and VehicleRoutingSpace().

Here is the call graph for this function:

◆ knows()

boolean frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace >.knows ( Class<?> spaceClass )

See also: SolutionSpace.knows(java.lang.Class)

References knownSpaces.

◆ max()

UtilitySolutionSpace< AddableInteger, U > frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace >.max ( String variable )

See also: UtilitySolutionSpaceLimited.max(String)

Implements frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable >.

References blindProject().

Here is the call graph for this function:

◆ min()

UtilitySolutionSpace< AddableInteger, U > frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace >.min ( String variable )

See also: UtilitySolutionSpaceLimited.min(String)

Implements frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable >.

References blindProject().

Here is the call graph for this function:

◆ multiply() [1/3]

UtilitySolutionSpace< AddableInteger, U > frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace >.multiply ( UtilitySolutionSpace< AddableInteger, U > space )

See also: frodo2.solutionSpaces.UtilitySolutionSpace.multiply(frodo2.solutionSpaces.UtilitySolutionSpace)

Todo: Auto-generated method stub

◆ multiply() [2/3]

UtilitySolutionSpace< AddableInteger, U > frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >.multiply	(	UtilitySolutionSpace< AddableInteger, U >	space,
		String[]	totalVariables )

See also: frodo2.solutionSpaces.UtilitySolutionSpace.multiply(frodo2.solutionSpaces.UtilitySolutionSpace, java.lang.String[])

Todo: Auto-generated method stub

Referenced by rescale().

◆ multiply() [3/3]

UtilitySolutionSpace< AddableInteger, U > frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace >.multiply ( UtilitySolutionSpace< AddableInteger, U >[] spaces )

See also: UtilitySolutionSpace#multiply(UtilitySolutionSpace[])

Todo: Auto-generated method stub

◆ newInstance()

VehicleRoutingSpace< U > frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >.newInstance	(	int	nbrVehicles,
		float	maxDist,
		int	maxLoad,
		float	depotX,
		float	depotY,
		String[]	vars,
		HashMap< String, AddableInteger[]>	domsHashMap,
		HashMap< String, Customer >	customers,
		HashSet< Customer >	selectedCustomers,
		HashMap< String, Customer >	uncertainties,
		String	name,
		U	infeasibleUtil,
		final int	minSplit,
		ProblemInterface< AddableInteger, ?>	problem )

protected

Constructs a new instance of this class.

Parameters

nbrVehicles	The number of vehicles available to this depot
maxDist	The maximum distance each vehicle is allowed to travel
maxLoad	The maximum load each vehicle is allowed to carry
depotX	The X coordinate of the depot
depotY	The Y coordinate of the depot
vars	The constraint's variables
domsHashMap	The desired domains for some of the variables
customers	The customers, indexed by their variable names
selectedCustomers	Customers that the depot is required to serve
uncertainties	For each random variable, the customer it refers to
name	The name of this constraint
infeasibleUtil	The infeasible utility
minSplit	The minimum split size (no split if <= 0)
problem	The problem to be notified of constraint checks

Returns: a new instance of this class

References customers, depotX, depotY, infeasibleUtil, maxDist, maxLoad, minSplit, name, nbrVehicles, problem, selectedCustomers, uncertainties, vars, and VehicleRoutingSpace().

Referenced by changeVariablesOrder(), and slice().

Here is the call graph for this function:

◆ prettyPrint()

String frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace >.prettyPrint ( U ignoredUtil )

See also: frodo2.solutionSpaces.BasicUtilitySolutionSpace.prettyPrint(java.io.Serializable)

Todo: Auto-generated method stub

◆ project() [1/3]

frodo2.solutionSpaces.UtilitySolutionSpace.ProjOutput< AddableInteger, U > frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >.project	(	int	numberToProject,
		boolean	maximum )

See also: frodo2.solutionSpaces.UtilitySolutionSpace.project(int, boolean)

Todo: Auto-generated method stub

Implements frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable >.

◆ project() [2/3]

UtilitySolutionSpace.ProjOutput< AddableInteger, U > frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >.project	(	String	variableName,
		boolean	maximum )

See also: UtilitySolutionSpace.project(String, boolean)

Implements frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable >.

References project().

Here is the call graph for this function:

◆ project() [3/3]

ProjOutput< AddableInteger, U > frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >.project	(	String[]	varsToProj,
		final boolean	maximum )

See also: UtilitySolutionSpace.project(java.lang.String[], boolean)

Implements frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable >.

References frodo2.solutionSpaces.AddableInteger.add(), containsAllVars(), frodo2.solutionSpaces.AddableInteger.fromInt(), getDomain(), frodo2.solutionSpaces.hypercube.ScalarBasicSpaceIter< V extends Addable< V >, U extends Serializable >.hasNext(), iterator(), frodo2.output, project(), projectAll(), and frodo2.solutionSpaces.hypercube.BasicHypercube< V extends Addable< V >, U extends Serializable >.setUtility().

Referenced by project(), and project().

Here is the call graph for this function:

◆ projectAll() [1/2]

frodo2.solutionSpaces.UtilitySolutionSpace.ProjOutput< AddableInteger, U > frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >.projectAll	(	boolean	maximum,
		String[]	order )

See also: frodo2.solutionSpaces.UtilitySolutionSpace.projectAll(boolean, java.lang.String[])

Todo: Auto-generated method stub

Implements frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable >.

◆ projectAll() [2/2]

ProjOutput< AddableInteger, U > frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace >.projectAll ( final boolean maximum )

See also: UtilitySolutionSpace.projectAll(boolean)

Implements frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable >.

References frodo2.solutionSpaces.hypercube.ScalarBasicSpaceIter< V extends Addable< V >, U extends Serializable >.hasNext(), and iterator().

Referenced by project().

Here is the call graph for this function:

◆ projExpectMonotone()

frodo2.solutionSpaces.UtilitySolutionSpace.ProjOutput< AddableInteger, U > frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >.projExpectMonotone	(	String	varOut,
		Map< String, UtilitySolutionSpace< AddableInteger, U > >	distributions,
		boolean	maximum )

See also: frodo2.solutionSpaces.UtilitySolutionSpace.projExpectMonotone(java.lang.String, java.util.Map, boolean)

Todo: Auto-generated method stub

◆ renameAllVars()

SolutionSpace< AddableInteger > frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace >.renameAllVars ( String[] newVarNames )

See also: frodo2.solutionSpaces.SolutionSpace.renameAllVars(java.lang.String[])

Todo: Auto-generated method stub

◆ renameVariable()

void frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >.renameVariable	(	String	oldName,
		String	newName )

See also: frodo2.solutionSpaces.SolutionSpace.renameVariable(java.lang.String, java.lang.String)

Todo: Auto-generated method stub

◆ rescale()

UtilitySolutionSpace< AddableInteger, U > frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >.rescale	(	U	add,
		U	multiply )

See also: frodo2.solutionSpaces.UtilitySolutionSpace.rescale(frodo2.solutionSpaces.Addable, frodo2.solutionSpaces.Addable)

Implements frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable >.

References multiply().

Here is the call graph for this function:

◆ resolve() [1/2]

Hypercube< AddableInteger, U > frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace >.resolve ( )

See also: UtilitySolutionSpace.resolve()

Implements frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable >.

References resolve().

Referenced by joinMinNCCCs(), resolve(), and toHypercube().

Here is the call graph for this function:

◆ resolve() [2/2]

Hypercube< AddableInteger, U > frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace >.resolve ( boolean sparse )

See also: UtilitySolutionSpace.resolve(boolean)

Implements frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable >.

References getNumberOfSolutions(), and sparseIter().

Here is the call graph for this function:

◆ sample()

Map< AddableInteger, Double > frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace >.sample ( int nbrSamples )

See also: frodo2.solutionSpaces.UtilitySolutionSpace.sample(int)

Todo: Auto-generated method stub

Implements frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable >.

◆ setDefaultUtility()

void frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace >.setDefaultUtility ( U utility )

See also: frodo2.solutionSpaces.BasicUtilitySolutionSpace.setDefaultUtility(java.io.Serializable)

Todo: Auto-generated method stub

◆ setDomain()

void frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >.setDomain	(	String	var,
		AddableInteger[]	dom )

See also: SolutionSpace.setDomain(java.lang.String, Addable[])

Todo: Auto-generated method stub

◆ setInfeasibleUtility()

void frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace >.setInfeasibleUtility ( U utility )

See also: BasicUtilitySolutionSpace.setInfeasibleUtility(java.io.Serializable)

◆ setName()

void frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace >.setName ( String name )

See also: SolutionSpace.setName(java.lang.String)

References name.

◆ setOwner()

void frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace >.setOwner ( String owner )

See also: SolutionSpace.setOwner(java.lang.String)

References owner.

◆ setProblem()

void frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace >.setProblem ( ProblemInterface< AddableInteger, ?> problem )

See also: UtilitySolutionSpace#setProblem(ProblemInterface)

References problem.

Referenced by frodo2.solutionSpaces.vehiclerouting.CompoundSpace >.setProblem().

◆ setRelationName()

void frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace >.setRelationName ( String name )

See also: frodo2.solutionSpaces.SolutionSpace.setRelationName(java.lang.String)

Todo: Auto-generated method stub

References name.

◆ setUtility() [1/2]

boolean frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >.setUtility	(	AddableInteger[]	variablesValues,
		U	utility )

See also: BasicUtilitySolutionSpace.setUtility(Addable[], java.io.Serializable)

Todo: Auto-generated method stub

◆ setUtility() [2/2]

void frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >.setUtility	(	long	index,
		U	utility )

See also: BasicUtilitySolutionSpace.setUtility(long, java.io.Serializable)

Todo: Auto-generated method stub

◆ slice() [1/5]

UtilitySolutionSpace< AddableInteger, U > frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace >.slice ( AddableInteger[] variablesValues )

See also: UtilitySolutionSpace#slice(Addable[])

Todo: Auto-generated method stub

◆ slice() [2/5]

UtilitySolutionSpace< AddableInteger, U > frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >.slice	(	String	var,
		AddableInteger	val )

See also: frodo2.solutionSpaces.UtilitySolutionSpace.slice(java.lang.String, frodo2.solutionSpaces.Addable)

Todo: Auto-generated method stub

◆ slice() [3/5]

UtilitySolutionSpace< AddableInteger, U > frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >.slice	(	String	var,
		AddableInteger[]	subDomain )

See also: UtilitySolutionSpace.slice(java.lang.String, Addable[])

Todo: Auto-generated method stub

◆ slice() [4/5]

UtilitySolutionSpace< AddableInteger, U > frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >.slice	(	String[]	varNames,
		AddableInteger[]	values )

See also: UtilitySolutionSpace.slice(java.lang.String[], Addable[])

References doms, and slice().

Here is the call graph for this function:

◆ slice() [5/5]

UtilitySolutionSpace< AddableInteger, U > frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >.slice	(	String[]	varNames,
		AddableInteger	subDomains[][] )

See also: UtilitySolutionSpace.slice(java.lang.String[], Addable[][])

Todo: Check also when split deliveries are allowed

References frodo2.solutionSpaces.vehiclerouting.Customer.angles, frodo2.solutionSpaces.vehiclerouting.Customer.clone(), clone(), frodo2.solutionSpaces.vehiclerouting.Customer.demand, frodo2.solutionSpaces.AddableInteger.equals(), getDomain(), getUtility(), frodo2.solutionSpaces.AddableInteger.intValue(), frodo2.java, newInstance(), one, VehicleRoutingSpace(), and zero.

Referenced by slice().

Here is the call graph for this function:

◆ sparseIter() [1/4]

VRPiterator frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace >.sparseIter ( )

See also: BasicUtilitySolutionSpace.sparseIter()

Implements frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable >.

References getDomains().

Referenced by frodo2.benchmarks.vehiclerouting.CordeauToXCSP.createXCSP(), resolve(), and sparseIter().

Here is the call graph for this function:

◆ sparseIter() [2/4]

VRPiterator frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace >.sparseIter ( String[] order )

See also: SolutionSpace.sparseIter(java.lang.String[])

Implements frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable >.

References getDomains(), and sparseIter().

Here is the call graph for this function:

◆ sparseIter() [3/4]

VRPiterator frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >.sparseIter	(	String[]	variables,
		AddableInteger	domains[][] )

See also: BasicUtilitySolutionSpace.sparseIter(java.lang.String[], Addable[][])

◆ sparseIter() [4/4]

SparseIterator< AddableInteger, U > frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >.sparseIter	(	String[]	variables,
		AddableInteger	domains[][],
		AddableInteger[]	assignment )

See also: UtilitySolutionSpace.sparseIter(java.lang.String[], Addable[][], Addable[])

Todo: Improve by making use of assignments

◆ split()

UtilitySolutionSpace< AddableInteger, U > frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >.split	(	U	threshold,
		boolean	maximum )