FRODO Version 2.19.1
An open-source framework for Distributed Constraint Optimization (DCOP)
Loading...
Searching...
No Matches
frodo2.algorithms.duct.DUCTSolution< V extends Addable< V > > Class Template Reference

Solution class for the family of DUCT algorithms. More...

Inheritance diagram for frodo2.algorithms.duct.DUCTSolution< V extends Addable< V > >:

Public Member Functions

 DUCTSolution (int nbrVars, AddableReal reportedUtil, AddableReal trueUtil, AddableReal finalBound, Map< String, V > assignments, int nbrMsgs, long totalMsgSize, long maxMsgSize, long ncccCount, long timeNeeded, HashMap< String, Long > moduleEndTimes)
 Constructor.
 DUCTSolution (int nbrVariables, AddableReal reportedUtil, AddableReal trueUtil, AddableReal finalBound, Map< String, V > assignments, int nbrMsgs, long totalMsgSize, long maxMsgSize, long ncccCount, long timeNeeded, HashMap< String, Long > moduleEndTimes, int numberOfCoordinationConstraints)
 Constructor.
 DUCTSolution (int nbrVariables, AddableReal reportedUtil, AddableReal trueUtil, AddableReal finalBound, Map< String, V > assignments, int nbrMsgs, long totalMsgSize, long maxMsgSize, long ncccCount, long timeNeeded, HashMap< String, Long > moduleEndTimes, int numberOfCoordinationConstraints, int treeWidth)
 Constructor.
 DUCTSolution (int nbrVars, AddableReal reportedUtil, AddableReal trueUtil, AddableReal finalBound, 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.
 DUCTSolution (int nbrVariables, AddableReal reportedUtil, AddableReal trueUtil, AddableReal finalBound, 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.
 DUCTSolution (int nbrVariables, AddableReal reportedUtil, AddableReal trueUtil, AddableReal finalBound, 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.
 DUCTSolution (int nbrVariables, AddableReal reportedUtil, AddableReal trueUtil, AddableReal finalBound, 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 cumulativeTime, HashMap< String, Long > moduleEndTimes, int treeWidth, int numberOfCoordinationConstraints)
 Constructor.
AddableReal getFinalBound ()
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.
getReportedUtil ()
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

AddableReal finalBound
 The final bound on the solution quality.

Additional Inherited Members

Protected Attributes inherited from frodo2.algorithms.Solution< V, U >
reportedUtil
 The reported utility of the solution.
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

Solution class for the family of DUCT algorithms.

Author
brammertottens
Parameters
<V>type used for domain values

Constructor & Destructor Documentation

◆ DUCTSolution() [1/7]

frodo2.algorithms.duct.DUCTSolution< V extends Addable< V > >.DUCTSolution ( int nbrVars,
AddableReal reportedUtil,
AddableReal trueUtil,
AddableReal finalBound,
Map< String, V > assignments,
int nbrMsgs,
long totalMsgSize,
long maxMsgSize,
long ncccCount,
long timeNeeded,
HashMap< String, Long > moduleEndTimes )

Constructor.

Parameters
nbrVarsthe number of variables in the problem
reportedUtilthe reported optimal utility
trueUtilthe true optimal utility
finalBoundthe final bound on the solution quality
assignmentsthe optimal assignments
nbrMsgsThe total number of messages sent
totalMsgSizeThe total message size
maxMsgSizethe size (in bytes) of the largest message
ncccCountthe ncccs used
timeNeededthe time needed to solve the problem
moduleEndTimeseach module's end time

References frodo2.algorithms.Solution< V, U >.assignments, finalBound, frodo2.algorithms.Solution< V, U >.maxMsgSize, frodo2.algorithms.Solution< V, U >.moduleEndTimes, frodo2.algorithms.Solution< V, U >.nbrMsgs, frodo2.algorithms.Solution< V, U >.ncccCount, 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.

◆ DUCTSolution() [2/7]

frodo2.algorithms.duct.DUCTSolution< V extends Addable< V > >.DUCTSolution ( int nbrVariables,
AddableReal reportedUtil,
AddableReal trueUtil,
AddableReal finalBound,
Map< String, V > assignments,
int nbrMsgs,
long totalMsgSize,
long maxMsgSize,
long ncccCount,
long timeNeeded,
HashMap< String, Long > moduleEndTimes,
int numberOfCoordinationConstraints )

Constructor.

Parameters
nbrVariablesthe total number of variables in the problem
reportedUtilthe reported optimal utility
trueUtilthe true optimal utility
finalBoundthe final bound on the solution quality
assignmentsthe optimal assignments
nbrMsgsThe total number of messages sent
totalMsgSizeThe total message size
maxMsgSizethe size (in bytes) of the largest message
ncccCountthe ncccs used
timeNeededthe time needed to solve the problem
moduleEndTimeseach module's end time
numberOfCoordinationConstraintsthe number of constraints that contain variables that are owned by different agents

References frodo2.algorithms.Solution< V, U >.assignments, finalBound, frodo2.algorithms.Solution< V, U >.maxMsgSize, frodo2.algorithms.Solution< V, U >.moduleEndTimes, 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.

◆ DUCTSolution() [3/7]

frodo2.algorithms.duct.DUCTSolution< V extends Addable< V > >.DUCTSolution ( int nbrVariables,
AddableReal reportedUtil,
AddableReal trueUtil,
AddableReal finalBound,
Map< String, V > assignments,
int nbrMsgs,
long totalMsgSize,
long maxMsgSize,
long ncccCount,
long timeNeeded,
HashMap< String, Long > moduleEndTimes,
int numberOfCoordinationConstraints,
int treeWidth )

Constructor.

Parameters
nbrVariablesthe total number of variables in the problem
reportedUtilthe reported optimal utility
trueUtilthe true optimal utility
finalBoundthe final bound on the solution quality
assignmentsthe optimal assignments
nbrMsgsThe total number of messages sent
totalMsgSizeThe total message size
maxMsgSizethe size (in bytes) of the largest message
ncccCountthe ncccs used
timeNeededthe time needed to solve the problem
moduleEndTimeseach module's end time
numberOfCoordinationConstraintsthe number of constraints that contain variables that are owned by different agents
treeWidththe width of the tree on which the algorithm has run

References frodo2.algorithms.Solution< V, U >.assignments, finalBound, frodo2.algorithms.Solution< V, U >.maxMsgSize, frodo2.algorithms.Solution< V, U >.moduleEndTimes, 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, frodo2.algorithms.Solution< V, U >.treeWidth, and frodo2.algorithms.Solution< V, U >.trueUtil.

◆ DUCTSolution() [4/7]

frodo2.algorithms.duct.DUCTSolution< V extends Addable< V > >.DUCTSolution ( int nbrVars,
AddableReal reportedUtil,
AddableReal trueUtil,
AddableReal finalBound,
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.

Parameters
nbrVarsthe number of variables in the problem
reportedUtilthe reported optimal utility
trueUtilthe true optimal utility
finalBoundthe final bound on the solution quality
assignmentsthe optimal assignments
nbrMsgsThe total number of messages sent
msgsNbrsSentPerAgentthe number of message sent by each agent
msgsNbrsReceivedPerAgentthe number of messages received by each agent
msgNbrsThe number of messages sent per message type
totalMsgSizeThe total message size
msgSizesThe amount of information sent per message type
msgSizesSentPerAgentthe amount of information sent by each agent, in bytes
msgSizesReveivedPerAgentthe amount of information received by each agent, in bytes
maxMsgSizethe size (in bytes) of the largest message
maxMsgSizesfor each message type, the size (in bytes) of the largest message of that type
ncccCountthe ncccs used
timeNeededthe time needed to solve the problem
moduleEndTimeseach module's end time

References frodo2.algorithms.Solution< V, U >.assignments, finalBound, 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 >.reportedUtil, frodo2.algorithms.Solution< V, U >.timeNeeded, frodo2.algorithms.Solution< V, U >.totalMsgSize, and frodo2.algorithms.Solution< V, U >.trueUtil.

◆ DUCTSolution() [5/7]

frodo2.algorithms.duct.DUCTSolution< V extends Addable< V > >.DUCTSolution ( int nbrVariables,
AddableReal reportedUtil,
AddableReal trueUtil,
AddableReal finalBound,
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.

Parameters
nbrVariablesthe total number of variables in the problem
reportedUtilthe reported optimal utility
trueUtilthe true optimal utility
finalBoundthe final bound on the solution quality
assignmentsthe optimal assignments
nbrMsgsThe total number of messages sent
msgNbrsThe number of messages sent per message type
msgsNbrsSentPerAgentthe number of message sent by each agent
msgsNbrsReceivedPerAgentthe number of messages received by each agent
totalMsgSizeThe total message size
msgSizesThe amount of information sent per message type
msgSizesSentPerAgentthe amount of information sent by each agent, in bytes
msgSizesReveivedPerAgentthe amount of information received by each agent, in bytes
maxMsgSizethe size (in bytes) of the largest message
maxMsgSizesfor each message type, the size (in bytes) of the largest message of that type
ncccCountthe ncccs used
timeNeededthe time needed to solve the problem
moduleEndTimeseach module's end time
numberOfCoordinationConstraintsthe number of constraints that contain variables that are owned by different agents

References frodo2.algorithms.Solution< V, U >.assignments, finalBound, 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.

◆ DUCTSolution() [6/7]

frodo2.algorithms.duct.DUCTSolution< V extends Addable< V > >.DUCTSolution ( int nbrVariables,
AddableReal reportedUtil,
AddableReal trueUtil,
AddableReal finalBound,
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.

Parameters
nbrVariablesthe total number of variables in the problem
reportedUtilthe reported optimal utility
trueUtilthe true optimal utility
finalBoundthe final bound on the solution quality
assignmentsthe optimal assignments
nbrMsgsThe total number of messages sent
msgNbrsThe number of messages sent per message type
msgsNbrsSentPerAgentthe number of message sent by each agent
msgsNbrsReceivedPerAgentthe number of messages received by each agent
totalMsgSizeThe total message size
msgSizesThe amount of information sent per message type
msgSizesSentPerAgentthe amount of information sent by each agent, in bytes
msgSizesReveivedPerAgentthe amount of information received by each agent, in bytes
maxMsgSizethe size (in bytes) of the largest message
maxMsgSizesfor each message type, the size (in bytes) of the largest message of that type
ncccCountthe ncccs used
timeNeededthe time needed to solve the problem
moduleEndTimeseach module's end time
treeWidththe width of the tree on which the algorithm has run
numberOfCoordinationConstraintsthe number of constraints that contain variables that are owned by different agents

References frodo2.algorithms.Solution< V, U >.assignments, finalBound, 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, frodo2.algorithms.Solution< V, U >.treeWidth, and frodo2.algorithms.Solution< V, U >.trueUtil.

◆ DUCTSolution() [7/7]

frodo2.algorithms.duct.DUCTSolution< V extends Addable< V > >.DUCTSolution ( int nbrVariables,
AddableReal reportedUtil,
AddableReal trueUtil,
AddableReal finalBound,
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 cumulativeTime,
HashMap< String, Long > moduleEndTimes,
int treeWidth,
int numberOfCoordinationConstraints )

Constructor.

Parameters
nbrVariablesthe total number of variables in the problem
reportedUtilthe reported optimal utility
trueUtilthe true optimal utility
finalBoundthe final bound on the solution quality
assignmentsthe optimal assignments
nbrMsgsThe total number of messages sent
msgNbrsThe number of messages sent per message type
msgsNbrsSentPerAgentthe number of message sent by each agent
msgsNbrsReceivedPerAgentthe number of messages received by each agent
totalMsgSizeThe total message size
msgSizesThe amount of information sent per message type
msgSizesSentPerAgentthe amount of information sent by each agent, in bytes
msgSizesReveivedPerAgentthe amount of information received by each agent, in bytes
maxMsgSizethe size (in bytes) of the largest message
maxMsgSizesfor each message type, the size (in bytes) of the largest message of that type
ncccCountthe ncccs used
timeNeededthe time needed to solve the problem
cumulativeTimethe cumulative time needed by all the agents to terminate
moduleEndTimeseach module's end time
treeWidththe width of the tree on which the algorithm has run
numberOfCoordinationConstraintsthe number of constraints that contain variables that are owned by different agents

References frodo2.algorithms.Solution< V, U >.assignments, frodo2.algorithms.Solution< V, U >.cumulativeTime, finalBound, 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, frodo2.algorithms.Solution< V, U >.treeWidth, and frodo2.algorithms.Solution< V, U >.trueUtil.

Member Function Documentation

◆ getFinalBound()

AddableReal frodo2.algorithms.duct.DUCTSolution< V extends Addable< V > >.getFinalBound ( )
Author
Brammert Ottens, Dec 29, 2011
Returns
the final bound on the solution quality

Referenced by frodo2.algorithms.duct.DUCTsolver< V extends Addable< V > >.plotStats().

◆ toString()

String frodo2.algorithms.duct.DUCTSolution< V extends Addable< V > >.toString ( )
See also
java.lang.Object#toString()

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

Member Data Documentation

◆ finalBound

AddableReal frodo2.algorithms.duct.DUCTSolution< V extends Addable< V > >.finalBound
package

The final bound on the solution quality.

Referenced by DUCTSolution(), DUCTSolution(), DUCTSolution(), DUCTSolution(), DUCTSolution(), DUCTSolution(), and DUCTSolution().


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