An optimal solution to the problem. More...

Inheritance diagram for frodo2.algorithms.asodpop.ASODPOPsolution< V extends Addable< V >, U >:

[legend]

Public Member Functions
	ASODPOPsolution (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 numberOfCoordinationConstraint, HashMap< String, ArrayList< CurrentAssignment< V > > > assignmentHistories, double averageTreeFillPercentage, int treeWidth, double dummyFillPercentage, double numberOfDummies, int specUTILmsgs, int totalUTILmsgs)
	Constructor.
HashMap< String, ArrayList< CurrentAssignment< V > > >	getAssignmentHistories ()
int	getSpecUTILmsgs ()
int	getUTILmsgs ()
Public Member Functions inherited from 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.
	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 ()

Package Attributes
int	specUILmsgs
	The total number of speculative UTIL messages that have been sent.
int	totalUTILmsgs
	The total number of UTIL messages that have been sent.

Private Attributes
HashMap< String, ArrayList< CurrentAssignment< V > > >	assignmentHistories
	The assignment history for all the agents.

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

◆ ASODPOPsolution()

frodo2.algorithms.asodpop.ASODPOPsolution< V extends Addable< V >, U >.ASODPOPsolution	(	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	numberOfCoordinationConstraint,
		HashMap< String, ArrayList< CurrentAssignment< V > > >	assignmentHistories,
		double	averageTreeFillPercentage,
		int	treeWidth,
		double	dummyFillPercentage,
		double	numberOfDummies,
		int	specUTILmsgs,
		int	totalUTILmsgs )

Constructor.

Parameters

nbrVariables	the total number of variables occuring in the problem
reportedUtil	the reported optimal utility
trueUtil	the true optimal utility
assignments	the optimal assignments
nbrMsgs	the total number of messages that have been sent
msgNbrs	the number of messages per message type
totalMsgSize	the total amount of information that has been exchanged (in bytes)
msgSizes	the amount of information 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
numberOfCoordinationConstraint	the number of constraints that contain variables that are owned by different agents
assignmentHistories	the history of variable assignments
averageTreeFillPercentage	the average percentage of the tree filled
treeWidth	the tree width of the DFS tree
dummyFillPercentage	the average dummy fill percentage
numberOfDummies	the total number of dummies
specUTILmsgs	the total number of speculative UTIL messages that have been sent
totalUTILmsgs	the total number of UTIL messages that have been sent

Member Function Documentation

◆ getAssignmentHistories()

HashMap< String, ArrayList< CurrentAssignment< V > > > frodo2.algorithms.asodpop.ASODPOPsolution< V extends Addable< V >, U >.getAssignmentHistories ( )

Returns: the history of variable assignments

Implements frodo2.algorithms.ConvergenceInterface< V extends Addable< V > >.

References assignmentHistories.

◆ getSpecUTILmsgs()

int frodo2.algorithms.asodpop.ASODPOPsolution< V extends Addable< V >, U >.getSpecUTILmsgs ( )

Returns: the total number of speculative UTIL messages that have been sent

◆ getUTILmsgs()

int frodo2.algorithms.asodpop.ASODPOPsolution< V extends Addable< V >, U >.getUTILmsgs ( )

Returns: the total number of UTIL messages that have been sent

Member Data Documentation

◆ assignmentHistories

HashMap<String, ArrayList<CurrentAssignment<V> > > frodo2.algorithms.asodpop.ASODPOPsolution< V extends Addable< V >, U >.assignmentHistories

private

The assignment history for all the agents.

Referenced by ASODPOPsolution(), and getAssignmentHistories().

◆ specUILmsgs

int frodo2.algorithms.asodpop.ASODPOPsolution< V extends Addable< V >, U >.specUILmsgs

package

The total number of speculative UTIL messages that have been sent.

◆ totalUTILmsgs

int frodo2.algorithms.asodpop.ASODPOPsolution< V extends Addable< V >, U >.totalUTILmsgs

package

The total number of UTIL messages that have been sent.

Referenced by ASODPOPsolution().

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

src/frodo2/algorithms/asodpop/ASODPOPsolution.java

Public Member Functions

Package Attributes

Private Attributes

Additional Inherited Members