DotNet Reference

DotNet Reference

VrpPickupDeliveryLifo.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 VrpPickupDeliveryLifo {
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 pickups_deliveries]
47  public int[][] PickupsDeliveries = {
48  new int[] {1, 6},
49  new int[] {2, 10},
50  new int[] {4, 3},
51  new int[] {5, 9},
52  new int[] {7, 8},
53  new int[] {15, 11},
54  new int[] {13, 12},
55  new int[] {16, 14},
56  };
57  // [END pickups_deliveries]
58  public int VehicleNumber = 4;
59  public int Depot = 0;
60  };
61  // [END data_model]
62 
63  // [START solution_printer]
67  static void PrintSolution(
68  in DataModel data,
69  in RoutingModel routing,
70  in RoutingIndexManager manager,
71  in Assignment solution) {
72  long totalDistance = 0;
73  for (int i = 0; i < data.VehicleNumber; ++i) {
74  Console.WriteLine("Route for Vehicle {0}:", i);
75  long routeDistance = 0;
76  var index = routing.Start(i);
77  while (routing.IsEnd(index) == false) {
78  Console.Write("{0} -> ", manager.IndexToNode((int)index));
79  var previousIndex = index;
80  index = solution.Value(routing.NextVar(index));
81  routeDistance += routing.GetArcCostForVehicle(previousIndex, index, 0);
82  }
83  Console.WriteLine("{0}", manager.IndexToNode((int)index));
84  Console.WriteLine("Distance of the route: {0}m", routeDistance);
85  totalDistance += routeDistance;
86  }
87  Console.WriteLine("Total Distance of all routes: {0}m", totalDistance);
88  }
89  // [END solution_printer]
90 
91  public static void Main(String[] args) {
92  // Instantiate the data problem.
93  // [START data]
94  DataModel data = new DataModel();
95  // [END data]
96 
97  // Create Routing Index Manager
98  // [START index_manager]
100  data.DistanceMatrix.GetLength(0),
101  data.VehicleNumber,
102  data.Depot);
103  // [END index_manager]
104 
105  // Create Routing Model.
106  // [START routing_model]
107  RoutingModel routing = new RoutingModel(manager);
108  // [END routing_model]
109 
110  // Create and register a transit callback.
111  // [START transit_callback]
112  int transitCallbackIndex = routing.RegisterTransitCallback(
113  (long fromIndex, long toIndex) => {
114  // Convert from routing variable Index to distance matrix NodeIndex.
115  var fromNode = manager.IndexToNode(fromIndex);
116  var toNode = manager.IndexToNode(toIndex);
117  return data.DistanceMatrix[fromNode, toNode]; }
118  );
119  // [END transit_callback]
120 
121  // Define cost of each arc.
122  // [START arc_cost]
123  routing.SetArcCostEvaluatorOfAllVehicles(transitCallbackIndex);
124  // [END arc_cost]
125 
126  // Add Distance constraint.
127  // [START distance_constraint]
128  routing.AddDimension(transitCallbackIndex, 0, 3000,
129  true, // start cumul to zero
130  "Distance");
131  RoutingDimension distanceDimension = routing.GetMutableDimension("Distance");
132  distanceDimension.SetGlobalSpanCostCoefficient(100);
133  // [END distance_constraint]
134 
135  // Define Transportation Requests.
136  // [START pickup_delivery_constraint]
137  Solver solver = routing.solver();
138  for(int i=0; i < data.PickupsDeliveries.GetLength(0); i++) {
139  long pickupIndex = manager.NodeToIndex(data.PickupsDeliveries[i][0]);
140  long deliveryIndex = manager.NodeToIndex(data.PickupsDeliveries[i][1]);
141  routing.AddPickupAndDelivery(pickupIndex, deliveryIndex);
142  solver.Add(solver.MakeEquality(
143  routing.VehicleVar(pickupIndex),
144  routing.VehicleVar(deliveryIndex)));
145  solver.Add(solver.MakeLessOrEqual(
146  distanceDimension.CumulVar(pickupIndex),
147  distanceDimension.CumulVar(deliveryIndex)));
148  }
151  // [END pickup_delivery_constraint]
152 
153  // Setting first solution heuristic.
154  // [START parameters]
155  RoutingSearchParameters searchParameters =
157  searchParameters.FirstSolutionStrategy =
158  FirstSolutionStrategy.Types.Value.PathCheapestArc;
159  // [END parameters]
160 
161  // Solve the problem.
162  // [START solve]
163  Assignment solution = routing.SolveWithParameters(searchParameters);
164  // [END solve]
165 
166  // Print solution on console.
167  // [START print_solution]
168  PrintSolution(data, routing, manager, solution);
169  // [END print_solution]
170  }
171 }
172 // [END program]
IntVar VehicleVar(long index)
void SetArcCostEvaluatorOfAllVehicles(int evaluator_index)
void Add(Constraint c)
global::Google.OrTools.ConstraintSolver.FirstSolutionStrategy.Types.Value FirstSolutionStrategy
First solution strategies, used as starting point of local search.
static void Main(String[] args)
long NodeToIndex(int node)
Definition: Assignment.cs:11
void SetPickupAndDeliveryPolicyOfAllVehicles(int policy)
void AddPickupAndDelivery(long pickup, long delivery)
int IndexToNode(long index)
Value
Constraint MakeEquality(IntExpr left, IntExpr right)
IntVar CumulVar(long index)
Definition: RoutingModel.cs:18
First solution strategies, used as starting point of local search.
Constraint MakeLessOrEqual(IntExpr left, IntExpr right)
void SetGlobalSpanCostCoefficient(long coefficient)
bool AddDimension(int evaluator_index, long slack_max, long capacity, bool fix_start_cumul_to_zero, string name)
static Google.OrTools.ConstraintSolver.RoutingSearchParameters DefaultRoutingSearchParameters()
Definition: Assignment.cs:18
Minimal Pickup & Delivery Problem (PDP).
Solver solver()
Container for nested types declared in the FirstSolutionStrategy message type.
int RegisterTransitCallback(LongLongToLong callback)
Assignment SolveWithParameters(Google.OrTools.ConstraintSolver.RoutingSearchParameters search_parameters)
static readonly int PICKUP_AND_DELIVERY_LIFO
RoutingDimension GetMutableDimension(string dimension_name)
Parameters defining the search used to solve vehicle routing problems.