Free cookie consent management tool by TermsFeed Policy Generator

source: branches/HiveHiveEngine/HeuristicLab.Problems.VehicleRouting/3.3/Encodings/Potvin/Manipulators/PotvinManipulator.cs @ 13401

Last change on this file since 13401 was 7259, checked in by swagner, 13 years ago

Updated year of copyrights to 2012 (#1716)

File size: 4.5 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2012 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 HeuristicLab.Common;
23using HeuristicLab.Core;
24using HeuristicLab.Optimization;
25using HeuristicLab.Parameters;
26using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
27using HeuristicLab.Data;
28
29namespace HeuristicLab.Problems.VehicleRouting.Encodings.Potvin {
30  [Item("PotvinManipulator", "A VRP manipulation operation.")]
31  [StorableClass]
32  public abstract class PotvinManipulator : VRPManipulator, IStochasticOperator {
33    public ILookupParameter<IRandom> RandomParameter {
34      get { return (LookupParameter<IRandom>)Parameters["Random"]; }
35    }
36
37    public IValueParameter<BoolValue> AllowInfeasibleSolutions {
38      get { return (IValueParameter<BoolValue>)Parameters["AllowInfeasibleSolutions"]; }
39    }
40
41    [StorableHook(HookType.AfterDeserialization)]
42    private void AfterDeserialization() {
43      // BackwardsCompatibility3.3
44      #region Backwards compatible code (remove with 3.4)
45      if (!Parameters.ContainsKey("AllowInfeasibleSolutions")) {
46        Parameters.Add(new ValueParameter<BoolValue>("AllowInfeasibleSolutions", "Indicates if infeasible solutions should be allowed.", new BoolValue(false)));
47      }
48      #endregion
49    }
50
51    [StorableConstructor]
52    protected PotvinManipulator(bool deserializing) : base(deserializing) { }
53    protected PotvinManipulator(PotvinManipulator original, Cloner cloner)
54      : base(original, cloner) {
55    }
56    public PotvinManipulator() {
57      Parameters.Add(new LookupParameter<IRandom>("Random", "The pseudo random number generator which should be used for stochastic manipulation operators."));
58      Parameters.Add(new ValueParameter<BoolValue>("AllowInfeasibleSolutions", "Indicates if infeasible solutions should be allowed.", new BoolValue(false)));
59    }
60
61    protected abstract void Manipulate(IRandom random, PotvinEncoding individual);
62
63    protected static int SelectRandomTourBiasedByLength(IRandom random, PotvinEncoding individual) {
64      int tourIndex = -1;
65
66      double sum = 0.0;
67      double[] probabilities = new double[individual.Tours.Count];
68      for (int i = 0; i < individual.Tours.Count; i++) {
69        probabilities[i] = 1.0 / ((double)individual.Tours[i].Cities.Count / (double)individual.Cities);
70        sum += probabilities[i];
71      }
72
73      for (int i = 0; i < probabilities.Length; i++)
74        probabilities[i] = probabilities[i] / sum;
75
76      double rand = random.NextDouble();
77      double cumulatedProbabilities = 0.0;
78      int index = 0;
79      while (tourIndex == -1 && index < probabilities.Length) {
80        if (cumulatedProbabilities <= rand && rand <= cumulatedProbabilities + probabilities[index])
81          tourIndex = index;
82
83        cumulatedProbabilities += probabilities[index];
84        index++;
85      }
86
87      return tourIndex;
88    }
89
90    protected static bool FindInsertionPlace(PotvinEncoding individual, int city, int routeToAvoid,
91      DoubleArray dueTime, DoubleArray serviceTime, DoubleArray readyTime, DoubleArray demand,
92      DoubleValue capacity, DistanceMatrix distMatrix,  bool allowInfeasible,
93      out int route, out int place) {
94      return individual.FindInsertionPlace(
95        dueTime, serviceTime, readyTime,
96        demand, capacity, distMatrix,
97        city, routeToAvoid, allowInfeasible,
98        out route, out place);
99    }
100     
101
102    public override IOperation Apply() {
103      IVRPEncoding solution = VRPToursParameter.ActualValue;
104      if (!(solution is PotvinEncoding)) {
105        VRPToursParameter.ActualValue = PotvinEncoding.ConvertFrom(solution, DistanceMatrixParameter);
106      }
107
108      Manipulate(RandomParameter.ActualValue, VRPToursParameter.ActualValue as PotvinEncoding);
109
110      return base.Apply();
111    }
112  }
113}
Note: See TracBrowser for help on using the repository browser.