public override IOperation Apply()
{
ITimeWindowedProblemInstance vrptw = ProblemInstanceParameter.ActualValue as ITimeWindowedProblemInstance;
ResultCollection results = ResultsParameter.ActualValue;
ItemArray <DoubleValue> qualities = QualityParameter.ActualValue;
ItemArray <DoubleValue> tardiness = TardinessParameter.ActualValue;
double sigma = SigmaParameter.Value.Value;
double phi = PhiParameter.Value.Value;
double minPenalty = MinPenaltyFactorParameter.Value.Value;
double maxPenalty = MaxPenaltyFactorParameter.Value.Value;
for (int j = 0; j < qualities.Length; j++)
{
qualities[j].Value -= tardiness[j].Value * vrptw.TardinessPenalty.Value;
}
int validCount = 0;
for (int j = 0; j < qualities.Length; j++)
{
if (tardiness[j].Value == 0)
{
validCount++;
}
}
double factor = 1.0 - ((double)validCount / (double)qualities.Length);
double min = vrptw.TardinessPenalty.Value / (1 + sigma);
double max = vrptw.TardinessPenalty.Value * (1 + phi);
vrptw.CurrentTardinessPenalty = new DoubleValue(min + (max - min) * factor);
if (vrptw.CurrentTardinessPenalty.Value < minPenalty)
{
vrptw.CurrentTardinessPenalty.Value = minPenalty;
}
if (vrptw.CurrentTardinessPenalty.Value > maxPenalty)
{
vrptw.CurrentTardinessPenalty.Value = maxPenalty;
}
for (int j = 0; j < qualities.Length; j++)
{
qualities[j].Value += tardiness[j].Value * vrptw.CurrentTardinessPenalty.Value;
}
if (!results.ContainsKey("Current Tardiness Penalty"))
{
results.Add(new Result("Current Tardiness Penalty", new DoubleValue(vrptw.CurrentTardinessPenalty.Value)));
}
else
{
(results["Current Tardiness Penalty"].Value as DoubleValue).Value = vrptw.CurrentTardinessPenalty.Value;
}
return(base.Apply());
}
public override IOperation Apply()
{
ItemList <IItem> tabuList = TabuListParameter.ActualValue;
double moveQuality = MoveQualityParameter.ActualValue.Value;
bool useAspiration = UseAspirationCriterion.Value;
bool isTabu = false;
PotvinPDRearrangeMove move = PDRearrangeMoveParameter.ActualValue;
foreach (IItem tabuMove in tabuList)
{
PotvinPDRelocateMoveAttribute attribute = tabuMove as PotvinPDRelocateMoveAttribute;
if (attribute != null)
{
double distance = 0;
if (MoveDistanceParameter.ActualValue != null)
{
distance = MoveDistanceParameter.ActualValue.Value;
}
double overload = 0;
if (MoveOverloadParameter.ActualValue != null)
{
overload = MoveOverloadParameter.ActualValue.Value;
}
double tardiness = 0;
if (MoveTardinessParameter.ActualValue != null)
{
tardiness = MoveTardinessParameter.ActualValue.Value;
}
IVRPProblemInstance instance = ProblemInstanceParameter.ActualValue;
double quality = attribute.Distance * instance.DistanceFactor.Value;
IHomogenousCapacitatedProblemInstance cvrp = instance as IHomogenousCapacitatedProblemInstance;
if (cvrp != null)
{
quality += attribute.Overload * cvrp.OverloadPenalty.Value;
}
ITimeWindowedProblemInstance vrptw = instance as ITimeWindowedProblemInstance;
if (vrptw != null)
{
quality += attribute.Tardiness * vrptw.TardinessPenalty.Value;
}
IPickupAndDeliveryProblemInstance pdp = instance as IPickupAndDeliveryProblemInstance;
if (pdp != null)
{
quality += attribute.PickupViolations * pdp.PickupViolationPenalty.Value;
}
if (!useAspiration || moveQuality >= quality)
{
if (attribute.City == move.City && attribute.Tour == move.Tour)
{
isTabu = true;
break;
}
if (attribute.Distance == distance && attribute.Overload == overload && attribute.Tardiness == tardiness)
{
isTabu = true;
break;
}
}
}
}
MoveTabuParameter.ActualValue = new BoolValue(isTabu);
return(base.Apply());
}
public override IOperation Apply()
{
ItemList <IItem> tabuList = TabuListParameter.ActualValue;
double moveQuality = MoveQualityParameter.ActualValue.Value;
bool useAspiration = UseAspirationCriterion.Value;
bool isTabu = false;
PotvinTwoOptStarMove move = TwoOptStarMoveParameter.ActualValue;
List <int> segmentX1;
List <int> segmentX2;
PotvinTwoOptStarMoveMaker.GetSegments(move, out segmentX1, out segmentX2);
foreach (IItem tabuMove in tabuList)
{
PotvinTwoOptStarMoveAttribute attribute = tabuMove as PotvinTwoOptStarMoveAttribute;
if (attribute != null)
{
double distance = 0;
if (MoveDistanceParameter.ActualValue != null)
{
distance = MoveDistanceParameter.ActualValue.Value;
}
double overload = 0;
if (MoveOverloadParameter.ActualValue != null)
{
overload = MoveOverloadParameter.ActualValue.Value;
}
double tardiness = 0;
if (MoveTardinessParameter.ActualValue != null)
{
tardiness = MoveTardinessParameter.ActualValue.Value;
}
IVRPProblemInstance instance = ProblemInstanceParameter.ActualValue;
double quality = attribute.Distance * instance.DistanceFactor.Value;
IHomogenousCapacitatedProblemInstance cvrp = instance as IHomogenousCapacitatedProblemInstance;
if (cvrp != null)
{
quality += attribute.Overload * cvrp.OverloadPenalty.Value;
}
ITimeWindowedProblemInstance vrptw = instance as ITimeWindowedProblemInstance;
if (vrptw != null)
{
quality += attribute.Tardiness * vrptw.TardinessPenalty.Value;
}
if (!useAspiration || moveQuality >= quality)
{
if (attribute.Tour == move.Tour1 && segmentX2.Contains(attribute.City) ||
attribute.Tour == move.Tour2 && segmentX1.Contains(attribute.City))
{
isTabu = true;
break;
}
if (attribute.Distance == distance && attribute.Overload == overload && attribute.Tardiness == tardiness)
{
isTabu = true;
break;
}
}
}
}
MoveTabuParameter.ActualValue = new BoolValue(isTabu);
return(base.Apply());
}
protected override void EvaluateTour(VRPEvaluation eval, IVRPProblemInstance instance, Tour tour, IVRPEncoding solution)
{
TourInsertionInfo tourInfo = new TourInsertionInfo(solution.GetVehicleAssignment(solution.GetTourIndex(tour)));
eval.InsertionInfo.AddTourInsertionInfo(tourInfo);
double originalQuality = eval.Quality;
IHomogenousCapacitatedProblemInstance cvrpInstance = instance as IHomogenousCapacitatedProblemInstance;
DoubleArray demand = instance.Demand;
ITimeWindowedProblemInstance vrptw = instance as ITimeWindowedProblemInstance;
DoubleArray dueTime = vrptw.DueTime;
DoubleArray readyTime = vrptw.ReadyTime;
DoubleArray serviceTimes = vrptw.ServiceTime;
IPickupAndDeliveryProblemInstance pdp = instance as IPickupAndDeliveryProblemInstance;
IntArray pickupDeliveryLocation = pdp.PickupDeliveryLocation;
double capacity = cvrpInstance.Capacity.Value;
double time = 0.0;
double waitingTime = 0.0;
double serviceTime = 0.0;
double tardiness = 0.0;
double overweight = 0.0;
double distance = 0.0;
double currentLoad = 0.0;
Dictionary <int, bool> stops = new Dictionary <int, bool>();
int pickupViolations = 0;
double tourStartTime = readyTime[0];
time = tourStartTime;
//simulate a tour, start and end at depot
for (int i = 0; i <= tour.Stops.Count; i++)
{
int start = 0;
if (i > 0)
{
start = tour.Stops[i - 1];
}
int end = 0;
if (i < tour.Stops.Count)
{
end = tour.Stops[i];
}
//drive there
double currentDistace = vrptw.GetDistance(start, end, solution);
time += currentDistace;
distance += currentDistace;
double arrivalTime = time;
//check if it was serviced on time
if (time > dueTime[end])
{
tardiness += time - dueTime[end];
}
//wait
double currentWaitingTime = 0.0;
if (time < readyTime[end])
{
currentWaitingTime = readyTime[end] - time;
}
double waitTime = readyTime[end] - time;
waitingTime += currentWaitingTime;
time += currentWaitingTime;
double spareTime = dueTime[end] - time;
//service
double currentServiceTime = serviceTimes[end];
serviceTime += currentServiceTime;
time += currentServiceTime;
//Pickup / deliver
double arrivalSpareCapacity = capacity - currentLoad;
bool validPickupDelivery =
validPickupDelivery =
((demand[end] >= 0) ||
(stops.ContainsKey(pickupDeliveryLocation[end])));
if (validPickupDelivery)
{
currentLoad += demand[end];
}
else
{
pickupViolations++;
}
if (currentLoad > capacity)
{
overweight += currentLoad - capacity;
}
double spareCapacity = capacity - currentLoad;
CVRPPDTWInsertionInfo stopInfo = new CVRPPDTWInsertionInfo(start, end, spareCapacity, tourStartTime,
arrivalTime, time, spareTime, waitTime, new List <int>(stops.Keys), arrivalSpareCapacity);
tourInfo.AddStopInsertionInfo(stopInfo);
stops.Add(end, true);
}
eval.Quality += instance.FleetUsageFactor.Value;
eval.Quality += instance.DistanceFactor.Value * distance;
eval.Distance += distance;
eval.VehicleUtilization += 1;
(eval as CVRPEvaluation).Overload += overweight;
double tourPenalty = 0;
double penalty = overweight * cvrpInstance.OverloadPenalty.Value;
eval.Penalty += penalty;
eval.Quality += penalty;
tourPenalty += penalty;
(eval as CVRPTWEvaluation).Tardiness += tardiness;
(eval as CVRPTWEvaluation).TravelTime += time;
penalty = tardiness * vrptw.TardinessPenalty.Value;
eval.Penalty += penalty;
eval.Quality += penalty;
tourPenalty += penalty;
(eval as CVRPPDTWEvaluation).PickupViolations += pickupViolations;
penalty = pickupViolations * pdp.PickupViolationPenalty.Value;
eval.Penalty += penalty;
tourPenalty += penalty;
eval.Quality += penalty;
eval.Quality += time * vrptw.TimeFactor.Value;
tourInfo.Penalty = tourPenalty;
tourInfo.Quality = eval.Quality - originalQuality;
}
protected override double GetTourInsertionCosts(IVRPProblemInstance instance, IVRPEncoding solution, TourInsertionInfo tourInsertionInfo, int index, int customer,
out bool feasible)
{
CVRPPDTWInsertionInfo insertionInfo = tourInsertionInfo.GetStopInsertionInfo(index) as CVRPPDTWInsertionInfo;
double costs = 0;
feasible = tourInsertionInfo.Penalty < double.Epsilon;
bool tourFeasible = true;
ICapacitatedProblemInstance cvrp = instance as ICapacitatedProblemInstance;
double overloadPenalty = cvrp.OverloadPenalty.Value;
ITimeWindowedProblemInstance vrptw = instance as ITimeWindowedProblemInstance;
DoubleArray dueTime = vrptw.DueTime;
DoubleArray readyTime = vrptw.ReadyTime;
DoubleArray serviceTimes = vrptw.ServiceTime;
double tardinessPenalty = vrptw.TardinessPenalty.Value;
IPickupAndDeliveryProblemInstance pdp = instance as IPickupAndDeliveryProblemInstance;
IntArray pickupDeliveryLocation = pdp.PickupDeliveryLocation;
double pickupPenalty = pdp.PickupViolationPenalty.Value;
double distance = instance.GetDistance(insertionInfo.Start, insertionInfo.End, solution);
double newDistance =
instance.GetDistance(insertionInfo.Start, customer, solution) +
instance.GetDistance(customer, insertionInfo.End, solution);
costs += instance.DistanceFactor.Value * (newDistance - distance);
double demand = instance.Demand[customer];
if (demand > insertionInfo.ArrivalSpareCapacity)
{
tourFeasible = feasible = false;
if (insertionInfo.ArrivalSpareCapacity >= 0)
{
costs += (demand - insertionInfo.ArrivalSpareCapacity) * overloadPenalty;
}
else
{
costs += demand * overloadPenalty;
}
}
int destination = pickupDeliveryLocation[customer];
bool validPickup = true;
if (demand < 0 && !insertionInfo.Visited.Contains(destination))
{
tourFeasible = feasible = false;
validPickup = false;
costs += pickupPenalty;
}
double time = 0;
double tardiness = 0;
if (index > 0)
{
time = (tourInsertionInfo.GetStopInsertionInfo(index - 1) as CVRPTWInsertionInfo).LeaveTime;
}
else
{
time = insertionInfo.TourStartTime;
}
time += instance.GetDistance(insertionInfo.Start, customer, solution);
if (time > dueTime[customer])
{
tardiness += time - dueTime[customer];
}
if (time < readyTime[customer])
{
time += readyTime[customer] - time;
}
time += serviceTimes[customer];
time += instance.GetDistance(customer, insertionInfo.End, solution);
double additionalTime = time - (tourInsertionInfo.GetStopInsertionInfo(index) as CVRPTWInsertionInfo).ArrivalTime;
for (int i = index; i < tourInsertionInfo.GetStopCount(); i++)
{
CVRPTWInsertionInfo nextStop = tourInsertionInfo.GetStopInsertionInfo(i) as CVRPTWInsertionInfo;
if (demand >= 0)
{
if (nextStop.End == destination)
{
demand = 0;
costs -= pickupPenalty;
if (tourInsertionInfo.Penalty == pickupPenalty && tourFeasible)
{
feasible = true;
}
}
else if (nextStop.SpareCapacity < 0)
{
costs += demand * overloadPenalty;
}
else if (nextStop.SpareCapacity < demand)
{
tourFeasible = feasible = false;
costs += (demand - nextStop.SpareCapacity) * overloadPenalty;
}
}
else if (validPickup)
{
if (nextStop.SpareCapacity < 0)
{
costs += Math.Max(demand, nextStop.SpareCapacity) * overloadPenalty;
}
}
if (additionalTime < 0)
{
//arrive earlier than before
//wait probably
if (nextStop.WaitingTime < 0)
{
double wait = nextStop.WaitingTime - additionalTime;
if (wait > 0)
{
additionalTime += wait;
}
}
else
{
additionalTime = 0;
}
//check due date, decrease tardiness
if (nextStop.SpareTime < 0)
{
costs += Math.Max(nextStop.SpareTime, additionalTime) * tardinessPenalty;
}
}
else
{
//arrive later than before, probably don't have to wait
if (nextStop.WaitingTime > 0)
{
additionalTime -= Math.Min(additionalTime, nextStop.WaitingTime);
}
//check due date
if (nextStop.SpareTime > 0)
{
double spare = nextStop.SpareTime - additionalTime;
if (spare < 0)
{
tardiness += -spare;
}
}
else
{
tardiness += additionalTime;
}
}
}
costs += additionalTime * vrptw.TimeFactor.Value;
if (tardiness > 0)
{
tourFeasible = feasible = false;
}
costs += tardiness * tardinessPenalty;
return(costs);
}
protected override void EvaluateTour(VRPEvaluation eval, IVRPProblemInstance instance, Tour tour, IVRPEncoding solution)
{
TourInsertionInfo tourInfo = new TourInsertionInfo(solution.GetVehicleAssignment(solution.GetTourIndex(tour)));
eval.InsertionInfo.AddTourInsertionInfo(tourInfo);
double originalQuality = eval.Quality;
IHeterogenousCapacitatedProblemInstance cvrpInstance = instance as IHeterogenousCapacitatedProblemInstance;
DoubleArray demand = instance.Demand;
ITimeWindowedProblemInstance vrptw = instance as ITimeWindowedProblemInstance;
DoubleArray dueTime = vrptw.DueTime;
DoubleArray readyTime = vrptw.ReadyTime;
DoubleArray serviceTimes = vrptw.ServiceTime;
IMultiDepotProblemInstance mdp = instance as IMultiDepotProblemInstance;
IntArray vehicleAssignment = mdp.VehicleDepotAssignment;
int depots = mdp.Depots.Value;
double time = 0.0;
double waitingTime = 0.0;
double serviceTime = 0.0;
double tardiness = 0.0;
double delivered = 0.0;
double overweight = 0.0;
double distance = 0.0;
int tourIndex = solution.GetTourIndex(tour);
int vehicle = solution.GetVehicleAssignment(tourIndex);
int depot = vehicleAssignment[vehicle];
double capacity = cvrpInstance.Capacity[vehicle];
for (int i = 0; i < tour.Stops.Count; i++)
{
delivered += instance.GetDemand(tour.Stops[i]);
}
double spareCapacity = capacity - delivered;
double tourStartTime = vrptw.ReadyTime[depot];
time = tourStartTime;
//simulate a tour, start and end at depot
for (int i = 0; i <= tour.Stops.Count; i++)
{
int start = 0;
if (i > 0)
{
start = tour.Stops[i - 1];
}
int end = 0;
if (i < tour.Stops.Count)
{
end = tour.Stops[i];
}
//drive there
double currentDistace = vrptw.GetDistance(start, end, solution);
time += currentDistace;
distance += currentDistace;
double arrivalTime = time;
int endIndex;
if (end == 0)
{
endIndex = depot;
}
else
{
endIndex = end + depots - 1;
}
//check if it was serviced on time
if (time > dueTime[endIndex])
{
tardiness += time - dueTime[endIndex];
}
//wait
double currentWaitingTime = 0.0;
if (time < readyTime[endIndex])
{
currentWaitingTime = readyTime[endIndex] - time;
}
double waitTime = readyTime[endIndex] - time;
waitingTime += currentWaitingTime;
time += currentWaitingTime;
double spareTime = dueTime[endIndex] - time;
//service
double currentServiceTime = 0;
if (end > 0)
{
currentServiceTime = serviceTimes[end - 1];
}
serviceTime += currentServiceTime;
time += currentServiceTime;
CVRPTWInsertionInfo stopInfo = new CVRPTWInsertionInfo(start, end, spareCapacity, tourStartTime, arrivalTime, time, spareTime, waitTime);
tourInfo.AddStopInsertionInfo(stopInfo);
}
eval.Quality += instance.FleetUsageFactor.Value;
eval.Quality += instance.DistanceFactor.Value * distance;
eval.Distance += distance;
eval.VehicleUtilization += 1;
if (delivered > capacity)
{
overweight = delivered - capacity;
}
(eval as CVRPEvaluation).Overload += overweight;
double tourPenalty = 0;
double penalty = overweight * cvrpInstance.OverloadPenalty.Value;
eval.Penalty += penalty;
eval.Quality += penalty;
tourPenalty += penalty;
(eval as CVRPTWEvaluation).Tardiness += tardiness;
(eval as CVRPTWEvaluation).TravelTime += time;
penalty = tardiness * vrptw.TardinessPenalty.Value;
eval.Penalty += penalty;
eval.Quality += penalty;
tourPenalty += penalty;
eval.Quality += time * vrptw.TimeFactor.Value;
tourInfo.Penalty = tourPenalty;
tourInfo.Quality = eval.Quality - originalQuality;
}
protected override double GetTourInsertionCosts(IVRPProblemInstance instance, IVRPEncoding solution, TourInsertionInfo tourInsertionInfo, int index, int customer,
out bool feasible)
{
CVRPTWInsertionInfo insertionInfo = tourInsertionInfo.GetStopInsertionInfo(index) as CVRPTWInsertionInfo;
double costs = 0;
feasible = tourInsertionInfo.Penalty < double.Epsilon;
ICapacitatedProblemInstance cvrp = instance as ICapacitatedProblemInstance;
double overloadPenalty = cvrp.OverloadPenalty.Value;
ITimeWindowedProblemInstance vrptw = instance as ITimeWindowedProblemInstance;
DoubleArray dueTime = vrptw.DueTime;
DoubleArray readyTime = vrptw.ReadyTime;
DoubleArray serviceTimes = vrptw.ServiceTime;
double tardinessPenalty = vrptw.TardinessPenalty.Value;
IMultiDepotProblemInstance mdp = instance as IMultiDepotProblemInstance;
int depots = mdp.Depots.Value;
double startDistance, endDistance;
costs += instance.GetInsertionDistance(insertionInfo.Start, customer, insertionInfo.End, solution, out startDistance, out endDistance);
double demand = instance.GetDemand(customer);
if (demand > insertionInfo.SpareCapacity)
{
feasible = false;
if (insertionInfo.SpareCapacity >= 0)
{
costs += (demand - insertionInfo.SpareCapacity) * overloadPenalty;
}
else
{
costs += demand * overloadPenalty;
}
}
double time = 0;
double tardiness = 0;
if (index > 0)
{
time = (tourInsertionInfo.GetStopInsertionInfo(index - 1) as CVRPTWInsertionInfo).LeaveTime;
}
else
{
time = insertionInfo.TourStartTime;
}
time += startDistance;
int customerIndex = customer + depots - 1;
if (time > dueTime[customerIndex])
{
tardiness += time - dueTime[customerIndex];
}
if (time < readyTime[customerIndex])
{
time += readyTime[customerIndex] - time;
}
time += serviceTimes[customer - 1];
time += endDistance;
double additionalTime = time - (tourInsertionInfo.GetStopInsertionInfo(index) as CVRPTWInsertionInfo).ArrivalTime;
for (int i = index; i < tourInsertionInfo.GetStopCount(); i++)
{
CVRPTWInsertionInfo nextStop = tourInsertionInfo.GetStopInsertionInfo(i) as CVRPTWInsertionInfo;
if (additionalTime < 0)
{
//arrive earlier than before
//wait probably
if (nextStop.WaitingTime < 0)
{
double wait = nextStop.WaitingTime - additionalTime;
if (wait > 0)
{
additionalTime += wait;
}
}
else
{
additionalTime = 0;
}
//check due date, decrease tardiness
if (nextStop.SpareTime < 0)
{
costs += Math.Max(nextStop.SpareTime, additionalTime) * tardinessPenalty;
}
}
else
{
//arrive later than before, probably don't have to wait
if (nextStop.WaitingTime > 0)
{
additionalTime -= Math.Min(additionalTime, nextStop.WaitingTime);
}
//check due date
if (nextStop.SpareTime > 0)
{
double spare = nextStop.SpareTime - additionalTime;
if (spare < 0)
{
tardiness += -spare;
}
}
else
{
tardiness += additionalTime;
}
}
}
costs += additionalTime * vrptw.TimeFactor.Value;
if (tardiness > 0)
{
feasible = false;
}
costs += tardiness * tardinessPenalty;
return(costs);
}
