1 | #region License Information
|
---|
2 | /* HeuristicLab
|
---|
3 | * Copyright (C) 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.Collections.Generic;
|
---|
23 | using System.Linq;
|
---|
24 | using HeuristicLab.Common;
|
---|
25 | using HeuristicLab.Core;
|
---|
26 | using HeuristicLab.Encodings.IntegerVectorEncoding;
|
---|
27 | using HEAL.Attic;
|
---|
28 |
|
---|
29 | namespace HeuristicLab.Encodings.ScheduleEncoding.PermutationWithRepetition {
|
---|
30 | [Item("PWRInsertionManipulator", "Represents a manipulation operation inserting parts of the individual at another position.")]
|
---|
31 | [StorableType("D2813869-42F7-4609-B7E0-4725E7565572")]
|
---|
32 | public class PWRInsertionManipulator : PWRManipulator {
|
---|
33 | [StorableConstructor]
|
---|
34 | protected PWRInsertionManipulator(StorableConstructorFlag _) : base(_) { }
|
---|
35 | protected PWRInsertionManipulator(PWRInsertionManipulator original, Cloner cloner) : base(original, cloner) { }
|
---|
36 | public PWRInsertionManipulator() : base() { }
|
---|
37 |
|
---|
38 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
39 | return new PWRInsertionManipulator(this, cloner);
|
---|
40 | }
|
---|
41 |
|
---|
42 | public static void Apply(IRandom random, PWREncoding individual) {
|
---|
43 | int cutIndex = random.Next(individual.PermutationWithRepetition.Length);
|
---|
44 | int insertIndex = random.Next(individual.PermutationWithRepetition.Length);
|
---|
45 | List<int> perm = ((IntegerVector)(individual.PermutationWithRepetition.Clone())).ToList<int>();
|
---|
46 | int aux = perm[cutIndex];
|
---|
47 | if (cutIndex > insertIndex) {
|
---|
48 | perm.RemoveAt(cutIndex);
|
---|
49 | perm.Insert(insertIndex, aux);
|
---|
50 | } else {
|
---|
51 | perm.Insert(insertIndex, aux);
|
---|
52 | perm.RemoveAt(cutIndex);
|
---|
53 | }
|
---|
54 | individual.PermutationWithRepetition = new IntegerVector(perm.ToArray());
|
---|
55 | }
|
---|
56 |
|
---|
57 | protected override void Manipulate(IRandom random, PWREncoding individual) {
|
---|
58 | Apply(random, individual);
|
---|
59 | }
|
---|
60 |
|
---|
61 | }
|
---|
62 | }
|
---|