2022-06-17 08:40:20 +02:00
|
|
|
// Copyright 2010-2022 Google LLC
|
2012-01-10 14:16:39 +00:00
|
|
|
// 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.
|
2020-09-11 21:17:23 +02:00
|
|
|
package com.google.ortools.java;
|
2012-01-10 14:16:39 +00:00
|
|
|
|
2020-09-11 21:17:23 +02:00
|
|
|
import com.google.ortools.Loader;
|
2014-07-09 11:26:55 +00:00
|
|
|
import com.google.ortools.graph.LinearSumAssignment;
|
2012-01-10 14:16:39 +00:00
|
|
|
|
|
|
|
|
/**
|
|
|
|
|
* Test assignment on a 4x4 matrix. Example taken from
|
2019-05-06 10:31:03 +02:00
|
|
|
* http://www.ee.oulu.fi/~mpa/matreng/eem1_2-1.htm with kCost[0][1]
|
|
|
|
|
* modified so the optimum solution is unique.
|
2012-01-10 14:16:39 +00:00
|
|
|
*/
|
2019-05-06 10:31:03 +02:00
|
|
|
public class LinearAssignmentAPI {
|
2012-01-10 14:16:39 +00:00
|
|
|
private static void runAssignmentOn4x4Matrix() {
|
|
|
|
|
final int numSources = 4;
|
|
|
|
|
final int numTargets = 4;
|
2018-11-10 23:56:52 +01:00
|
|
|
final int[][] cost = {
|
2019-05-06 10:31:03 +02:00
|
|
|
{90, 76, 75, 80}, {35, 85, 55, 65}, {125, 95, 90, 105}, {45, 110, 95, 115}};
|
2012-01-10 14:16:39 +00:00
|
|
|
final int expectedCost = cost[0][3] + cost[1][2] + cost[2][1] + cost[3][0];
|
|
|
|
|
|
2014-07-09 11:26:55 +00:00
|
|
|
LinearSumAssignment assignment = new LinearSumAssignment();
|
2012-01-10 14:16:39 +00:00
|
|
|
for (int source = 0; source < numSources; ++source) {
|
|
|
|
|
for (int target = 0; target < numTargets; ++target) {
|
2014-07-09 11:26:55 +00:00
|
|
|
assignment.addArcWithCost(source, target, cost[source][target]);
|
2012-01-10 14:16:39 +00:00
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2014-07-09 11:26:55 +00:00
|
|
|
if (assignment.solve() == LinearSumAssignment.Status.OPTIMAL) {
|
2018-11-10 23:56:52 +01:00
|
|
|
System.out.println("Total cost = " + assignment.getOptimalCost() + "/" + expectedCost);
|
2014-07-09 11:26:55 +00:00
|
|
|
for (int node = 0; node < assignment.getNumNodes(); ++node) {
|
2019-05-06 10:31:03 +02:00
|
|
|
System.out.println("Left node " + node + " assigned to right node "
|
|
|
|
|
+ assignment.getRightMate(node) + " with cost " + assignment.getAssignmentCost(node));
|
2014-07-09 11:26:55 +00:00
|
|
|
}
|
2012-01-10 14:16:39 +00:00
|
|
|
} else {
|
2014-07-09 11:26:55 +00:00
|
|
|
System.out.println("No solution found.");
|
2012-01-10 14:16:39 +00:00
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
public static void main(String[] args) throws Exception {
|
2020-09-11 21:17:23 +02:00
|
|
|
Loader.loadNativeLibraries();
|
2012-01-10 14:16:39 +00:00
|
|
|
LinearAssignmentAPI.runAssignmentOn4x4Matrix();
|
|
|
|
|
}
|
|
|
|
|
}
|
