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());
}
private void AddCapacityConstrains(WorkData data, RoutingIndexManager manager, RoutingModel routing)
{
// Create and register a transit callback
int transitCallbackIndex = routing.RegisterTransitCallback(
(long fromIndex, long toIndex) =>
{
// Convert from routing variable Index to distance matrix NodeIndex
int fromNode = manager.IndexToNode(fromIndex);
int toNode = manager.IndexToNode(toIndex);
return(data.DistanceMatrix[fromNode, toNode]);
});
// Define cost of each arc.
routing.SetArcCostEvaluatorOfAllVehicles(transitCallbackIndex);
// Add Capacity constraint
int demandCallbackIndex = routing.RegisterUnaryTransitCallback(
(long fromIndex) =>
{
int fromNode = manager.IndexToNode(fromIndex);
return(data.Demands[fromNode]);
});
// AddDimensionWithVehicleCapacity method, which takes a vector of capacities
routing.AddDimensionWithVehicleCapacity(demandCallbackIndex, 0, data.VehicleCapacities, true, "Capacity");
}
static void Solve(int size, int forbidden, int seed)
{
RoutingIndexManager manager = new RoutingIndexManager(size, 1, 0);
RoutingModel routing = new RoutingModel(manager);
// Setting the cost function.
// Put a permanent callback to the distance accessor here. The callback
// has the following signature: ResultCallback2<int64_t, int64_t, int64_t>.
// The two arguments are the from and to node inidices.
RandomManhattan distances = new RandomManhattan(manager, size, seed);
routing.SetArcCostEvaluatorOfAllVehicles(routing.RegisterTransitCallback(distances.Call));
// Forbid node connections (randomly).
Random randomizer = new Random();
long forbidden_connections = 0;
while (forbidden_connections < forbidden)
{
long from = randomizer.Next(size - 1);
long to = randomizer.Next(size - 1) + 1;
if (routing.NextVar(from).Contains(to))
{
Console.WriteLine("Forbidding connection {0} -> {1}", from, to);
routing.NextVar(from).RemoveValue(to);
++forbidden_connections;
}
}
// Add dummy dimension to test API.
routing.AddDimension(routing.RegisterUnaryTransitCallback((long index) =>
{ return(1); }),
size + 1, size + 1, true, "dummy");
// Solve, returns a solution if any (owned by RoutingModel).
RoutingSearchParameters search_parameters =
operations_research_constraint_solver.DefaultRoutingSearchParameters();
// Setting first solution heuristic (cheapest addition).
search_parameters.FirstSolutionStrategy = FirstSolutionStrategy.Types.Value.PathCheapestArc;
Assignment solution = routing.SolveWithParameters(search_parameters);
Console.WriteLine("Status = {0}", routing.GetStatus());
if (solution != null)
{
// Solution cost.
Console.WriteLine("Cost = {0}", solution.ObjectiveValue());
// Inspect solution.
// Only one route here; otherwise iterate from 0 to routing.vehicles() - 1
int route_number = 0;
for (long node = routing.Start(route_number); !routing.IsEnd(node);
node = solution.Value(routing.NextVar(node)))
{
Console.Write("{0} -> ", node);
}
Console.WriteLine("0");
}
}
/// <summary>
/// Solves the current routing problem.
/// </summary>
private void Solve(int number_of_orders, int number_of_vehicles)
{
Console.WriteLine("Creating model with " + number_of_orders + " orders and " + number_of_vehicles +
" vehicles.");
// Finalizing model
int number_of_locations = locations_.Length;
RoutingIndexManager manager =
new RoutingIndexManager(number_of_locations, number_of_vehicles, vehicle_starts_, vehicle_ends_);
RoutingModel model = new RoutingModel(manager);
// Setting up dimensions
const int big_number = 100000;
Manhattan manhattan_callback = new Manhattan(manager, locations_, 1);
model.AddDimension(model.RegisterTransitCallback(manhattan_callback.Call), big_number, big_number, false,
"time");
RoutingDimension time_dimension = model.GetDimensionOrDie("time");
Demand demand_callback = new Demand(manager, order_demands_);
model.AddDimension(model.RegisterUnaryTransitCallback(demand_callback.Call), 0, vehicle_capacity_, true,
"capacity");
RoutingDimension capacity_dimension = model.GetDimensionOrDie("capacity");
// Setting up vehicles
Manhattan[] cost_callbacks = new Manhattan[number_of_vehicles];
for (int vehicle = 0; vehicle < number_of_vehicles; ++vehicle)
{
int cost_coefficient = vehicle_cost_coefficients_[vehicle];
Manhattan manhattan_cost_callback = new Manhattan(manager, locations_, cost_coefficient);
cost_callbacks[vehicle] = manhattan_cost_callback;
int manhattan_cost_index = model.RegisterTransitCallback(manhattan_cost_callback.Call);
model.SetArcCostEvaluatorOfVehicle(manhattan_cost_index, vehicle);
time_dimension.CumulVar(model.End(vehicle)).SetMax(vehicle_end_time_[vehicle]);
}
// Setting up orders
for (int order = 0; order < number_of_orders; ++order)
{
time_dimension.CumulVar(order).SetRange(order_time_windows_[order].start_, order_time_windows_[order].end_);
long[] orders = { manager.NodeToIndex(order) };
model.AddDisjunction(orders, order_penalties_[order]);
}
// Solving
RoutingSearchParameters search_parameters =
operations_research_constraint_solver.DefaultRoutingSearchParameters();
search_parameters.FirstSolutionStrategy = FirstSolutionStrategy.Types.Value.AllUnperformed;
Console.WriteLine("Search...");
Assignment solution = model.SolveWithParameters(search_parameters);
if (solution != null)
{
String output = "Total cost: " + solution.ObjectiveValue() + "\n";
// Dropped orders
String dropped = "";
for (int order = 0; order < number_of_orders; ++order)
{
if (solution.Value(model.NextVar(order)) == order)
{
dropped += " " + order;
}
}
if (dropped.Length > 0)
{
output += "Dropped orders:" + dropped + "\n";
}
// Routes
for (int vehicle = 0; vehicle < number_of_vehicles; ++vehicle)
{
String route = "Vehicle " + vehicle + ": ";
long order = model.Start(vehicle);
if (model.IsEnd(solution.Value(model.NextVar(order))))
{
route += "Empty";
}
else
{
for (; !model.IsEnd(order); order = solution.Value(model.NextVar(order)))
{
IntVar local_load = capacity_dimension.CumulVar(order);
IntVar local_time = time_dimension.CumulVar(order);
route += order + " Load(" + solution.Value(local_load) + ") " + "Time(" +
solution.Min(local_time) + ", " + solution.Max(local_time) + ") -> ";
}
IntVar load = capacity_dimension.CumulVar(order);
IntVar time = time_dimension.CumulVar(order);
route += order + " Load(" + solution.Value(load) + ") " + "Time(" + solution.Min(time) + ", " +
solution.Max(time) + ")";
}
output += route + "\n";
}
Console.WriteLine(output);
}
}
public void Init()
{
if (DataModel != null)
{
// Create RoutingModel Index RoutingIndexManager
if (DataModel.Starts != null && DataModel.Ends != null)
{
RoutingIndexManager = new RoutingIndexManager(
DataModel.TravelTimes.GetLength(0),
DataModel.VehicleCapacities.Length,
DataModel.Starts, DataModel.Ends);
}
else
{
throw new Exception("Starts or Ends in DataModel is null");
}
//Create routing model
RoutingModel = new RoutingModel(RoutingIndexManager);
// Create and register a transit callback.
var transitCallbackIndex = RoutingModel.RegisterTransitCallback(
(long fromIndex, long toIndex) =>
{
// Convert from routing variable Index to time matrix or distance matrix NodeIndex.
var fromNode = RoutingIndexManager.IndexToNode(fromIndex);
var toNode = RoutingIndexManager.IndexToNode(toIndex);
return(DataModel.TravelTimes[fromNode, toNode]);
}
);
//Create and register demand callback
var demandCallbackIndex = RoutingModel.RegisterUnaryTransitCallback(
(long fromIndex) => {
// Convert from routing variable Index to demand NodeIndex.
var fromNode = RoutingIndexManager.IndexToNode(fromIndex);
return(DataModel.Demands[fromNode]);
}
);
if (DropNodesAllowed)
{
// Allow to drop nodes.
//The penalty should be larger than the sum of all travel times locations (excluding the depot).
//As a result, after dropping one location to make the problem feasible, the solver won't drop any additional locations,
//because the penalty for doing so would exceed any further reduction in travel time.
//If we want to make as many deliveries as possible, penalty value should be larger than the sum of all travel times between locations
long penalty = 99999999;
for (int j = 0; j < DataModel.Starts.GetLength(0); j++)
{
var startIndex = DataModel.Starts[j];
for (int i = 0; i < DataModel.TravelTimes.GetLength(0); ++i)
{
if (startIndex != i)
{
RoutingModel.AddDisjunction(new long[] { RoutingIndexManager.NodeToIndex(i) }, penalty);//adds disjunction to all stop besides start stops
}
}
}
}
var vehicleCost = 10000;
RoutingModel.SetFixedCostOfAllVehicles(vehicleCost); //adds a penalty for using each vehicle
RoutingModel.SetArcCostEvaluatorOfAllVehicles(transitCallbackIndex); //Sets the cost function of the model such that the cost of a segment of a route between node 'from' and 'to' is evaluator(from, to), whatever the route or vehicle performing the route.
//Adds capacity constraints
RoutingModel.AddDimensionWithVehicleCapacity(
demandCallbackIndex, 0, // null capacity slack
DataModel.VehicleCapacities, // vehicle maximum capacities
false, // start cumul to zero
"Capacity");
RoutingDimension capacityDimension = RoutingModel.GetMutableDimension("Capacity");
//Add Time window constraints
RoutingModel.AddDimension(
transitCallbackIndex, // transit callback
86400, // allow waiting time (24 hours in seconds)
86400, // maximum travel time per vehicle (24 hours in seconds)
DataModel.ForceCumulToZero, // start cumul to zero
"Time");
RoutingDimension timeDimension = RoutingModel.GetMutableDimension("Time");
//timeDimension.SetGlobalSpanCostCoefficient(10);
var solver = RoutingModel.solver();
// Add time window constraints for each location except depot.
for (int i = 0; i < DataModel.TimeWindows.GetLength(0); i++)
{
long index = RoutingIndexManager.NodeToIndex(i); //gets the node index
if (index != -1)
{
var lowerBound = DataModel.TimeWindows[i, 0]; //minimum time to be at current index (lower bound for the timeWindow of current Index)
var softUpperBound = DataModel.TimeWindows[i, 1]; //soft maxUpperBound for the timeWindow at current index
var upperBound = softUpperBound + MaximumDeliveryDelayTime; //maxUpperBound to be at current index (upperbound for the timeWindow at current index)
//softupperbound and upperbound are different because the upperbound is usually bigger than the softuppberbound in order to soften the current timeWindows, enabling to generate a solution that accomodates more requests
timeDimension.CumulVar(index).SetRange(lowerBound, upperBound); //sets the maximum upper bound and lower bound limit for the timeWindow at the current index
timeDimension.SetCumulVarSoftUpperBound(index, softUpperBound, 10000); //adds soft upper bound limit which is the requested time window
RoutingModel.AddToAssignment(timeDimension.SlackVar(index)); //add timeDimension slack var for current index to the assignment
RoutingModel.AddToAssignment(timeDimension.TransitVar(index)); // add timeDimension transit var for current index to the assignment
RoutingModel.AddToAssignment(capacityDimension.TransitVar(index)); //add transit capacity var for current index to assignment
}
}
// Add time window constraints for each vehicle start node, and add to assignment the slack and transit vars for both dimensions
for (int i = 0; i < DataModel.VehicleCapacities.Length; i++)
{
long index = RoutingModel.Start(i);
var startDepotIndex = DataModel.Starts[i];
timeDimension.CumulVar(index).SetRange(DataModel.TimeWindows[startDepotIndex, 0], DataModel.TimeWindows[startDepotIndex, 1]); //this guarantees that a vehicle must visit the location during its time
RoutingModel.AddToAssignment(timeDimension.SlackVar(index)); //add timeDimension slack var for depot index for vehicle i depotto assignment
RoutingModel.AddToAssignment(timeDimension.TransitVar(index)); //add timeDimension transit var for depot index for vehicle i depot to assignment
RoutingModel.AddToAssignment(capacityDimension.TransitVar(index)); //add capacityDimension transit var for vehicle i depot
}
//Add client max ride time constraint, enabling better service quality
for (int i = 0; i < DataModel.PickupsDeliveries.Length; i++) //iterates over each pickupDelivery pair
{
int vehicleIndex = -1;
if (DataModel.PickupsDeliveries[i][0] == -1) //if the pickupDelivery is a customer inside a vehicle
{
vehicleIndex = DataModel.CustomersVehicle[i]; //gets the vehicle index
}
var pickupIndex = vehicleIndex == -1 ? RoutingIndexManager.NodeToIndex(DataModel.PickupsDeliveries[i][0]):RoutingModel.Start(vehicleIndex); //if is a customer inside a vehicle the pickupIndex will be the vehicle startIndex, otherwise its the customers real pickupIndex
var deliveryIndex = RoutingIndexManager.NodeToIndex(DataModel.PickupsDeliveries[i][1]);
var rideTime = DataModel.CustomersRideTimes[i];
var directRideTimeDuration = DataModel.TravelTimes[pickupIndex, DataModel.PickupsDeliveries[i][1]];
var realRideTimeDuration = rideTime + (timeDimension.CumulVar(deliveryIndex) - timeDimension.CumulVar(pickupIndex)); //adds the currentRideTime of the customer and subtracts cumulative value of the ride time of the delivery index with the current one of the current index to get the real ride time duration
solver.Add(realRideTimeDuration < directRideTimeDuration + DataModel.MaxCustomerRideTime); //adds the constraint so that the current ride time duration does not exceed the directRideTimeDuration + maxCustomerRideTimeDuration
}
//Add precedence and same vehicle Constraints
for (int i = 0; i < DataModel.PickupsDeliveries.GetLength(0); i++)
{
if (DataModel.PickupsDeliveries[i][0] != -1)
{
long pickupIndex = RoutingIndexManager.NodeToIndex(DataModel.PickupsDeliveries[i][0]); //pickup index
long deliveryIndex = RoutingIndexManager.NodeToIndex(DataModel.PickupsDeliveries[i][1]); //delivery index
RoutingModel.AddPickupAndDelivery(pickupIndex, deliveryIndex); //Notifies that the pickupIndex and deliveryIndex form a pair of nodes which should belong to the same route.
solver.Add(solver.MakeEquality(RoutingModel.VehicleVar(pickupIndex), RoutingModel.VehicleVar(deliveryIndex))); //Adds a constraint to the solver, that defines that both these pickup and delivery pairs must be picked up and delivered by the same vehicle (same route)
solver.Add(solver.MakeLessOrEqual(timeDimension.CumulVar(pickupIndex), timeDimension.CumulVar(deliveryIndex))); //Adds the precedence constraint to the solver, which defines that each item must be picked up at pickup index before it is delivered to the delivery index
//timeDimension.SlackVar(pickupIndex).SetMin(4);//mininimum slack will be 3 seconds (customer enter timer)
//timeDimension.SlackVar(deliveryIndex).SetMin(3); //minimum slack will be 3 seconds (customer leave time)
}
}
//Constraints to enforce that if there is a customer inside a vehicle, it has to be served by that vehicle
for (int customerIndex = 0; customerIndex < DataModel.CustomersVehicle.GetLength(0); customerIndex++)
{
var vehicleIndex = DataModel.CustomersVehicle[customerIndex];
if (vehicleIndex != -1) //if the current customer is inside a vehicle
{
var vehicleStartIndex = RoutingModel.Start(vehicleIndex); //vehicle start depot index
var deliveryIndex = RoutingIndexManager.NodeToIndex(DataModel.PickupsDeliveries[customerIndex][1]); //gets the deliveryIndex
solver.Add(solver.MakeEquality(RoutingModel.VehicleVar(vehicleStartIndex), RoutingModel.VehicleVar(deliveryIndex))); //vehicle with vehicleIndex has to be the one that delivers customer with nodeDeliveryIndex;
//this constraint enforces that the vehicle indexed by vehicleIndex has to be the vehicle which services (goes to) the nodeDeliveryIndex as well
}
}
for (int i = 0; i < DataModel.VehicleCapacities.Length; i++)
{
RoutingModel.AddVariableMinimizedByFinalizer(
timeDimension.CumulVar(RoutingModel.Start(i)));
RoutingModel.AddVariableMinimizedByFinalizer(
timeDimension.CumulVar(RoutingModel.End(i)));
}
}
}
//IntVar x;
//IntVar y;//Reduntant
public void SolveVrpProblem(Day day, ConfigParams cfg, VrpProblem vrpProblem, IDataOutput dataOutput, int[] VCMinMax)
{
this.day = day;
this.cfg = cfg;
//Google Distance Matrix API (Duration matrix)
// Create Routing Index Manager
manager = new RoutingIndexManager(
day.TimeMatrix.GetLength(0),
day.Vehicles.Count,
day.Depot);
// Create Routing Model.
routing = new RoutingModel(manager);
// Create and register a transit 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(day.TimeMatrix[fromNode, toNode]);
}
);
// Define cost of each arc.
routing.SetArcCostEvaluatorOfAllVehicles(transitCallbackIndex);
// Add Distance constraint.
if (day.TimeWindowsActive != true)
{
routing.AddDimension(transitCallbackIndex, 0, 700000,
true, // start cumul to zero
"Distance");
RoutingDimension distanceDimension = routing.GetMutableDimension("Distance");
distanceDimension.SetGlobalSpanCostCoefficient(100);
}
else
{
routing.AddDimension(
transitCallbackIndex, // transit callback
1000, // allow waiting time
600, // vehicle maximum capacities
false, // start cumul to zero
"Time");
TimeWindowInit(day, routing, manager);//Set Time Window Constraints
}
if (day.MaxVisitsActive != 0)
{
int demandCallbackIndex = routing.RegisterUnaryTransitCallback(
(long fromIndex) => {
// Convert from routing variable Index to demand NodeIndex.
var fromNode = manager.IndexToNode(fromIndex);
return(day.Demands[fromNode]);
}
);
routing.AddDimensionWithVehicleCapacity(
demandCallbackIndex, 0, // null capacity slack
day.VehicleCapacities, // vehicle maximum capacities
true, // start cumul to zero
"Capacity");
}
// Allow to drop nodes.
for (int i = 1; i < day.TimeMatrix.GetLength(0); ++i)
{
routing.AddDisjunction(
new long[] { manager.NodeToIndex(i) }, day.Locations.ElementAt(i).Penalty);
}
// Setting first solution heuristic.
RoutingSearchParameters searchParameters =
operations_research_constraint_solver.DefaultRoutingSearchParameters();
searchParameters.FirstSolutionStrategy =
FirstSolutionStrategy.Types.Value.PathMostConstrainedArc;
//metaheuristic
searchParameters.LocalSearchMetaheuristic = LocalSearchMetaheuristic.Types.Value.GuidedLocalSearch;
searchParameters.TimeLimit = new Duration {
Seconds = cfg.SolutionDuration
};
searchParameters.LogSearch = true;
solver = routing.solver();
//TODO
//Some location must be on same route.
//solver.Add(routing.VehicleVar(manager.NodeToIndex(2)) == routing.VehicleVar(manager.NodeToIndex(5)));
//One node takes precedence over the another.
//routing.AddPickupAndDelivery(manager.NodeToIndex(2), manager.NodeToIndex(5));
//Constraint variable
//x = solver.MakeIntVar(day.Vehicles.Count, day.Vehicles.Count, "x");
//Number of vehicle restriction - old version
//solver.Add(x < 7);
//Number of vehicle restriction -new version
//y = solver.MakeIntVar(routing.Vehicles(), routing.Vehicles(), "y");
//solver.Add(y <= VCMinMax[1]);//Reduntant
// Solve the problem.
solution = routing.SolveWithParameters(searchParameters);
day.LocationDropped = false;
// Display dropped nodes.
List <int> droppedNodes = new List <int>();
for (int index = 0; index < routing.Size(); ++index)
{
if (routing.IsStart(index) || routing.IsEnd(index))
{
continue;
}
if (solution.Value(routing.NextVar(index)) == index)
{
droppedNodes.Add(manager.IndexToNode((int)index));
day.LocationDropped = true;
}
}
day.DroppedLocations.Clear();
Console.WriteLine(day.Locations.ElementAt(0).Name);
if (droppedNodes != null)
{
foreach (var item in droppedNodes)
{
Location location = LocationDB.Locations.Where(x => x.Position.strPos_ == day.Addresses[item]).ToList().ElementAt(0);
if (location != null)
{
Console.WriteLine(location.Name);
day.DroppedLocations.Add(location);
}
}
}
List <int> AssignedNodes = new List <int>();
Console.WriteLine(manager.GetNumberOfNodes());
//Inspect Infeasable Nodes
for (int i = 0; i < day.Vehicles.Count; i++)
{
var index = routing.Start(i);
int j = 0;
while (routing.IsEnd(index) == false)
{
j++;
index = solution.Value(routing.NextVar(index));
}
if (j == 1)
{
day.InfeasibleNodes = true;
foreach (var item in day.DroppedLocations)
{
LocationDB.Locations.Where(x => x.ClientRef == item.ClientRef).ToList().ElementAt(0).Infeasible = true;
}
if (day.Vehicles.Count - 1 >= 1)
{
day.SetVehicleNumber(day.Vehicles.Count - 1);
day.ResetResults();
vrpProblem.SolveVrpProblem(day, cfg, vrpProblem, dataOutput, VCMinMax);
}
return;
}
}
// Inspect solution.
day.TotalDur = 0;
day.MinDur = 100000;
for (int i = 0; i < day.Vehicles.Count; i++)
{
long routeDuration = 0;
var index = routing.Start(i);
while (routing.IsEnd(index) == false)
{
var previousIndex = index;
index = solution.Value(routing.NextVar(index));
routeDuration += routing.GetArcCostForVehicle(previousIndex, index, 0);
}
day.TotalDur += routeDuration;
day.MaxDur = Math.Max(routeDuration, day.MaxDur);
day.MinDur = Math.Min(routeDuration, day.MinDur);
}
day.AvgDur = day.TotalDur / day.Vehicles.Count;
}
