1 | #region License Information
|
---|
2 | /* HeuristicLab
|
---|
3 | * Copyright (C) 2002-2010 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 |
|
---|
22 | using System;
|
---|
23 | using HeuristicLab.Common;
|
---|
24 | using HeuristicLab.Core;
|
---|
25 | using HeuristicLab.Data;
|
---|
26 | using HeuristicLab.Optimization;
|
---|
27 | using HeuristicLab.Parameters;
|
---|
28 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
29 |
|
---|
30 | namespace HeuristicLab.Encodings.PermutationEncoding {
|
---|
31 | [Item("StochasticTranslocationSingleMoveGenerator", "Randomly samples one from all possible translocation and insertion moves (3-opt) from a given permutation.")]
|
---|
32 | [StorableClass]
|
---|
33 | public class StochasticTranslocationSingleMoveGenerator : TranslocationMoveGenerator, IStochasticOperator, ISingleMoveGenerator {
|
---|
34 | public ILookupParameter<IRandom> RandomParameter {
|
---|
35 | get { return (ILookupParameter<IRandom>)Parameters["Random"]; }
|
---|
36 | }
|
---|
37 |
|
---|
38 | public StochasticTranslocationSingleMoveGenerator()
|
---|
39 | : base() {
|
---|
40 | Parameters.Add(new LookupParameter<IRandom>("Random", "The random number generator."));
|
---|
41 | }
|
---|
42 |
|
---|
43 | public static TranslocationMove Apply(Permutation permutation, IRandom random) {
|
---|
44 | int length = permutation.Length;
|
---|
45 | if (length == 1) throw new ArgumentException("StochasticThreeOptSingleMoveGenerator: There cannot be an insertion move given a permutation of length 1.", "permutation");
|
---|
46 | if (permutation.PermutationType != PermutationTypes.Absolute && length == 2) return new TranslocationMove(0, 0, 1);
|
---|
47 | int index1, index2, index3;
|
---|
48 | do {
|
---|
49 | index1 = random.Next(length);
|
---|
50 | do {
|
---|
51 | index2 = random.Next(index1, length);
|
---|
52 | } while (index2 - index1 >= length - 2);
|
---|
53 | do {
|
---|
54 | index3 = random.Next(length - index2 + index1);
|
---|
55 | } while (index3 == index1);
|
---|
56 | } while (permutation.PermutationType != PermutationTypes.Absolute && (index1 == 0 && index3 == length - 1 || index1 == length - 1 && index3 == 0));
|
---|
57 | return new TranslocationMove(index1, index2, index3);
|
---|
58 | }
|
---|
59 |
|
---|
60 | protected override TranslocationMove[] GenerateMoves(Permutation permutation) {
|
---|
61 | IRandom random = RandomParameter.ActualValue;
|
---|
62 | return new TranslocationMove[] { Apply(permutation, random) };
|
---|
63 | }
|
---|
64 | }
|
---|
65 | }
|
---|