203 lines
11 KiB
C#
203 lines
11 KiB
C#
// Copyright 2010-2022 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.
|
|
|
|
using System;
|
|
using Xunit;
|
|
using Google.OrTools.ConstraintSolver;
|
|
|
|
namespace Google.OrTools.Tests
|
|
{
|
|
public class RoutingSolverTest
|
|
{
|
|
[Theory]
|
|
[InlineData(false)]
|
|
[InlineData(true)]
|
|
public void SimpleLambdaCallback(bool callGC)
|
|
{
|
|
// Create Routing Index Manager
|
|
RoutingIndexManager manager = new RoutingIndexManager(5 /*locations*/, 1 /*vehicle*/, 0 /*depot*/);
|
|
// Create Routing Model.
|
|
RoutingModel routing = new RoutingModel(manager);
|
|
// Create a distance callback.
|
|
int transitCallbackIndex = routing.RegisterTransitCallback((long fromIndex, long toIndex) =>
|
|
{
|
|
// Convert from routing variable Index to
|
|
// distance matrix NodeIndex.
|
|
var fromNode = manager.IndexToNode(fromIndex);
|
|
var toNode = manager.IndexToNode(toIndex);
|
|
return Math.Abs(toNode - fromNode);
|
|
});
|
|
// Define cost of each arc.
|
|
routing.SetArcCostEvaluatorOfAllVehicles(transitCallbackIndex);
|
|
if (callGC)
|
|
{
|
|
GC.Collect();
|
|
}
|
|
// Setting first solution heuristic.
|
|
RoutingSearchParameters searchParameters =
|
|
operations_research_constraint_solver.DefaultRoutingSearchParameters();
|
|
searchParameters.FirstSolutionStrategy = FirstSolutionStrategy.Types.Value.PathCheapestArc;
|
|
Assignment solution = routing.SolveWithParameters(searchParameters);
|
|
// 0 --(+1)-> 1 --(+1)-> 2 --(+1)-> 3 --(+1)-> 4 --(+4)-> 0 := +8
|
|
Assert.Equal(8, solution.ObjectiveValue());
|
|
}
|
|
|
|
[Fact]
|
|
public void TestTransitMatrix()
|
|
{
|
|
// Create Routing Index Manager
|
|
RoutingIndexManager manager = new RoutingIndexManager(5 /*locations*/, 1 /*vehicle*/, 0 /*depot*/);
|
|
// Create Routing Model.
|
|
RoutingModel routing = new RoutingModel(manager);
|
|
// Create a distance callback.
|
|
long[][] matrix = new long[][] {
|
|
new long[] { 1, 1, 1, 1, 1 }, new long[] { 1, 1, 1, 1, 1 }, new long[] { 1, 1, 1, 1, 1 },
|
|
new long[] { 1, 1, 1, 1, 1 }, new long[] { 1, 1, 1, 1, 1 },
|
|
};
|
|
int transitCallbackIndex = routing.RegisterTransitMatrix(matrix);
|
|
// Define cost of each arc.
|
|
routing.SetArcCostEvaluatorOfAllVehicles(transitCallbackIndex);
|
|
// Setting first solution heuristic.
|
|
RoutingSearchParameters searchParameters =
|
|
operations_research_constraint_solver.DefaultRoutingSearchParameters();
|
|
searchParameters.FirstSolutionStrategy = FirstSolutionStrategy.Types.Value.PathCheapestArc;
|
|
Assignment solution = routing.SolveWithParameters(searchParameters);
|
|
// 0 --(+1)-> 1 --(+1)-> 2 --(+1)-> 3 --(+1)-> 4 --(+1)-> 0 := +5
|
|
Assert.Equal(5, solution.ObjectiveValue());
|
|
}
|
|
|
|
[Fact]
|
|
public void TestTransitCallback()
|
|
{
|
|
// Create Routing Index Manager
|
|
RoutingIndexManager manager = new RoutingIndexManager(5 /*locations*/, 1 /*vehicle*/, 0 /*depot*/);
|
|
// Create Routing Model.
|
|
RoutingModel routing = new RoutingModel(manager);
|
|
// Create a distance callback.
|
|
int transitCallbackIndex = routing.RegisterTransitCallback((long fromIndex, long toIndex) =>
|
|
{
|
|
// Convert from routing variable Index to
|
|
// distance matrix NodeIndex.
|
|
var fromNode = manager.IndexToNode(fromIndex);
|
|
var toNode = manager.IndexToNode(toIndex);
|
|
return Math.Abs(toNode - fromNode);
|
|
});
|
|
// Define cost of each arc.
|
|
routing.SetArcCostEvaluatorOfAllVehicles(transitCallbackIndex);
|
|
// Setting first solution heuristic.
|
|
RoutingSearchParameters searchParameters =
|
|
operations_research_constraint_solver.DefaultRoutingSearchParameters();
|
|
searchParameters.FirstSolutionStrategy = FirstSolutionStrategy.Types.Value.PathCheapestArc;
|
|
Assignment solution = routing.SolveWithParameters(searchParameters);
|
|
Assert.Equal(8, solution.ObjectiveValue());
|
|
}
|
|
|
|
[Fact]
|
|
public void TestMatrixDimension()
|
|
{
|
|
// Create Routing Index Manager
|
|
RoutingIndexManager manager = new RoutingIndexManager(5 /*locations*/, 1 /*vehicle*/, 0 /*depot*/);
|
|
// Create Routing Model.
|
|
RoutingModel routing = new RoutingModel(manager);
|
|
// Create a distance callback.
|
|
long[][] matrix = new long[][] {
|
|
new long[] { 1, 1, 1, 1, 1 }, new long[] { 1, 1, 1, 1, 1 }, new long[] { 1, 1, 1, 1, 1 },
|
|
new long[] { 1, 1, 1, 1, 1 }, new long[] { 1, 1, 1, 1, 1 },
|
|
};
|
|
IntBoolPair result = routing.AddMatrixDimension(matrix,
|
|
/*capacity=*/10,
|
|
/*fix_start_cumul_to_zero=*/true, "Dimension");
|
|
// Define cost of each arc.
|
|
routing.SetArcCostEvaluatorOfAllVehicles(result.first);
|
|
// Setting first solution heuristic.
|
|
RoutingSearchParameters searchParameters =
|
|
operations_research_constraint_solver.DefaultRoutingSearchParameters();
|
|
searchParameters.FirstSolutionStrategy = FirstSolutionStrategy.Types.Value.PathCheapestArc;
|
|
Assignment solution = routing.SolveWithParameters(searchParameters);
|
|
// 0 --(+1)-> 1 --(+1)-> 2 --(+1)-> 3 --(+1)-> 4 --(+1)-> 0 := +5
|
|
Assert.Equal(5, solution.ObjectiveValue());
|
|
}
|
|
|
|
[Fact]
|
|
public void TestUnaryTransitVector()
|
|
{
|
|
// Create Routing Index Manager
|
|
RoutingIndexManager manager = new RoutingIndexManager(5 /*locations*/, 1 /*vehicle*/, 0 /*depot*/);
|
|
// Create Routing Model.
|
|
RoutingModel routing = new RoutingModel(manager);
|
|
// Create a distance callback.
|
|
long[] vector = { 1, 1, 1, 1, 1 };
|
|
int transitCallbackIndex = routing.RegisterUnaryTransitVector(vector);
|
|
// Define cost of each arc.
|
|
routing.SetArcCostEvaluatorOfAllVehicles(transitCallbackIndex);
|
|
// Setting first solution heuristic.
|
|
RoutingSearchParameters searchParameters =
|
|
operations_research_constraint_solver.DefaultRoutingSearchParameters();
|
|
searchParameters.FirstSolutionStrategy = FirstSolutionStrategy.Types.Value.PathCheapestArc;
|
|
Assignment solution = routing.SolveWithParameters(searchParameters);
|
|
// 0 --(+1)-> 1 --(+1)-> 2 --(+1)-> 3 --(+1)-> 4 --(+1)-> 0 := +5
|
|
Assert.Equal(5, solution.ObjectiveValue());
|
|
}
|
|
|
|
[Fact]
|
|
public void TestUnaryTransitCallback()
|
|
{
|
|
// Create Routing Index Manager
|
|
RoutingIndexManager manager = new RoutingIndexManager(5 /*locations*/, 1 /*vehicle*/, 0 /*depot*/);
|
|
// Create Routing Model.
|
|
RoutingModel routing = new RoutingModel(manager);
|
|
// Create a distance callback.
|
|
int transitCallbackIndex = routing.RegisterUnaryTransitCallback((long fromIndex) =>
|
|
{
|
|
// Convert from routing variable Index to
|
|
// distance matrix NodeIndex.
|
|
var fromNode =
|
|
manager.IndexToNode(fromIndex);
|
|
return fromNode + 1;
|
|
});
|
|
// Define cost of each arc.
|
|
routing.SetArcCostEvaluatorOfAllVehicles(transitCallbackIndex);
|
|
// Setting first solution heuristic.
|
|
RoutingSearchParameters searchParameters =
|
|
operations_research_constraint_solver.DefaultRoutingSearchParameters();
|
|
searchParameters.FirstSolutionStrategy = FirstSolutionStrategy.Types.Value.PathCheapestArc;
|
|
Assignment solution = routing.SolveWithParameters(searchParameters);
|
|
// 0 --(+1)-> 1 --(+2)-> 2 --(+3)-> 3 --(+4)-> 4 --(+5)-> 0 := +15
|
|
Assert.Equal(15, solution.ObjectiveValue());
|
|
}
|
|
|
|
[Fact]
|
|
public void TestVectorDimension()
|
|
{
|
|
// Create Routing Index Manager
|
|
RoutingIndexManager manager = new RoutingIndexManager(5 /*locations*/, 1 /*vehicle*/, 0 /*depot*/);
|
|
// Create Routing Model.
|
|
RoutingModel routing = new RoutingModel(manager);
|
|
// Create a distance callback.
|
|
long[] vector = new long[] { 1, 1, 1, 1, 1 };
|
|
IntBoolPair result = routing.AddVectorDimension(vector,
|
|
/*capacity=*/10,
|
|
/*fix_start_cumul_to_zero=*/true, "Dimension");
|
|
// Define cost of each arc.
|
|
routing.SetArcCostEvaluatorOfAllVehicles(result.first);
|
|
// Setting first solution heuristic.
|
|
RoutingSearchParameters searchParameters =
|
|
operations_research_constraint_solver.DefaultRoutingSearchParameters();
|
|
searchParameters.FirstSolutionStrategy = FirstSolutionStrategy.Types.Value.PathCheapestArc;
|
|
Assignment solution = routing.SolveWithParameters(searchParameters);
|
|
// 0 --(+1)-> 1 --(+1)-> 2 --(+1)-> 3 --(+1)-> 4 --(+1)-> 0 := +5
|
|
Assert.Equal(5, solution.ObjectiveValue());
|
|
}
|
|
}
|
|
} // namespace Google.OrTools.Tests
|