Free cookie consent management tool by TermsFeed Policy Generator

source: branches/PersistenceOverhaul/HeuristicLab.Problems.VehicleRouting/3.4/ProblemInstances/VRPProblemInstance.cs @ 15287

Last change on this file since 15287 was 14712, checked in by gkronber, 8 years ago

#2520 added GUIDs for (almost) all interface types (probably still too many) also added newlines at end of all files

File size: 12.7 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
4 *
5 * This file is part of HeuristicLab.
6 *
7 * HeuristicLab is free software: you can redistribute it and/or modify
8 * it under the terms of the GNU General Public License as published by
9 * the Free Software Foundation, either version 3 of the License, or
10 * (at your option) any later version.
11 *
12 * HeuristicLab is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
15 * GNU General Public License for more details.
16 *
17 * You should have received a copy of the GNU General Public License
18 * along with HeuristicLab. If not, see <http://www.gnu.org/licenses/>.
19 */
20#endregion
21
22using System;
23using System.Collections.Generic;
24using System.Linq;
25using HeuristicLab.Common;
26using HeuristicLab.Core;
27using HeuristicLab.Data;
28using HeuristicLab.Parameters;
29using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
30using HeuristicLab.Problems.VehicleRouting.Encodings.General;
31using HeuristicLab.Problems.VehicleRouting.Interfaces;
32
33namespace HeuristicLab.Problems.VehicleRouting.ProblemInstances {
34  [Item("VRPProblemInstance", "Represents a VRP instance.")]
35  [StorableType("21C009D0-AE15-4516-91F3-76854C0B67E6")]
36  public abstract class VRPProblemInstance : ParameterizedNamedItem, IVRPProblemInstance, IStatefulItem {
37    IVRPEvaluator moveEvaluator;
38
39    private object locker = new object();
40
41    public IVRPEvaluator MoveEvaluator {
42      get {
43        lock (locker) {
44          if (evaluator == null)
45            return null;
46          else {
47            if (moveEvaluator == null) {
48              moveEvaluator = evaluator.Clone() as IVRPEvaluator;
49
50              foreach (IParameter parameter in moveEvaluator.Parameters) {
51                if (parameter is ILookupParameter
52                  && parameter != moveEvaluator.ProblemInstanceParameter
53                  && parameter != moveEvaluator.VRPToursParameter) {
54                  (parameter as ILookupParameter).ActualName =
55                    VRPMoveEvaluator.MovePrefix +
56                    (parameter as ILookupParameter).ActualName;
57                }
58              }
59            }
60
61            return moveEvaluator;
62          }
63        }
64      }
65    }
66
67    protected abstract IEnumerable<IOperator> GetOperators();
68    protected abstract IEnumerable<IOperator> GetAnalyzers();
69
70    public IEnumerable<IOperator> Operators {
71      get {
72        return GetOperators().Union(GetAnalyzers());
73      }
74    }
75
76    protected ValueParameter<DoubleMatrix> CoordinatesParameter {
77      get { return (ValueParameter<DoubleMatrix>)Parameters["Coordinates"]; }
78    }
79    protected OptionalValueParameter<DoubleMatrix> DistanceMatrixParameter {
80      get { return (OptionalValueParameter<DoubleMatrix>)Parameters["DistanceMatrix"]; }
81    }
82    protected ValueParameter<BoolValue> UseDistanceMatrixParameter {
83      get { return (ValueParameter<BoolValue>)Parameters["UseDistanceMatrix"]; }
84    }
85    protected ValueParameter<IntValue> VehiclesParameter {
86      get { return (ValueParameter<IntValue>)Parameters["Vehicles"]; }
87    }
88    protected ValueParameter<DoubleArray> DemandParameter {
89      get { return (ValueParameter<DoubleArray>)Parameters["Demand"]; }
90    }
91
92    protected IValueParameter<DoubleValue> FleetUsageFactorParameter {
93      get { return (IValueParameter<DoubleValue>)Parameters["EvalFleetUsageFactor"]; }
94    }
95    protected IValueParameter<DoubleValue> DistanceFactorParameter {
96      get { return (IValueParameter<DoubleValue>)Parameters["EvalDistanceFactor"]; }
97    }
98
99    public DoubleMatrix Coordinates {
100      get { return CoordinatesParameter.Value; }
101      set { CoordinatesParameter.Value = value; }
102    }
103
104    public DoubleMatrix DistanceMatrix {
105      get { return DistanceMatrixParameter.Value; }
106      set { DistanceMatrixParameter.Value = value; }
107    }
108    public BoolValue UseDistanceMatrix {
109      get { return UseDistanceMatrixParameter.Value; }
110      set { UseDistanceMatrixParameter.Value = value; }
111    }
112    public IntValue Vehicles {
113      get { return VehiclesParameter.Value; }
114      set { VehiclesParameter.Value = value; }
115    }
116    public DoubleArray Demand {
117      get { return DemandParameter.Value; }
118      set { DemandParameter.Value = value; }
119    }
120    public virtual IntValue Cities {
121      get { return new IntValue(Demand.Length); }
122    }
123
124    public DoubleValue FleetUsageFactor {
125      get { return FleetUsageFactorParameter.Value; }
126      set { FleetUsageFactorParameter.Value = value; }
127    }
128    public DoubleValue DistanceFactor {
129      get { return DistanceFactorParameter.Value; }
130      set { DistanceFactorParameter.Value = value; }
131    }
132
133    protected virtual double CalculateDistance(int start, int end) {
134      double distance = 0.0;
135
136      distance =
137          Math.Sqrt(
138            Math.Pow(Coordinates[start, 0] - Coordinates[end, 0], 2) +
139            Math.Pow(Coordinates[start, 1] - Coordinates[end, 1], 2));
140
141      return distance;
142    }
143
144    private DoubleMatrix CreateDistanceMatrix() {
145      DoubleMatrix distanceMatrix = new DoubleMatrix(Coordinates.Rows, Coordinates.Rows);
146
147      for (int i = 0; i < distanceMatrix.Rows; i++) {
148        for (int j = 0; j < distanceMatrix.Columns; j++) {
149          double distance = CalculateDistance(i, j);
150
151          distanceMatrix[i, j] = distance;
152        }
153      }
154
155      return distanceMatrix;
156    }
157
158    public virtual double[] GetCoordinates(int city) {
159      double[] coordinates = new double[Coordinates.Columns];
160
161      for (int i = 0; i < Coordinates.Columns; i++) {
162        coordinates[i] = Coordinates[city, i];
163      }
164
165      return coordinates;
166    }
167
168    public virtual double GetDemand(int city) {
169      return Demand[city];
170    }
171
172    //cache for performance improvement
173    private DoubleMatrix distanceMatrix = null;
174    private IVRPEvaluator evaluator = null;
175
176    public IVRPEvaluator SolutionEvaluator {
177      get {
178        return evaluator;
179      }
180
181      set {
182        lock (locker) {
183          moveEvaluator = null;
184          evaluator = value;
185          EvalBestKnownSolution();
186        }
187      }
188    }
189
190    public virtual double GetDistance(int start, int end, IVRPEncoding solution) {
191      if (distanceMatrix == null && UseDistanceMatrix.Value) {
192        if (DistanceMatrix == null) DistanceMatrix = CreateDistanceMatrix();
193        distanceMatrix = DistanceMatrix;
194      }
195
196      if (distanceMatrix != null) return distanceMatrix[start, end];
197      return CalculateDistance(start, end);
198    }
199
200    public virtual double GetInsertionDistance(int start, int customer, int end, IVRPEncoding solution,
201      out double startDistance, out double endDistance) {
202      double distance = GetDistance(start, end, solution);
203
204      startDistance = GetDistance(start, customer, solution);
205      endDistance = GetDistance(customer, end, solution);
206
207      double newDistance = startDistance + endDistance;
208
209      return newDistance - distance;
210    }
211
212    public bool Feasible(IVRPEncoding solution) {
213      return evaluator.Feasible(
214        evaluator.Evaluate(
215          this, solution));
216    }
217
218    public bool TourFeasible(Tour tour, IVRPEncoding solution) {
219      return evaluator.Feasible(
220        evaluator.EvaluateTour(
221        this, tour, solution));
222    }
223
224    public VRPEvaluation Evaluate(IVRPEncoding solution) {
225      return evaluator.Evaluate(this, solution);
226    }
227
228    public VRPEvaluation EvaluateTour(Tour tour, IVRPEncoding solution) {
229      return evaluator.EvaluateTour(this, tour, solution);
230    }
231
232    public bool Feasible(VRPEvaluation eval) {
233      return evaluator.Feasible(eval);
234    }
235
236    public double GetInsertionCosts(VRPEvaluation eval, IVRPEncoding solution, int customer, int tour, int index, out bool feasible) {
237      return evaluator.GetInsertionCosts(this, solution, eval, customer, tour, index, out feasible);
238    }
239
240
241    public event EventHandler EvaluationChanged;
242
243    protected void EvalBestKnownSolution() {
244      EventHandler tmp = EvaluationChanged;
245      if (tmp != null)
246        tmp(this, null);
247    }
248
249    protected abstract IVRPEvaluator Evaluator { get; }
250    protected abstract IVRPCreator Creator { get; }
251
252    [StorableConstructor]
253    protected VRPProblemInstance(bool deserializing) : base(deserializing) { }
254
255    public VRPProblemInstance()
256      : base() {
257      Parameters.Add(new ValueParameter<DoubleMatrix>("Coordinates", "The x- and y-Coordinates of the cities.", new DoubleMatrix()));
258      Parameters.Add(new OptionalValueParameter<DoubleMatrix>("DistanceMatrix", "The matrix which contains the distances between the cities."));
259      Parameters.Add(new ValueParameter<BoolValue>("UseDistanceMatrix", "True if a distance matrix should be calculated and used for evaluation, otherwise false.", new BoolValue(true)));
260      Parameters.Add(new ValueParameter<IntValue>("Vehicles", "The number of vehicles.", new IntValue(0)));
261      Parameters.Add(new ValueParameter<DoubleArray>("Demand", "The demand of each customer.", new DoubleArray()));
262
263      Parameters.Add(new ValueParameter<DoubleValue>("EvalFleetUsageFactor", "The fleet usage factor considered in the evaluation.", new DoubleValue(0)));
264      Parameters.Add(new ValueParameter<DoubleValue>("EvalDistanceFactor", "The distance factor considered in the evaluation.", new DoubleValue(1)));
265
266      evaluator = Evaluator;
267      AttachEventHandlers();
268    }
269
270    protected VRPProblemInstance(VRPProblemInstance original, Cloner cloner)
271      : base(original, cloner) {
272      evaluator = Evaluator;
273      AttachEventHandlers();
274    }
275
276    [StorableHook(HookType.AfterDeserialization)]
277    private void AfterDeserialization() {
278      evaluator = Evaluator;
279      AttachEventHandlers();
280    }
281
282    private void AttachEventHandlers() {
283      DistanceFactorParameter.ValueChanged += new EventHandler(DistanceFactorParameter_ValueChanged);
284      DistanceFactorParameter.Value.ValueChanged += new EventHandler(DistanceFactor_ValueChanged);
285      FleetUsageFactorParameter.ValueChanged += new EventHandler(FleetUsageFactorParameter_ValueChanged);
286      FleetUsageFactorParameter.Value.ValueChanged += new EventHandler(FleetUsageFactor_ValueChanged);
287      DistanceMatrixParameter.ValueChanged += new EventHandler(DistanceMatrixParameter_ValueChanged);
288      if (DistanceMatrix != null) {
289        DistanceMatrix.ItemChanged += new EventHandler<EventArgs<int, int>>(DistanceMatrix_ItemChanged);
290        DistanceMatrix.Reset += new EventHandler(DistanceMatrix_Reset);
291      }
292      UseDistanceMatrixParameter.ValueChanged += new EventHandler(UseDistanceMatrixParameter_ValueChanged);
293      UseDistanceMatrix.ValueChanged += new EventHandler(UseDistanceMatrix_ValueChanged);
294    }
295
296    public virtual void InitializeState() {
297    }
298
299    public virtual void ClearState() {
300    }
301
302    #region Event handlers
303    void DistanceFactorParameter_ValueChanged(object sender, EventArgs e) {
304      DistanceFactorParameter.Value.ValueChanged += new EventHandler(DistanceFactor_ValueChanged);
305      EvalBestKnownSolution();
306    }
307    void DistanceFactor_ValueChanged(object sender, EventArgs e) {
308      EvalBestKnownSolution();
309    }
310    void FleetUsageFactorParameter_ValueChanged(object sender, EventArgs e) {
311      FleetUsageFactorParameter.Value.ValueChanged += new EventHandler(FleetUsageFactor_ValueChanged);
312      EvalBestKnownSolution();
313    }
314    void FleetUsageFactor_ValueChanged(object sender, EventArgs e) {
315      EvalBestKnownSolution();
316    }
317    void DistanceMatrixParameter_ValueChanged(object sender, EventArgs e) {
318      if (DistanceMatrix != null) {
319        DistanceMatrix.ItemChanged += new EventHandler<EventArgs<int, int>>(DistanceMatrix_ItemChanged);
320        DistanceMatrix.Reset += new EventHandler(DistanceMatrix_Reset);
321      }
322      distanceMatrix = DistanceMatrix;
323      EvalBestKnownSolution();
324    }
325    void DistanceMatrix_Reset(object sender, EventArgs e) {
326      EvalBestKnownSolution();
327    }
328    void DistanceMatrix_ItemChanged(object sender, EventArgs<int, int> e) {
329      distanceMatrix = DistanceMatrix;
330      EvalBestKnownSolution();
331    }
332    void UseDistanceMatrixParameter_ValueChanged(object sender, EventArgs e) {
333      UseDistanceMatrix.ValueChanged += new EventHandler(UseDistanceMatrix_ValueChanged);
334      if (!UseDistanceMatrix.Value)
335        distanceMatrix = null;
336      EvalBestKnownSolution();
337    }
338    void UseDistanceMatrix_ValueChanged(object sender, EventArgs e) {
339      if (!UseDistanceMatrix.Value)
340        distanceMatrix = null;
341      EvalBestKnownSolution();
342    }
343    #endregion
344  }
345}
Note: See TracBrowser for help on using the repository browser.