Class AgentsTasks
java.lang.Object
topics.branchandbound.utils.BranchAndBound
topics.branchandbound.agents.AgentsTasks
Task Assignment
Evaluates the optimal distribution of N independent tasks among N agents, minimizing the total overall operational cost. It employs a Branch and Bound strategy to systematically prune unfeasible or sub-optimal mathematical assignments.
- Author:
- vicegd
-
Field Summary
Fields inherited from class BranchAndBound
bestNode, globalUpperBound, nodeHeap, rootNode -
Constructor Summary
ConstructorsConstructorDescriptionAgentsTasks(int problemSize, int[][] costMatrix) Initializes the execution tree with the root node. -
Method Summary
Methods inherited from class BranchAndBound
branchAndBound, getBestNode, getRootNode, printSolutionTrace
-
Constructor Details
-
AgentsTasks
public AgentsTasks(int problemSize, int[][] costMatrix) Initializes the execution tree with the root node.- Parameters:
problemSize- The dimension of the symmetric cost matrix.costMatrix- The 2D array representing the cost of assigning task j to agent i.
-