Free cookie consent management tool by TermsFeed Policy Generator

source: branches/GeneralizedQAP/HeuristicLab.Problems.GeneralizedQuadraticAssignment/3.3/Evaluation/GQAPNMoveEvaluator.cs @ 15507

Last change on this file since 15507 was 15507, checked in by abeham, 5 years ago

#1614:

  • fixed some bugs introduced in last commit (project file, tests)
  • fixed ApproximateLocalSearch due to change in move evaluator that outputs an absolute quality of the move and not a delta
  • added evaluated solution counting to approximate local search
  • GRASP+PR: restructured main loop and combined iteration initialization with variable creator outside
File size: 6.5 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2017 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.Linq;
24using HeuristicLab.Common;
25using HeuristicLab.Core;
26using HeuristicLab.Data;
27using HeuristicLab.Encodings.IntegerVectorEncoding;
28using HeuristicLab.Operators;
29using HeuristicLab.Parameters;
30using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
31
32namespace HeuristicLab.Problems.GeneralizedQuadraticAssignment {
33  [Item("N-Move Evaluator", "Evaluates an N-Move.")]
34  [StorableClass]
35  public class GQAPNMoveEvaluator : SingleSuccessorOperator, IGQAPNMoveEvaluator,
36    IQualityAwareGQAPOperator, IProblemInstanceAwareGQAPOperator, IAssignmentAwareGQAPOperator {
37
38    #region Parameter Descriptions
39    public static readonly string MoveQualityDescription = "The quality of the move if it would be applied.";
40    public static readonly string MoveEvaluationDescription = "The results of evaluating the move.";
41    #endregion
42
43    #region Parameter Properties
44    public ILookupParameter<DoubleValue> MoveQualityParameter {
45      get { return (ILookupParameter<DoubleValue>)Parameters["MoveQuality"]; }
46    }
47    public ILookupParameter<Evaluation> MoveEvaluationParameter {
48      get { return (ILookupParameter<Evaluation>)Parameters["MoveEvaluation"]; }
49    }
50    public ILookupParameter<NMove> MoveParameter {
51      get { return (ILookupParameter<NMove>)Parameters["Move"]; }
52    }
53    public ILookupParameter<IntegerVector> AssignmentParameter {
54      get { return (ILookupParameter<IntegerVector>)Parameters["Assignment"]; }
55    }
56    public ILookupParameter<DoubleValue> QualityParameter {
57      get { return (ILookupParameter<DoubleValue>)Parameters["Quality"]; }
58    }
59    public ILookupParameter<Evaluation> EvaluationParameter {
60      get { return (ILookupParameter<Evaluation>)Parameters["Evaluation"]; }
61    }
62    public ILookupParameter<GQAPInstance> ProblemInstanceParameter {
63      get { return (ILookupParameter<GQAPInstance>)Parameters["ProblemInstance"]; }
64    }
65    #endregion
66
67    [StorableConstructor]
68    protected GQAPNMoveEvaluator(bool deserializing) : base(deserializing) { }
69    protected GQAPNMoveEvaluator(GQAPNMoveEvaluator original, Cloner cloner) : base(original, cloner) { }
70    public GQAPNMoveEvaluator()
71      : base() {
72      Parameters.Add(new LookupParameter<IntegerVector>("Assignment", GQAPSolutionCreator.AssignmentDescription));
73      Parameters.Add(new LookupParameter<NMove>("Move", GQAPNMoveGenerator.MoveDescription));
74      Parameters.Add(new LookupParameter<DoubleValue>("Quality", ""));
75      Parameters.Add(new LookupParameter<Evaluation>("Evaluation", GQAP.EvaluationDescription));
76      Parameters.Add(new LookupParameter<DoubleValue>("MoveQuality", MoveQualityDescription));
77      Parameters.Add(new LookupParameter<Evaluation>("MoveEvaluation", MoveEvaluationDescription));
78      Parameters.Add(new LookupParameter<GQAPInstance>("ProblemInstance", GQAP.ProblemInstanceDescription));
79    }
80
81    public override IDeepCloneable Clone(Cloner cloner) {
82      return new GQAPNMoveEvaluator(this, cloner);
83    }
84
85    public static Evaluation Evaluate(NMove move, IntegerVector assignment, Evaluation evaluation, GQAPInstance problemInstance) {
86      int moves = move.N;
87      var newEvaluation = new Evaluation() {
88        ExcessDemand = evaluation.ExcessDemand,
89        FlowCosts = evaluation.FlowCosts,
90        InstallationCosts = evaluation.InstallationCosts,
91        Slack = evaluation.Slack.ToArray()
92      };
93      foreach (var kvp in move.NewAssignments) {
94        int equip = kvp.Key;
95        int newLoc = kvp.Value;
96        int oldLoc = assignment[equip];
97        var equipDemand = problemInstance.Demands[equip];
98        newEvaluation.InstallationCosts -= problemInstance.InstallationCosts[equip, oldLoc];
99        newEvaluation.InstallationCosts += problemInstance.InstallationCosts[equip, newLoc];
100        for (int j = 0; j < assignment.Length; j++) {
101          if (!move.NewAssignments.ContainsKey(j)) {
102            newEvaluation.FlowCosts += problemInstance.Weights[equip, j] * problemInstance.Distances[newLoc, assignment[j]];
103            newEvaluation.FlowCosts -= problemInstance.Weights[equip, j] * problemInstance.Distances[oldLoc, assignment[j]];
104            newEvaluation.FlowCosts += problemInstance.Weights[j, equip] * problemInstance.Distances[assignment[j], newLoc];
105            newEvaluation.FlowCosts -= problemInstance.Weights[j, equip] * problemInstance.Distances[assignment[j], oldLoc];
106          } else {
107            newEvaluation.FlowCosts += problemInstance.Weights[equip, j] * problemInstance.Distances[newLoc, move.NewAssignments[j]];
108            newEvaluation.FlowCosts -= problemInstance.Weights[equip, j] * problemInstance.Distances[oldLoc, assignment[j]];
109          }
110        }
111        newEvaluation.Slack[oldLoc] += equipDemand;
112        if (newEvaluation.Slack[oldLoc] < equipDemand)
113          newEvaluation.ExcessDemand -= Math.Min(equipDemand, equipDemand - newEvaluation.Slack[oldLoc]);
114        newEvaluation.Slack[newLoc] -= equipDemand;
115        if (newEvaluation.Slack[newLoc] < 0)
116          newEvaluation.ExcessDemand += Math.Min(equipDemand, -newEvaluation.Slack[newLoc]);
117      }
118
119      return newEvaluation;
120    }
121
122    public override IOperation Apply() {
123      var problemInstance = ProblemInstanceParameter.ActualValue;
124      var evaluation = EvaluationParameter.ActualValue;
125
126      var moveEvaluation = Evaluate(MoveParameter.ActualValue,
127               AssignmentParameter.ActualValue,
128               evaluation,
129               problemInstance);
130
131      MoveEvaluationParameter.ActualValue = moveEvaluation;
132      MoveQualityParameter.ActualValue = new DoubleValue(problemInstance.ToSingleObjective(moveEvaluation));
133      return base.Apply();
134    }
135  }
136}
Note: See TracBrowser for help on using the repository browser.