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.Core;
|
---|
24 | using HeuristicLab.Data;
|
---|
25 | using HeuristicLab.Optimization;
|
---|
26 | using HeuristicLab.Parameters;
|
---|
27 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
28 |
|
---|
29 | namespace HeuristicLab.Encodings.PermutationEncoding {
|
---|
30 | [Item("StochasticTwoOptSingleMoveGenerator", "Randomly samples a single from all possible 2-opt moves from a given permutation.")]
|
---|
31 | [StorableClass]
|
---|
32 | public class StochasticTwoOptSingleMoveGenerator : TwoOptMoveGenerator, IStochasticOperator, ISingleMoveGenerator {
|
---|
33 | public ILookupParameter<IRandom> RandomParameter {
|
---|
34 | get { return (ILookupParameter<IRandom>)Parameters["Random"]; }
|
---|
35 | }
|
---|
36 |
|
---|
37 | public StochasticTwoOptSingleMoveGenerator()
|
---|
38 | : base() {
|
---|
39 | Parameters.Add(new LookupParameter<IRandom>("Random", "The random number generator."));
|
---|
40 | }
|
---|
41 |
|
---|
42 | public static TwoOptMove Apply(Permutation permutation, IRandom random) {
|
---|
43 | int length = permutation.Length;
|
---|
44 | int index1 = random.Next(length - 1), index2;
|
---|
45 | if (index1 >= 2)
|
---|
46 | index2 = random.Next(index1 + 1, length);
|
---|
47 | else index2 = random.Next(index1 + 1, length - (2 - index1));
|
---|
48 | return new TwoOptMove(index1, index2);;
|
---|
49 | }
|
---|
50 |
|
---|
51 | protected override TwoOptMove[] GenerateMoves(Permutation permutation) {
|
---|
52 | IRandom random = RandomParameter.ActualValue;
|
---|
53 | return new TwoOptMove[] { Apply(permutation, random) };
|
---|
54 | }
|
---|
55 | }
|
---|
56 | }
|
---|