frodo2.algorithms.odpop.ODPOPsolution< V, U > Class Template Reference

An optimal solution to the problem. More...

Inheritance diagram for frodo2.algorithms.odpop.ODPOPsolution< V, U >:

Public Member Functions
	ODPOPsolution (int nbrVariables, U reportedUtil, U trueUtil, Map< String, V > assignments, int nbrMsgs, TreeMap< MessageType, Integer > msgNbrs, long totalMsgSize, TreeMap< MessageType, Long > msgSizes, long maxMsgSize, TreeMap< MessageType, Long > maxMsgSizes, long ncccCount, long timeNeeded, HashMap< String, Long > moduleEndTimes, int numberOfCoordinationConstraints, double averageTreeFillPercentage)
	Constructor.
	ODPOPsolution (int nbrVariables, U reportedUtil, U trueUtil, Map< String, V > assignments, int nbrMsgs, TreeMap< MessageType, Integer > msgNbrs, long totalMsgSize, TreeMap< MessageType, Long > msgSizes, long maxMsgSize, TreeMap< MessageType, Long > maxMsgSizes, long ncccCount, long timeNeeded, HashMap< String, Long > moduleEndTimes, int numberOfCoordinationConstraints, double averageTreeFillPercentage, double percentageOfGoodsSent, U maximalCutSum)
	Constructor.
	ODPOPsolution (int nbrVariables, U reportedUtil, U trueUtil, Map< String, V > assignments, int nbrMsgs, TreeMap< MessageType, Integer > msgNbrs, long totalMsgSize, TreeMap< MessageType, Long > msgSizes, long maxMsgSize, TreeMap< MessageType, Long > maxMsgSizes, long ncccCount, long timeNeeded, HashMap< String, Long > moduleEndTimes, int numberOfCoordinationConstraints, double averageTreeFillPercentage, double percentageOfGoodsSent, int treeWidth, double dummyFillPercentage, double numberOfDummies, U maximalCutSum)
	Constructor.
double	getAverageFillTree ()
double	getAverageDummyFillPercentage ()
double	getAverageNumberOfDummies ()
double	getPercentageOfGoodsSent ()
U	getMaximalCutSum ()
String	toString ()
Public Member Functions inherited from frodo2.algorithms.Solution< V, U >
	Solution (U reportedUtil, U trueUtil, Map< String, V > assignments, int nbrMsgs, long totalMsgSize, long maxMsgSize, long ncccCount, long timeNeeded, HashMap< String, Long > moduleEndTimes)
	Constructor.
	Solution (int nbrVariables, U reportedUtil, U trueUtil, Map< String, V > assignments, int nbrMsgs, long totalMsgSize, long maxMsgSize, long ncccCount, long timeNeeded, HashMap< String, Long > moduleEndTimes, int numberOfCoordinationConstraints)
	Constructor.
	Solution (int nbrVariables, U reportedUtil, U trueUtil, Map< String, V > assignments, int nbrMsgs, long totalMsgSize, long maxMsgSize, long ncccCount, long timeNeeded, HashMap< String, Long > moduleEndTimes, int numberOfCoordinationConstraints, int treeWidth)
	Constructor.
	Solution (U reportedUtil, U trueUtil, Map< String, V > assignments, int nbrMsgs, TreeMap< MessageType, Integer > msgNbrs, TreeMap< Object, Integer > msgsNbrsSentPerAgent, TreeMap< Object, Integer > msgsNbrsReceivedPerAgent, long totalMsgSize, TreeMap< MessageType, Long > msgSizes, TreeMap< Object, Long > msgSizesSentPerAgent, TreeMap< Object, Long > msgSizesReveivedPerAgent, long maxMsgSize, TreeMap< MessageType, Long > maxMsgSizes, long ncccCount, long timeNeeded, HashMap< String, Long > moduleEndTimes)
	Constructor.
	Solution (int nbrVariables, U reportedUtil, U trueUtil, Map< String, V > assignments, int nbrMsgs, TreeMap< MessageType, Integer > msgNbrs, TreeMap< Object, Integer > msgsNbrsSentPerAgent, TreeMap< Object, Integer > msgsNbrsReceivedPerAgent, long totalMsgSize, TreeMap< MessageType, Long > msgSizes, TreeMap< Object, Long > msgSizesSentPerAgent, TreeMap< Object, Long > msgSizesReveivedPerAgent, long maxMsgSize, TreeMap< MessageType, Long > maxMsgSizes, long ncccCount, long timeNeeded, HashMap< String, Long > moduleEndTimes, int numberOfCoordinationConstraints)
	Constructor.
	Solution (int nbrVariables, U reportedUtil, U trueUtil, Map< String, V > assignments, int nbrMsgs, TreeMap< MessageType, Integer > msgNbrs, TreeMap< Object, Integer > msgsNbrsSentPerAgent, TreeMap< Object, Integer > msgsNbrsReceivedPerAgent, long totalMsgSize, TreeMap< MessageType, Long > msgSizes, TreeMap< Object, Long > msgSizesSentPerAgent, TreeMap< Object, Long > msgSizesReveivedPerAgent, long maxMsgSize, TreeMap< MessageType, Long > maxMsgSizes, long ncccCount, long timeNeeded, HashMap< String, Long > moduleEndTimes, int treeWidth, int numberOfCoordinationConstraints)
	Constructor.
	Solution (int nbrVariables, U reportedUtil, U trueUtil, Map< String, V > assignments, int nbrMsgs, TreeMap< MessageType, Integer > msgNbrs, TreeMap< Object, Integer > msgsNbrsSentPerAgent, TreeMap< Object, Integer > msgsNbrsReceivedPerAgent, long totalMsgSize, TreeMap< MessageType, Long > msgSizes, TreeMap< Object, Long > msgSizesSentPerAgent, TreeMap< Object, Long > msgSizesReveivedPerAgent, long maxMsgSize, TreeMap< MessageType, Long > maxMsgSizes, long ncccCount, long timeNeeded, long cumulativelTime, HashMap< String, Long > moduleEndTimes, int treeWidth, int numberOfCoordinationConstraints)
	Constructor.
U	getReportedUtil ()
U	getUtility ()
void	setUtility (U util)
	Sets the utility.
Map< String, V >	getAssignments ()
long	getNcccCount ()
int	getNbrMsgs ()
void	setNbrMsgs (int nbrMsgsNew)
	Sets the total number of messages.
long	getTotalMsgSize ()
long	getMaxMsgSize ()
void	setTotalMsgSize (long totalMsgSizeNew)
	Sets the total amount of information exchanged.
long	getTimeNeeded ()
long	getTotalTime ()
void	setTimeNeeded (long timeNeededNew)
	Sets the total runtime.
HashMap< String, Long >	getTimesNeeded ()
TreeMap< MessageType, Long >	getMsgSizes ()
TreeMap< MessageType, Long >	getMaxMsgSizes ()
TreeMap< MessageType, Integer >	getMsgNbrs ()
int	getTreeWidth ()
int	getNumberOfCoordinationConstraints ()
int	getNbrVariables ()
String	toLineString ()

Private Attributes
double	percentageOfGoodsSent
	The percentage of the total number of possible goods that has been sent.
double	averageTreeFillPercentage
	The average percentage of the the separatorSpace being filled.
double	dummyFillPercentage
	The average percentage of the tree filled with dummy nodes.
double	numberOfDummies
	The absolute number of dummy nodes in the tree.
U	maximalCutSum
	The maximal value with which a utility value has been cut.

Additional Inherited Members
Protected Attributes inherited from frodo2.algorithms.Solution< V, U >
U	reportedUtil
	The reported utility of the solution.
U	trueUtil
	The true utility of the solution.
Map< String, V >	assignments
	For each variable, its assignment in the solution found to the problem.
long	ncccCount
	The number of ncccs used.
long	timeNeeded
	The time needed to solve the problem.
long	cumulativeTime
	The cumulative time needed for all agents to find a solution.
HashMap< String, Long >	moduleEndTimes
	For each module in the algorithm, the time at which it finished.
int	nbrMsgs
	The number of messages sent by the algorithm.
long	totalMsgSize
	The total amount of information sent by the algorithm (in bytes).
long	maxMsgSize
	The size (in bytes) of the largest message.
TreeMap< MessageType, Integer >	msgNbrs
	The total number of messages that has been sent per message type.
TreeMap< MessageType, Long >	msgSizes
	The total amount of information that has been sent per message type.
TreeMap< MessageType, Long >	maxMsgSizes
	For each message type, the size (in bytes) of the largest message of that type.
int	treeWidth = -1
	The tree width of the tree on which the algorithm has run.

Detailed Description

An optimal solution to the problem.

Parameters

<V>	type used for variable values
<U>	type used for utility values

Author

Brammert Ottens, Thomas Leaute

Constructor & Destructor Documentation

ODPOPsolution() [1/3]

frodo2.algorithms.odpop.ODPOPsolution< V, U >.ODPOPsolution	(	int	nbrVariables,
		U	reportedUtil,
		U	trueUtil,
		Map< String, V >	assignments,
		int	nbrMsgs,
		TreeMap< MessageType, Integer >	msgNbrs,
		long	totalMsgSize,
		TreeMap< MessageType, Long >	msgSizes,
		long	maxMsgSize,
		TreeMap< MessageType, Long >	maxMsgSizes,
		long	ncccCount,
		long	timeNeeded,
		HashMap< String, Long >	moduleEndTimes,
		int	numberOfCoordinationConstraints,
		double	averageTreeFillPercentage )

Constructor.

Parameters

nbrVariables	the total number of variables occurring in the problem
reportedUtil	the reported optimal utility
trueUtil	the true optimal utility
assignments	the optimal assignments
nbrMsgs	The total number of messages sent
msgNbrs	The number of messages sent per message type
totalMsgSize	The total message size
msgSizes	The amount of information sent per message type
maxMsgSize	the size (in bytes) of the largest message
maxMsgSizes	for each message type, the size (in bytes) of the largest message of that type
ncccCount	the ncccs used
timeNeeded	the time needed to solve the problem
moduleEndTimes	each module's end time
numberOfCoordinationConstraints	the number of constraints that contain variables that are owned by different agents
averageTreeFillPercentage	the average percentage of the solutionspaces that are filled

References frodo2.algorithms.Solution< V, U >.assignments, averageTreeFillPercentage, frodo2.algorithms.Solution< V, U >.maxMsgSize, frodo2.algorithms.Solution< V, U >.maxMsgSizes, frodo2.algorithms.Solution< V, U >.moduleEndTimes, frodo2.algorithms.Solution< V, U >.msgNbrs, frodo2.algorithms.Solution< V, U >.msgSizes, frodo2.algorithms.Solution< V, U >.nbrMsgs, frodo2.algorithms.Solution< V, U >.ncccCount, frodo2.algorithms.Solution< V, U >.numberOfCoordinationConstraints, frodo2.algorithms.Solution< V, U >.reportedUtil, frodo2.algorithms.Solution< V, U >.timeNeeded, frodo2.algorithms.Solution< V, U >.totalMsgSize, and frodo2.algorithms.Solution< V, U >.trueUtil.

ODPOPsolution() [2/3]

frodo2.algorithms.odpop.ODPOPsolution< V, U >.ODPOPsolution	(	int	nbrVariables,
		U	reportedUtil,
		U	trueUtil,
		Map< String, V >	assignments,
		int	nbrMsgs,
		TreeMap< MessageType, Integer >	msgNbrs,
		long	totalMsgSize,
		TreeMap< MessageType, Long >	msgSizes,
		long	maxMsgSize,
		TreeMap< MessageType, Long >	maxMsgSizes,
		long	ncccCount,
		long	timeNeeded,
		HashMap< String, Long >	moduleEndTimes,
		int	numberOfCoordinationConstraints,
		double	averageTreeFillPercentage,
		double	percentageOfGoodsSent,
		U	maximalCutSum )

Constructor.

Parameters

nbrVariables	the total number of variables occurring in the problem
reportedUtil	the reported optimal utility
trueUtil	the true optimal utility
assignments	the optimal assignments
nbrMsgs	The total number of messages sent
msgNbrs	The number of messages sent per message type
totalMsgSize	The total message size
msgSizes	The amount of information sent per message type
maxMsgSize	the size (in bytes) of the largest message
maxMsgSizes	for each message type, the size (in bytes) of the largest message of that type
ncccCount	the ncccs used
timeNeeded	the time needed to solve the problem
moduleEndTimes	each module's end time
numberOfCoordinationConstraints	the number of constraints that contain variables that are owned by different agents
averageTreeFillPercentage	the average percentage of the solutionspaces that are filled
percentageOfGoodsSent	the percentage of possible goods that have been sent
maximalCutSum	The maximal value with which a utility value has been cut

References frodo2.algorithms.Solution< V, U >.assignments, averageTreeFillPercentage, maximalCutSum, frodo2.algorithms.Solution< V, U >.maxMsgSize, frodo2.algorithms.Solution< V, U >.maxMsgSizes, frodo2.algorithms.Solution< V, U >.moduleEndTimes, frodo2.algorithms.Solution< V, U >.msgNbrs, frodo2.algorithms.Solution< V, U >.msgSizes, frodo2.algorithms.Solution< V, U >.nbrMsgs, frodo2.algorithms.Solution< V, U >.ncccCount, frodo2.algorithms.Solution< V, U >.numberOfCoordinationConstraints, percentageOfGoodsSent, frodo2.algorithms.Solution< V, U >.reportedUtil, frodo2.algorithms.Solution< V, U >.timeNeeded, frodo2.algorithms.Solution< V, U >.totalMsgSize, and frodo2.algorithms.Solution< V, U >.trueUtil.

ODPOPsolution() [3/3]

frodo2.algorithms.odpop.ODPOPsolution< V, U >.ODPOPsolution	(	int	nbrVariables,
		U	reportedUtil,
		U	trueUtil,
		Map< String, V >	assignments,
		int	nbrMsgs,
		TreeMap< MessageType, Integer >	msgNbrs,
		long	totalMsgSize,
		TreeMap< MessageType, Long >	msgSizes,
		long	maxMsgSize,
		TreeMap< MessageType, Long >	maxMsgSizes,
		long	ncccCount,
		long	timeNeeded,
		HashMap< String, Long >	moduleEndTimes,
		int	numberOfCoordinationConstraints,
		double	averageTreeFillPercentage,
		double	percentageOfGoodsSent,
		int	treeWidth,
		double	dummyFillPercentage,
		double	numberOfDummies,
		U	maximalCutSum )

Constructor.

Parameters

nbrVariables	the total number of variables occurring in the problem
reportedUtil	the reported optimal utility
trueUtil	the true optimal utility
assignments	the optimal assignments
nbrMsgs	The total number of messages sent
msgNbrs	The number of messages sent per message type
totalMsgSize	The total message size
msgSizes	The amount of information sent per message type
maxMsgSize	the size (in bytes) of the largest message
maxMsgSizes	for each message type, the size (in bytes) of the largest message of that type
ncccCount	the ncccs used
timeNeeded	the time needed to solve the problem
moduleEndTimes	each module's end time
numberOfCoordinationConstraints	the number of constraints that contain variables that are owned by different agents
treeWidth	the width of the tree on which the algorithm has run
averageTreeFillPercentage	the average percentage of the solutionspaces that are filled
dummyFillPercentage	the dummy fill percentage
numberOfDummies	the total number of dummy nodes
percentageOfGoodsSent	the percentage of possible goods that have been sent
maximalCutSum	The maximal value with which a utility value has been cut

References frodo2.algorithms.Solution< V, U >.assignments, averageTreeFillPercentage, dummyFillPercentage, maximalCutSum, frodo2.algorithms.Solution< V, U >.maxMsgSize, frodo2.algorithms.Solution< V, U >.maxMsgSizes, frodo2.algorithms.Solution< V, U >.moduleEndTimes, frodo2.algorithms.Solution< V, U >.msgNbrs, frodo2.algorithms.Solution< V, U >.msgSizes, frodo2.algorithms.Solution< V, U >.nbrMsgs, frodo2.algorithms.Solution< V, U >.ncccCount, frodo2.algorithms.Solution< V, U >.numberOfCoordinationConstraints, numberOfDummies, percentageOfGoodsSent, frodo2.algorithms.Solution< V, U >.reportedUtil, frodo2.algorithms.Solution< V, U >.timeNeeded, frodo2.algorithms.Solution< V, U >.totalMsgSize, frodo2.algorithms.Solution< V, U >.treeWidth, and frodo2.algorithms.Solution< V, U >.trueUtil.

Member Function Documentation

getAverageDummyFillPercentage()

double frodo2.algorithms.odpop.ODPOPsolution< V, U >.getAverageDummyFillPercentage

(

)

Returns

the dummy fill percentage

getAverageFillTree()

double frodo2.algorithms.odpop.ODPOPsolution< V, U >.getAverageFillTree

(

)

Returns

the average fill percentage of the solutionspaces

getAverageNumberOfDummies()

double frodo2.algorithms.odpop.ODPOPsolution< V, U >.getAverageNumberOfDummies

(

)

Returns

the total number of dummy nodes visited

getMaximalCutSum()

U frodo2.algorithms.odpop.ODPOPsolution< V, U >.getMaximalCutSum

(

)

Author

Brammert Ottens, 7 feb. 2011

Returns

the percentage of possible goods that have been sent

getPercentageOfGoodsSent()

double frodo2.algorithms.odpop.ODPOPsolution< V, U >.getPercentageOfGoodsSent

(

)

Author

Brammert Ottens, 7 feb. 2011

Returns

the percentage of possible goods that have been sent

References percentageOfGoodsSent.

toString()

String frodo2.algorithms.odpop.ODPOPsolution< V, U >.toString

(

)

See also

java.lang.Object#toString()

Reimplemented from frodo2.algorithms.Solution< V, U >.

Member Data Documentation

averageTreeFillPercentage

double frodo2.algorithms.odpop.ODPOPsolution< V, U >.averageTreeFillPercentage

private

The average percentage of the the separatorSpace being filled.

Referenced by frodo2.algorithms.asodpop.ASODPOPsolution< V extends Addable< V >, U >.ASODPOPsolution(), ODPOPsolution(), ODPOPsolution(), and ODPOPsolution().

dummyFillPercentage

double frodo2.algorithms.odpop.ODPOPsolution< V, U >.dummyFillPercentage

private

The average percentage of the tree filled with dummy nodes.

Referenced by frodo2.algorithms.asodpop.ASODPOPsolution< V extends Addable< V >, U >.ASODPOPsolution(), and ODPOPsolution().

maximalCutSum

U frodo2.algorithms.odpop.ODPOPsolution< V, U >.maximalCutSum

private

The maximal value with which a utility value has been cut.

Referenced by ODPOPsolution(), and ODPOPsolution().

numberOfDummies

double frodo2.algorithms.odpop.ODPOPsolution< V, U >.numberOfDummies

private

The absolute number of dummy nodes in the tree.

Referenced by frodo2.algorithms.asodpop.ASODPOPsolution< V extends Addable< V >, U >.ASODPOPsolution(), and ODPOPsolution().

percentageOfGoodsSent

double frodo2.algorithms.odpop.ODPOPsolution< V, U >.percentageOfGoodsSent

private

The percentage of the total number of possible goods that has been sent.

Referenced by getPercentageOfGoodsSent(), ODPOPsolution(), and ODPOPsolution().

---

The documentation for this class was generated from the following file:

• src/frodo2/algorithms/odpop/ODPOPsolution.java