#region License Information /* HeuristicLab * Copyright (C) 2002-2010 Heuristic and Evolutionary Algorithms Laboratory (HEAL) * * This file is part of HeuristicLab. * * HeuristicLab is free software: you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation, either version 3 of the License, or * (at your option) any later version. * * HeuristicLab is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with HeuristicLab. If not, see . */ #endregion using System; using System.Collections.Generic; using System.Linq; using System.Text; using HeuristicLab.Problems.VehicleRouting.Interfaces; using HeuristicLab.Persistence.Default.CompositeSerializers.Storable; using HeuristicLab.Core; using HeuristicLab.Parameters; using HeuristicLab.Data; using HeuristicLab.Optimization; using HeuristicLab.PluginInfrastructure; using HeuristicLab.Problems.VehicleRouting.Variants; using HeuristicLab.Common; namespace HeuristicLab.Problems.VehicleRouting.ProblemInstances { [Item("MultiDepotVRPProblemInstance", "Represents a multi depot VRP instance.")] [StorableClass] public class MultiDepotVRPProblemInstance: VRPProblemInstance, IMultiDepotProblemInstance { protected IValueParameter DepotsParameter { get { return (IValueParameter)Parameters["Depots"]; } } protected IValueParameter VehicleDepotAssignmentParameter { get { return (IValueParameter)Parameters["VehicleDepotAssignment"]; } } public IntValue Depots { get { return DepotsParameter.Value; } } public IntArray VehicleDepotAssignment { get { return VehicleDepotAssignmentParameter.Value; } set { VehicleDepotAssignmentParameter.Value = value; } } protected override IEnumerable GetOperators() { return ApplicationManager.Manager.GetInstances().Cast(); } protected override IEnumerable GetAnalyzers() { return ApplicationManager.Manager.GetInstances() .Where(o => o is IAnalyzer) .Cast(); } public override IntValue Cities { get { return new IntValue(Demand.Length); } } protected override IVRPEvaluator Evaluator { get { return new MultiDepotVRPEvaluator(); } } protected override IVRPCreator Creator { get { return new HeuristicLab.Problems.VehicleRouting.Encodings.Alba.RandomCreator(); } } public override double GetDemand(int city) { return base.GetDemand(city - 1); } public override double[] GetCoordinates(int city) { double[] coordinates; if (city == 0) { //calculate centroid coordinates = new double[Coordinates.Columns]; for (int i = 0; i < Depots.Value; i++) { for (int j = 0; j < coordinates.Length; j++) { coordinates[j] += Coordinates[i, j]; } } for (int j = 0; j < coordinates.Length; j++) { coordinates[j] /= (double)Depots.Value; } } else { city += Depots.Value - 1; coordinates = base.GetCoordinates(city); } return coordinates; } public int GetDepot(int customer, IVRPEncoding solution) { int depot = -1; Tour tour = solution.GetTours().FirstOrDefault(t => t.Stops.Contains(customer)); if (tour != null) { int tourIndex = solution.GetTourIndex(tour); int vehicle = solution.GetVehicleAssignment(tourIndex); depot = VehicleDepotAssignment[vehicle]; } return depot; } public override double GetDistance(int start, int end, IVRPEncoding solution) { if (start == 0 && end == 0) return 0; if (start == 0) { start = GetDepot(end, solution); end += Depots.Value - 1; } else if (end == 0) { end = GetDepot(start, solution); start += Depots.Value - 1; } else { start += Depots.Value - 1; end += Depots.Value - 1; } return base.GetDistance(start, end, solution); } public override double GetInsertionDistance(int start, int customer, int end, IVRPEncoding solution, out double startDistance, out double endDistance) { if (start == 0) { start = GetDepot(end, solution); end += Depots.Value - 1; } else if (end == 0) { end = GetDepot(start, solution); start += Depots.Value - 1; } else { start += Depots.Value - 1; end += Depots.Value - 1; } customer += Depots.Value - 1; double distance = base.GetDistance(start, end, solution); startDistance = base.GetDistance(start, customer, solution); endDistance = base.GetDistance(customer, end, solution); double newDistance = startDistance + endDistance; return newDistance - distance; } [StorableConstructor] protected MultiDepotVRPProblemInstance(bool deserializing) : base(deserializing) { } public MultiDepotVRPProblemInstance() { Parameters.Add(new ValueParameter("Depots", "The number of depots", new IntValue(0))); Parameters.Add(new ValueParameter("VehicleDepotAssignment", "The assignment of vehicles to depots", new IntArray())); } public override IDeepCloneable Clone(Cloner cloner) { return new MultiDepotVRPProblemInstance(this, cloner); } protected MultiDepotVRPProblemInstance(MultiDepotVRPProblemInstance original, Cloner cloner) : base(original, cloner) { } } }