Free cookie consent management tool by TermsFeed Policy Generator

source: trunk/sources/HeuristicLab.Problems.VehicleRouting/3.4/ProblemInstances/VRPProblemInstance.cs @ 8922

Last change on this file since 8922 was 8922, checked in by mkommend, 11 years ago

#1953: Refactored GetDistance method in VRPProblemInstace.

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