forked from google/or-tools
-
Notifications
You must be signed in to change notification settings - Fork 9
/
AssignmentLinearSumAssignment.java
75 lines (67 loc) · 2.37 KB
/
AssignmentLinearSumAssignment.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
// Copyright 2010-2024 Google LLC
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
// [START program]
package com.google.ortools.graph.samples;
// [START import]
import com.google.ortools.Loader;
import com.google.ortools.graph.LinearSumAssignment;
import java.util.stream.IntStream;
// [END import]
/** Minimal Linear Sum Assignment problem. */
public class AssignmentLinearSumAssignment {
public static void main(String[] args) {
Loader.loadNativeLibraries();
// [START solver]
LinearSumAssignment assignment = new LinearSumAssignment();
// [END solver]
// [START data]
final int[][] costs = {
{90, 76, 75, 70},
{35, 85, 55, 65},
{125, 95, 90, 105},
{45, 110, 95, 115},
};
final int numWorkers = 4;
final int numTasks = 4;
final int[] allWorkers = IntStream.range(0, numWorkers).toArray();
final int[] allTasks = IntStream.range(0, numTasks).toArray();
// [END data]
// [START constraints]
// Add each arc.
for (int w : allWorkers) {
for (int t : allTasks) {
if (costs[w][t] != 0) {
assignment.addArcWithCost(w, t, costs[w][t]);
}
}
}
// [END constraints]
// [START solve]
LinearSumAssignment.Status status = assignment.solve();
// [END solve]
// [START print_solution]
if (status == LinearSumAssignment.Status.OPTIMAL) {
System.out.println("Total cost: " + assignment.getOptimalCost());
for (int worker : allWorkers) {
System.out.println("Worker " + worker + " assigned to task "
+ assignment.getRightMate(worker) + ". Cost: " + assignment.getAssignmentCost(worker));
}
} else {
System.out.println("Solving the min cost flow problem failed.");
System.out.println("Solver status: " + status);
}
// [END print_solution]
}
private AssignmentLinearSumAssignment() {}
}
// [END program]