DotNet Reference

DotNet Reference

VrpCapacity.cs
Go to the documentation of this file.
1 // Copyright 2010-2018 Google LLC
2 // Licensed under the Apache License, Version 2.0 (the "License");
3 // you may not use this file except in compliance with the License.
4 // You may obtain a copy of the License at
5 //
6 // http://www.apache.org/licenses/LICENSE-2.0
7 //
8 // Unless required by applicable law or agreed to in writing, software
9 // distributed under the License is distributed on an "AS IS" BASIS,
10 // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
11 // See the License for the specific language governing permissions and
12 // limitations under the License.
13 
14 // [START program]
15 // [START import]
16 using System;
17 using System.Collections.Generic;
19 // [END import]
20 
24 public class VrpCapacity {
25  // [START data_model]
26  class DataModel {
27  public long[,] DistanceMatrix = {
28  {0, 548, 776, 696, 582, 274, 502, 194, 308, 194, 536, 502, 388, 354, 468, 776, 662},
29  {548, 0, 684, 308, 194, 502, 730, 354, 696, 742, 1084, 594, 480, 674, 1016, 868, 1210},
30  {776, 684, 0, 992, 878, 502, 274, 810, 468, 742, 400, 1278, 1164, 1130, 788, 1552, 754},
31  {696, 308, 992, 0, 114, 650, 878, 502, 844, 890, 1232, 514, 628, 822, 1164, 560, 1358},
32  {582, 194, 878, 114, 0, 536, 764, 388, 730, 776, 1118, 400, 514, 708, 1050, 674, 1244},
33  {274, 502, 502, 650, 536, 0, 228, 308, 194, 240, 582, 776, 662, 628, 514, 1050, 708},
34  {502, 730, 274, 878, 764, 228, 0, 536, 194, 468, 354, 1004, 890, 856, 514, 1278, 480},
35  {194, 354, 810, 502, 388, 308, 536, 0, 342, 388, 730, 468, 354, 320, 662, 742, 856},
36  {308, 696, 468, 844, 730, 194, 194, 342, 0, 274, 388, 810, 696, 662, 320, 1084, 514},
37  {194, 742, 742, 890, 776, 240, 468, 388, 274, 0, 342, 536, 422, 388, 274, 810, 468},
38  {536, 1084, 400, 1232, 1118, 582, 354, 730, 388, 342, 0, 878, 764, 730, 388, 1152, 354},
39  {502, 594, 1278, 514, 400, 776, 1004, 468, 810, 536, 878, 0, 114, 308, 650, 274, 844},
40  {388, 480, 1164, 628, 514, 662, 890, 354, 696, 422, 764, 114, 0, 194, 536, 388, 730},
41  {354, 674, 1130, 822, 708, 628, 856, 320, 662, 388, 730, 308, 194, 0, 342, 422, 536},
42  {468, 1016, 788, 1164, 1050, 514, 514, 662, 320, 274, 388, 650, 536, 342, 0, 764, 194},
43  {776, 868, 1552, 560, 674, 1050, 1278, 742, 1084, 810, 1152, 274, 388, 422, 764, 0, 798},
44  {662, 1210, 754, 1358, 1244, 708, 480, 856, 514, 468, 354, 844, 730, 536, 194, 798, 0}
45  };
46  // [START demands_capacities]
47  public long[] Demands = {0, 1, 1, 2, 4, 2, 4, 8, 8, 1, 2, 1, 2, 4, 4, 8, 8};
48  public long[] VehicleCapacities = {15, 15, 15, 15};
49  // [END demands_capacities]
50  public int VehicleNumber = 4;
51  public int Depot = 0;
52  };
53  // [END data_model]
54 
55  // [START solution_printer]
59  static void PrintSolution(
60  in DataModel data,
61  in RoutingModel routing,
62  in RoutingIndexManager manager,
63  in Assignment solution) {
64  // Inspect solution.
65  long totalDistance = 0;
66  long totalLoad = 0;
67  for (int i = 0; i < data.VehicleNumber; ++i) {
68  Console.WriteLine("Route for Vehicle {0}:", i);
69  long routeDistance = 0;
70  long routeLoad = 0;
71  var index = routing.Start(i);
72  while (routing.IsEnd(index) == false) {
73  long nodeIndex = manager.IndexToNode(index);
74  routeLoad += data.Demands[nodeIndex];
75  Console.Write("{0} Load({1}) -> ", nodeIndex, routeLoad);
76  var previousIndex = index;
77  index = solution.Value(routing.NextVar(index));
78  routeDistance += routing.GetArcCostForVehicle(previousIndex, index, 0);
79  }
80  Console.WriteLine("{0}", manager.IndexToNode((int)index));
81  Console.WriteLine("Distance of the route: {0}m", routeDistance);
82  totalDistance += routeDistance;
83  totalLoad += routeLoad;
84  }
85  Console.WriteLine("Total distance of all routes: {0}m", totalDistance);
86  Console.WriteLine("Total load of all routes: {0}m", totalLoad);
87  }
88  // [END solution_printer]
89 
90  public static void Main(String[] args) {
91  // Instantiate the data problem.
92  // [START data]
93  DataModel data = new DataModel();
94  // [END data]
95 
96  // Create Routing Index Manager
97  // [START index_manager]
99  data.DistanceMatrix.GetLength(0),
100  data.VehicleNumber,
101  data.Depot);
102  // [END index_manager]
103 
104  // Create Routing Model.
105  // [START routing_model]
106  RoutingModel routing = new RoutingModel(manager);
107  // [END routing_model]
108 
109  // Create and register a transit callback.
110  // [START transit_callback]
111  int transitCallbackIndex = routing.RegisterTransitCallback(
112  (long fromIndex, long toIndex) => {
113  // Convert from routing variable Index to distance matrix NodeIndex.
114  var fromNode = manager.IndexToNode(fromIndex);
115  var toNode = manager.IndexToNode(toIndex);
116  return data.DistanceMatrix[fromNode, toNode]; }
117  );
118  // [END transit_callback]
119 
120  // Define cost of each arc.
121  // [START arc_cost]
122  routing.SetArcCostEvaluatorOfAllVehicles(transitCallbackIndex);
123  // [END arc_cost]
124 
125  // Add Capacity constraint.
126  // [START capacity_constraint]
127  int demandCallbackIndex = routing.RegisterUnaryTransitCallback(
128  (long fromIndex) => {
129  // Convert from routing variable Index to demand NodeIndex.
130  var fromNode = manager.IndexToNode(fromIndex);
131  return data.Demands[fromNode]; }
132  );
134  demandCallbackIndex, 0, // null capacity slack
135  data.VehicleCapacities, // vehicle maximum capacities
136  true, // start cumul to zero
137  "Capacity");
138  // [END capacity_constraint]
139 
140  // Setting first solution heuristic.
141  // [START parameters]
142  RoutingSearchParameters searchParameters =
144  searchParameters.FirstSolutionStrategy =
145  FirstSolutionStrategy.Types.Value.PathCheapestArc;
146  // [END parameters]
147 
148  // Solve the problem.
149  // [START solve]
150  Assignment solution = routing.SolveWithParameters(searchParameters);
151  // [END solve]
152 
153  // Print solution on console.
154  // [START print_solution]
155  PrintSolution(data, routing, manager, solution);
156  // [END print_solution]
157  }
158 }
159 // [END program]
void SetArcCostEvaluatorOfAllVehicles(int evaluator_index)
global::Google.OrTools.ConstraintSolver.FirstSolutionStrategy.Types.Value FirstSolutionStrategy
First solution strategies, used as starting point of local search.
static void Main(String[] args)
Definition: VrpCapacity.cs:90
Definition: Assignment.cs:11
int IndexToNode(long index)
Value
Definition: RoutingModel.cs:18
First solution strategies, used as starting point of local search.
Minimal TSP using distance matrix.
Definition: VrpCapacity.cs:24
int RegisterUnaryTransitCallback(LongToLong callback)
static Google.OrTools.ConstraintSolver.RoutingSearchParameters DefaultRoutingSearchParameters()
Definition: Assignment.cs:18
bool AddDimensionWithVehicleCapacity(int evaluator_index, long slack_max, long[] vehicle_capacities, bool fix_start_cumul_to_zero, string name)
Container for nested types declared in the FirstSolutionStrategy message type.
int RegisterTransitCallback(LongLongToLong callback)
Assignment SolveWithParameters(Google.OrTools.ConstraintSolver.RoutingSearchParameters search_parameters)
Parameters defining the search used to solve vehicle routing problems.