Free cookie consent management tool by TermsFeed Policy Generator

source: branches/PTSP/HeuristicLab.Problems.PTSP/3.3/Moves/TwoPointFiveOpt/StochasticTwoPointFiveSingleMoveGenerator.cs @ 14517

Last change on this file since 14517 was 13412, checked in by abeham, 9 years ago

#2221:

  • Completely refactored PTSP branch
    • Added two sets of problem instances based on TSPLIB: homogeneous and heterogeneous
    • Implemented missing EvaluateByCoordinates for 1-shift moves
    • Made it clear that move evaluators are for estimated PTSP only
    • Changed parameter realization from a rather strange list of list of ints to a list of bool arrays
    • Reusing code of the 2-opt and 1-shift move evaluators in 2.5 move evaluator
    • Introducing distance calculators to properly handle the case when no distance matrix is given (previous code only worked with distance matrix and without only with euclidean distance in some settings)
    • Fixed several smaller code issues: protected, static, method parameters, copy & paste, interfaces, naming, parameters, serialization hooks, license headers, doc comments, data types
File size: 3.1 KB
RevLine 
[12272]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 HeuristicLab.Common;
24using HeuristicLab.Core;
[13412]25using HeuristicLab.Encodings.PermutationEncoding;
[12272]26using HeuristicLab.Optimization;
27using HeuristicLab.Parameters;
28using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
29
30namespace HeuristicLab.Problems.PTSP {
[13412]31  [Item("Stochastic 2.5-SingleMoveGenerator", "Randomly samples a single from all possible inversion and shift moves (2.5-opt) from a given permutation.")]
[12272]32  [StorableClass]
[13412]33  public sealed class StochasticTwoPointFiveSingleMoveGenerator : TwoPointFiveMoveGenerator, IStochasticOperator, ISingleMoveGenerator {
[12272]34    public ILookupParameter<IRandom> RandomParameter {
35      get { return (ILookupParameter<IRandom>)Parameters["Random"]; }
36    }
37
38    [StorableConstructor]
[13412]39    private StochasticTwoPointFiveSingleMoveGenerator(bool deserializing) : base(deserializing) { }
40    private StochasticTwoPointFiveSingleMoveGenerator(StochasticTwoPointFiveSingleMoveGenerator original, Cloner cloner) : base(original, cloner) { }
41    public StochasticTwoPointFiveSingleMoveGenerator()
[12272]42      : base() {
43      Parameters.Add(new LookupParameter<IRandom>("Random", "The random number generator."));
44    }
45
46    public override IDeepCloneable Clone(Cloner cloner) {
[13412]47      return new StochasticTwoPointFiveSingleMoveGenerator(this, cloner);
[12272]48    }
49
50    public static TwoPointFiveMove Apply(Permutation permutation, IRandom random) {
51      int length = permutation.Length;
[13412]52      if (length == 1) throw new ArgumentException("Stochastic 2.5-SingleMoveGenerator: There cannot be an inversion move given a permutation of length 1.", "permutation");
[12272]53      int index1 = random.Next(length - 1);
54      int index2 = random.Next(index1 + 1, length);
55      if (permutation.PermutationType == PermutationTypes.RelativeUndirected) {
56        if (length > 3) {
57          while (index2 - index1 >= length - 2)
58            index2 = random.Next(index1 + 1, length);
59        }
60      }
61      bool isInvert = random.NextDouble() > 0.5;
62      return new TwoPointFiveMove(index1, index2, isInvert);
[13412]63
[12272]64    }
65
66    protected override TwoPointFiveMove[] GenerateMoves(Permutation permutation) {
[13412]67      return new[] { Apply(permutation, RandomParameter.ActualValue) };
[12272]68    }
69  }
70}
Note: See TracBrowser for help on using the repository browser.