Free cookie consent management tool by TermsFeed Policy Generator

Ignore:
Timestamp:
11/24/15 17:08:13 (9 years ago)
Author:
ascheibe
Message:

#2520 added guids to storable classes

Location:
branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3
Files:
69 edited

Legend:

Unmodified
Added
Removed
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Creators/RandomPermutationCreator.cs

    r12012 r13368  
    3333  /// </summary>
    3434  [Item("RandomPermutationCreator", "An operator which creates a new random permutation of integer values.")]
    35   [StorableClass]
     35  [StorableClass("A1067375-67E4-4BBE-B7C1-08614C0FB608")]
    3636  public sealed class RandomPermutationCreator : InstrumentedOperator, IPermutationCreator, IStochasticOperator {
    3737    public override bool CanChangeName {
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Crossovers/CosaCrossover.cs

    r12012 r13368  
    3636  /// </remarks>
    3737  [Item("CosaCrossover", "An operator which performs the crossover described in the COSA optimization method. It is implemented as described in Wendt, O. 1994. COSA: COoperative Simulated Annealing - Integration von Genetischen Algorithmen und Simulated Annealing am Beispiel der Tourenplanung. Dissertation Thesis. IWI Frankfurt.")]
    38   [StorableClass]
     38  [StorableClass("BE89CCF0-FABE-470A-B3BA-B59A217CDAE4")]
    3939  public class CosaCrossover : PermutationCrossover {
    4040    [StorableConstructor]
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Crossovers/CyclicCrossover.cs

    r12012 r13368  
    3333  /// </remarks>
    3434  [Item("CyclicCrossover", "An operator which performs the cyclic crossover on two permutations. It is implemented as described in Eiben, A.E. and Smith, J.E. 2003. Introduction to Evolutionary Computation. Natural Computing Series, Springer-Verlag Berlin Heidelberg.")]
    35   [StorableClass]
     35  [StorableClass("8B5253AD-59D8-4B36-B9A0-8D0EDB406807")]
    3636  public class CyclicCrossover : PermutationCrossover {
    3737    [StorableConstructor]
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Crossovers/CyclicCrossover2.cs

    r12012 r13368  
    3434  /// </remarks>
    3535  [Item("CyclicCrossover2", "An operator which performs the cyclic crossover on two permutations. It is implemented as described in Affenzeller, M. et al. 2009. Genetic Algorithms and Genetic Programming - Modern Concepts and Practical Applications. CRC Press. p. 136.")]
    36   [StorableClass]
     36  [StorableClass("2C7684AA-EA65-4CDB-B926-450D381CE735")]
    3737  public class CyclicCrossover2 : PermutationCrossover {
    3838    [StorableConstructor]
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Crossovers/EdgeRecombinationCrossover.cs

    r12012 r13368  
    3636  /// </remarks>
    3737  [Item("EdgeRecombinationCrossover", "An operator which performs the edge recombination crossover on two permutations. It is implemented as described in Whitley et.al. 1991, The Traveling Salesman and Sequence Scheduling, in Davis, L. (Ed.), Handbook of Genetic Algorithms, New York, pp. 350-372.")]
    38   [StorableClass]
     38  [StorableClass("507E1E1C-6A26-4222-ABEB-9B3B16A0FD31")]
    3939  public class EdgeRecombinationCrossover : PermutationCrossover {
    4040    [StorableConstructor]
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Crossovers/MaximalPreservativeCrossover.cs

    r12012 r13368  
    3030  /// Performs a crossover between two permuation arrays by preserving a large number of edges in both parents.
    3131  /// The operator also maintains the position in the arrays to some extent.
    32   /// It is implemented as described in Mühlenbein, H. 1991. Evolution in time and space - the parallel genetic algorithm. FOUNDATIONS OF GENETIC ALGORITHMS, pp. 316-337. Morgan Kaufmann.<br /><br />
     32  /// It is implemented as described in Mï¿œhlenbein, H. 1991. Evolution in time and space - the parallel genetic algorithm. FOUNDATIONS OF GENETIC ALGORITHMS, pp. 316-337. Morgan Kaufmann.<br /><br />
    3333  /// The length of the segment copied from the first parent to the offspring is uniformly distributed in the interval [3;N/3) with N = length of the permutation.
    34   /// This recommendation is mentioned in Pohlheim, H. 1999. Evolutionäre Algorithmen: Verfahren, Operatoren und Hinweise für die Praxis, p. 44, Springer.
     34  /// This recommendation is mentioned in Pohlheim, H. 1999. Evolutionï¿œre Algorithmen: Verfahren, Operatoren und Hinweise fï¿œr die Praxis, p. 44, Springer.
    3535  /// If the length of the permutation is smaller than 15, the size of the segment is always equal to 3.
    3636  /// </remarks>
    37   [Item("MaximalPreservativeCrossover", "An operator which performs the maximal preservative crossover on two permutations. It is implemented as described in Mühlenbein, H. 1991. Evolution in time and space - the parallel genetic algorithm. FOUNDATIONS OF GENETIC ALGORITHMS, pp. 316-337. Morgan Kaufmann.")]
    38   [StorableClass]
     37  [Item("MaximalPreservativeCrossover", "An operator which performs the maximal preservative crossover on two permutations. It is implemented as described in Mï¿œhlenbein, H. 1991. Evolution in time and space - the parallel genetic algorithm. FOUNDATIONS OF GENETIC ALGORITHMS, pp. 316-337. Morgan Kaufmann.")]
     38  [StorableClass("5F971E2A-6209-42F4-856D-8ED7C47345EC")]
    3939  public class MaximalPreservativeCrossover : PermutationCrossover {
    4040    [StorableConstructor]
     
    7171      int breakPoint1, breakPoint2, subsegmentLength, index;
    7272
    73       subsegmentLength = random.Next(3, Math.Max(length / 3, 4)); // as mentioned in Pohlheim, H. Evolutionäre Algorithmen: Verfahren, Operatoren und Hinweise für die Praxis, 1999, p.44, Springer.
     73      subsegmentLength = random.Next(3, Math.Max(length / 3, 4)); // as mentioned in Pohlheim, H. Evolutionï¿œre Algorithmen: Verfahren, Operatoren und Hinweise fï¿œr die Praxis, 1999, p.44, Springer.
    7474      breakPoint1 = random.Next(length);
    7575      breakPoint2 = breakPoint1 + subsegmentLength;
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Crossovers/MultiPermutationCrossover.cs

    r12012 r13368  
    1 #region License Information
     1#region License Information
    22/* HeuristicLab
    33 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
     
    3333namespace HeuristicLab.Encodings.PermutationEncoding {
    3434  [Item("MultiPermutationCrossover", "Randomly selects and applies one of its crossovers every time it is called.")]
    35   [StorableClass]
     35  [StorableClass("F350D445-AB72-4B38-91A1-961A9D24141A")]
    3636  public class MultiPermutationCrossover : StochasticMultiBranch<IPermutationCrossover>, IPermutationCrossover, IStochasticOperator {
    3737    public override bool CanChangeName {
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Crossovers/OrderBasedCrossover.cs

    r12012 r13368  
    3636  /// </remarks>
    3737  [Item("OrderBasedCrossover", "An operator which performs an order based crossover of two permutations. It is implemented as described in Syswerda, G. (1991). Schedule Optimization Using Genetic Algorithms. In Davis, L. (Ed.) Handbook of Genetic Algorithms, Van Nostrand Reinhold, New York, pp. 332-349.")]
    38   [StorableClass]
     38  [StorableClass("A1E0EEE1-2DD6-49D6-BA9E-181AF690EE05")]
    3939  public class OrderBasedCrossover : PermutationCrossover {
    4040    [StorableConstructor]
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Crossovers/OrderCrossover.cs

    r12012 r13368  
    3636  /// </remarks>
    3737  [Item("OrderCrossover", "An operator which performs an order crossover of two permutations. It is implemented as described in Eiben, A.E. and Smith, J.E. 2003. Introduction to Evolutionary Computation. Natural Computing Series, Springer-Verlag Berlin Heidelberg.")]
    38   [StorableClass]
     38  [StorableClass("4DE9904A-8F55-477B-AA50-742EADC289BF")]
    3939  public class OrderCrossover : PermutationCrossover {
    4040    [StorableConstructor]
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Crossovers/OrderCrossover2.cs

    r12012 r13368  
    1 #region License Information
     1#region License Information
    22/* HeuristicLab
    33 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
     
    3535  /// </remarks>
    3636  [Item("OrderCrossover2", "An operator which performs an order crossover of two permutations. It is implemented as described in Affenzeller, M. et al. 2009. Genetic Algorithms and Genetic Programming - Modern Concepts and Practical Applications. CRC Press. p. 135.")]
    37   [StorableClass]
     37  [StorableClass("E532BE44-AD31-447A-B831-1BF8C7DD820A")]
    3838  public class OrderCrossover2 : PermutationCrossover {
    3939    [StorableConstructor]
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Crossovers/PartiallyMatchedCrossover.cs

    r12012 r13368  
    3535  /// </remarks>
    3636  [Item("PartiallyMatchedCrossover", "An operator which performs the partially matched crossover on two permutations. It is implemented as described in Fogel, D.B. 1988. An Evolutionary Approach to the Traveling Salesman Problem. Biological Cybernetics, 60, pp. 139-144, Springer-Verlag.")]
    37   [StorableClass]
     37  [StorableClass("3FDE28EB-89D3-414F-8149-30D3AABA74D3")]
    3838  public class PartiallyMatchedCrossover : PermutationCrossover {
    3939    [StorableConstructor]
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Crossovers/PositionBasedCrossover.cs

    r12012 r13368  
    3333  /// </remarks>
    3434  [Item("PositionBasedCrossover", "An operator which performs the position based crossover on two permutations. It is implemented as described in Syswerda, G. (1991). Schedule Optimization Using Genetic Algorithms. In Davis, L. (Ed.) Handbook of Genetic Algorithms, Van Nostrand Reinhold, New York, pp 332-349.")]
    35   [StorableClass]
     35  [StorableClass("9DD9F0BF-8F31-49F6-B12D-14B8E9DF9919")]
    3636  public class PositionBasedCrossover : PermutationCrossover {
    3737    [StorableConstructor]
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Crossovers/UniformLikeCrossover.cs

    r12012 r13368  
    1 #region License Information
     1#region License Information
    22/* HeuristicLab
    33 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
     
    2828namespace HeuristicLab.Encodings.PermutationEncoding {
    2929  [Item("UniformLikeCrossover", "The ULX crossover tries to maintain the position in the permutation. It randomly chooses from left to right one of its parents' alleles at each position. Missing entries are then filled randomly later. It is described in Tate, D. M. and Smith, A. E. 1995. A genetic approach to the quadratic assignment problem. Computers & Operations Research, vol. 22, pp. 73-83.")]
    30   [StorableClass]
     30  [StorableClass("B4A26500-F8D1-410A-BBE3-999CB472DF30")]
    3131  public sealed class UniformLikeCrossover : PermutationCrossover {
    3232    [StorableConstructor]
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Manipulators/InsertionManipulator.cs

    r12012 r13368  
    3232  /// </remarks>
    3333  [Item("InsertionManipulator", "An operator which moves randomly one element to another position in the permutation (Insertion is a special case of Translocation). It is implemented as described in Fogel, D.B. (1988). An Evolutionary Approach to the Traveling Salesman Problem, Biological Cybernetics, 60, pp. 139-144.")]
    34   [StorableClass]
     34  [StorableClass("8D065EDE-FAA8-4897-9F3B-D7B173B08C99")]
    3535  public class InsertionManipulator : PermutationManipulator {
    3636    [StorableConstructor]
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Manipulators/InversionManipulator.cs

    r12012 r13368  
    3232  /// </remarks>
    3333  [Item("InversionManipulator", "An operator which inverts a randomly chosen part of a permutation. It is implemented as described in Eiben, A.E. and Smith, J.E. 2003. Introduction to Evolutionary Computation. Natural Computing Series, Springer-Verlag Berlin Heidelberg.")]
    34   [StorableClass]
     34  [StorableClass("2D646103-07DE-4670-8639-32ABFF65D59C")]
    3535  public class InversionManipulator : PermutationManipulator {
    3636    [StorableConstructor]
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Manipulators/MultiPermutationManipulator.cs

    r12012 r13368  
    1 #region License Information
     1#region License Information
    22/* HeuristicLab
    33 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
     
    3333namespace HeuristicLab.Encodings.PermutationEncoding {
    3434  [Item("MultiPermutationManipulator", "Randomly selects and applies one of its manipulators every time it is called.")]
    35   [StorableClass]
     35  [StorableClass("A7EB272E-7E7F-443F-80B2-CF2FAA2908CC")]
    3636  public class MultiPermutationManipulator : StochasticMultiBranch<IPermutationManipulator>, IPermutationManipulator, IStochasticOperator {
    3737    public override bool CanChangeName {
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Manipulators/ScrambleManipulator.cs

    r12012 r13368  
    3232  /// </remarks>
    3333  [Item("ScrambleManipulator", "An operator which manipulates a permutation array by randomly scrambling the elements in a randomly chosen interval. It is implemented as described in Syswerda, G. (1991). Schedule Optimization Using Genetic Algorithms. In Davis, L. (Ed.) Handbook of Genetic Algorithms, Van Nostrand Reinhold, New York, pp 332-349.")]
    34   [StorableClass]
     34  [StorableClass("AE531E97-67E3-45EB-83A0-4140BEAE4E01")]
    3535  public class ScrambleManipulator : PermutationManipulator {
    3636    [StorableConstructor]
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Manipulators/Swap2Manipulator.cs

    r12012 r13368  
    3232  /// </remarks>
    3333  [Item("Swap2Manipulator", "An operator which manipulates a permutation array by swapping to randomly chosen elements. It is implemented as described in Eiben, A.E. and Smith, J.E. 2003. Introduction to Evolutionary Computation. Natural Computing Series, Springer-Verlag Berlin Heidelberg.")]
    34   [StorableClass]
     34  [StorableClass("FC6767C1-092D-4FAD-9649-7423B6DB51BC")]
    3535  public class Swap2Manipulator : PermutationManipulator {
    3636    [StorableConstructor]
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Manipulators/Swap3Manipulator.cs

    r12012 r13368  
    3434  /// </remarks>
    3535  [Item("Swap3Manipulator", "An operator which manipulates a permutation array by swaping three randomly chosen elements. It is implemented such that first 3 positions are randomly chosen in the interval [0;N) with N = length of the permutation with all positions being distinct from each other. Then position 1 is put in place of position 3, position 2 is put in place of position 1 and position 3 is put in place of position 2.")]
    36   [StorableClass]
     36  [StorableClass("0D8FC9A9-9A67-4078-BF13-1DA7F9D87F17")]
    3737  public class Swap3Manipulator : PermutationManipulator {
    3838    [StorableConstructor]
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Manipulators/TranslocationInversionManipulator.cs

    r12012 r13368  
    3333  /// </remarks>
    3434  [Item("TranslocationInversionManipulator", "An operator which inverts a randomly chosen part of a permutation and inserts it at a random position. It is implemented as described in Fogel, D.B. 1993. Applying Evolutionary Programming to Selected TSP Problems, Cybernetics and Systems, 22, pp. 27-36.")]
    35   [StorableClass]
     35  [StorableClass("43FDF4D2-A588-4997-B689-AB239859CC7A")]
    3636  public class TranslocationInversionManipulator : PermutationManipulator {
    3737    [StorableConstructor]
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Manipulators/TranslocationManipulator.cs

    r12012 r13368  
    3333  /// </remarks>
    3434  [Item("TranslocationManipulator", "An operator which Manipulates a permutation array by moving a randomly chosen interval of elements to another (randomly chosen) position in the array. It is implemented as described in Michalewicz, Z. 1992. Genetic Algorithms + Data Structures = Evolution Programs, Springer Verlag, Berlin Heidelberg.")]
    35   [StorableClass]
     35  [StorableClass("B2E7ABA7-22EA-43D0-A2A6-B3E237DA0241")]
    3636  public class TranslocationManipulator : PermutationManipulator {
    3737    [StorableConstructor]
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Moves/Edge.cs

    r12012 r13368  
    1 #region License Information
     1#region License Information
    22/* HeuristicLab
    33 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
     
    2626namespace HeuristicLab.Encodings.PermutationEncoding {
    2727  [Item("Edge", "An edge between two integer nodes and a flag for the direction.")]
    28   [StorableClass]
     28  [StorableClass("D680CEE9-7AD1-4B9C-BCF1-6A164B419134")]
    2929  public class Edge : Item {
    3030    [Storable]
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Moves/PermutationMoveAttribute.cs

    r12012 r13368  
    1 #region License Information
     1#region License Information
    22/* HeuristicLab
    33 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
     
    2626namespace HeuristicLab.Encodings.PermutationEncoding {
    2727  [Item("PermutationMoveAttribute", "Base class for specifying a move attribute")]
    28   [StorableClass]
     28  [StorableClass("C4A12864-0A1D-4F1F-9344-0799C5FBA743")]
    2929  public class PermutationMoveAttribute : Item {
    3030    [Storable]
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Moves/Scramble/ScrambleMove.cs

    r12012 r13368  
    1 #region License Information
     1#region License Information
    22/* HeuristicLab
    33 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
     
    2626namespace HeuristicLab.Encodings.PermutationEncoding {
    2727  [Item("ScrambleMove", "Item that describes a scramble move.")]
    28   [StorableClass]
     28  [StorableClass("F476B122-D942-4E3D-AE60-232038E1B587")]
    2929  public sealed class ScrambleMove : Item {
    3030    [Storable]
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Moves/Scramble/ScrambleMoveGenerator.cs

    r12012 r13368  
    1 #region License Information
     1#region License Information
    22/* HeuristicLab
    33 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
     
    2929namespace HeuristicLab.Encodings.PermutationEncoding {
    3030  [Item("ScrambleMoveGenerator", "Base class for all scramble move generators.")]
    31   [StorableClass]
     31  [StorableClass("52F3D879-3375-4623-91D7-CA2A515493BC")]
    3232  public abstract class ScrambleMoveGenerator : SingleSuccessorOperator, IPermutationScrambleMoveOperator, IMoveGenerator {
    3333    public override bool CanChangeName {
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Moves/Scramble/ScrambleMoveMaker.cs

    r12012 r13368  
    1 #region License Information
     1#region License Information
    22/* HeuristicLab
    33 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
     
    3030namespace HeuristicLab.Encodings.PermutationEncoding {
    3131  [Item("ScrambleMoveMaker", "Peforms a scramble move on a given permutation and updates the quality.")]
    32   [StorableClass]
     32  [StorableClass("4EC7AAF2-33BE-4CB8-A9C1-FB913496EA3B")]
    3333  public class ScrambleMoveMaker : SingleSuccessorOperator, IPermutationScrambleMoveOperator, IMoveMaker, ISingleObjectiveOperator {
    3434    public override bool CanChangeName {
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Moves/Scramble/StochasticScrambleMultiMoveGenerator.cs

    r12012 r13368  
    1 #region License Information
     1#region License Information
    22/* HeuristicLab
    33 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
     
    3131namespace HeuristicLab.Encodings.PermutationEncoding {
    3232  [Item("StochasticScrambleMultiMoveGenerator", "Randomly samples n from all possible scramble moves from a given permutation.")]
    33   [StorableClass]
     33  [StorableClass("3BB4C6C6-7984-4423-A6FE-58394E5C528B")]
    3434  public class StochasticScrambleMultiMoveGenerator : ScrambleMoveGenerator, IMultiMoveGenerator, IStochasticOperator {
    3535    public ILookupParameter<IRandom> RandomParameter {
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Moves/Swap2/ExhaustiveSwap2MoveGenerator.cs

    r12012 r13368  
    1 #region License Information
     1#region License Information
    22/* HeuristicLab
    33 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
     
    2929namespace HeuristicLab.Encodings.PermutationEncoding {
    3030  [Item("ExhaustiveSwap2MoveGenerator", "Generates all possible swap-2 moves from a given permutation.")]
    31   [StorableClass]
     31  [StorableClass("BEE5F7B6-9DF3-4810-8E52-C7D4402EA5BB")]
    3232  public class ExhaustiveSwap2MoveGenerator : Swap2MoveGenerator, IExhaustiveMoveGenerator {
    3333    [StorableConstructor]
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Moves/Swap2/StochasticSwap2MultiMoveGenerator.cs

    r12012 r13368  
    1 #region License Information
     1#region License Information
    22/* HeuristicLab
    33 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
     
    2929namespace HeuristicLab.Encodings.PermutationEncoding {
    3030  [Item("StochasticSwap2MultiMoveGenerator", "Randomly samples n from all possible swap-2 moves from a given permutation.")]
    31   [StorableClass]
     31  [StorableClass("E5D11F27-2647-44AD-BA8B-236C4D46AC69")]
    3232  public class StochasticSwap2MultiMoveGenerator : Swap2MoveGenerator, IMultiMoveGenerator, IStochasticOperator {
    3333    public ILookupParameter<IRandom> RandomParameter {
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Moves/Swap2/StochasticSwap2SingleMoveGenerator.cs

    r12012 r13368  
    1 #region License Information
     1#region License Information
    22/* HeuristicLab
    33 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
     
    2929namespace HeuristicLab.Encodings.PermutationEncoding {
    3030  [Item("StochasticSwap2SingleMoveGenerator", "Randomly samples a single from all possible swap-2 moves from a given permutation.")]
    31   [StorableClass]
     31  [StorableClass("9555AE64-D4A1-4744-8B30-BD4C265A84C9")]
    3232  public class StochasticSwap2SingleMoveGenerator : Swap2MoveGenerator, IStochasticOperator, ISingleMoveGenerator {
    3333    public ILookupParameter<IRandom> RandomParameter {
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Moves/Swap2/Swap2Move.cs

    r12012 r13368  
    1 #region License Information
     1#region License Information
    22/* HeuristicLab
    33 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
     
    2626namespace HeuristicLab.Encodings.PermutationEncoding {
    2727  [Item("Swap2Move", "Item that describes a swap-2 move.")]
    28   [StorableClass]
     28  [StorableClass("26CB204D-F3ED-4C88-B5A4-6369278E4540")]
    2929  public class Swap2Move : TwoIndexMove {
    3030    [StorableConstructor]
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Moves/Swap2/Swap2MoveAbsoluteAttribute.cs

    r12012 r13368  
    1 #region License Information
     1#region License Information
    22/* HeuristicLab
    33 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
     
    2626namespace HeuristicLab.Encodings.PermutationEncoding {
    2727  [Item("Swap2MoveAbsoluteAttribute", "Specifies the tabu attributes for a swap-2 move on an absolute position permutation.")]
    28   [StorableClass]
     28  [StorableClass("80138207-6AEA-41BD-A112-4EBCAF748E02")]
    2929  public class Swap2MoveAbsoluteAttribute : PermutationMoveAttribute {
    3030    [Storable]
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Moves/Swap2/Swap2MoveGenerator.cs

    r12012 r13368  
    1 #region License Information
     1#region License Information
    22/* HeuristicLab
    33 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
     
    2929namespace HeuristicLab.Encodings.PermutationEncoding {
    3030  [Item("Swap2MoveGenerator", "Base class for all swap-2 move generators.")]
    31   [StorableClass]
     31  [StorableClass("8DD2743F-2966-4CF0-8501-68208A761289")]
    3232  public abstract class Swap2MoveGenerator : SingleSuccessorOperator, IPermutationSwap2MoveOperator, IMoveGenerator {
    3333    public override bool CanChangeName {
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Moves/Swap2/Swap2MoveHardTabuCriterion.cs

    r12012 r13368  
    1 #region License Information
     1#region License Information
    22/* HeuristicLab
    33 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
     
    3434
    3535If the aspiration condition is activated, a move will not be considered tabu against a move in the tabu list if it leads to a better solution than the quality recorded with the move in the tabu list.")]
    36   [StorableClass]
     36  [StorableClass("EC305EDD-A668-4308-9E57-656AAA591694")]
    3737  public class Swap2MoveHardTabuCriterion : SingleSuccessorOperator, IPermutationSwap2MoveOperator, ITabuChecker {
    3838    public override bool CanChangeName {
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Moves/Swap2/Swap2MoveMaker.cs

    r12012 r13368  
    1 #region License Information
     1#region License Information
    22/* HeuristicLab
    33 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
     
    3030namespace HeuristicLab.Encodings.PermutationEncoding {
    3131  [Item("Swap2MoveMaker", "Peforms a swap-2 move on a given permutation and updates the quality.")]
    32   [StorableClass]
     32  [StorableClass("2853359E-C0DF-43C9-A6DC-B8680CC66288")]
    3333  public class Swap2MoveMaker : SingleSuccessorOperator, IPermutationSwap2MoveOperator, IMoveMaker, ISingleObjectiveOperator {
    3434    public override bool CanChangeName {
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Moves/Swap2/Swap2MoveRelativeAttribute.cs

    r12012 r13368  
    1 #region License Information
     1#region License Information
    22/* HeuristicLab
    33 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
     
    2626namespace HeuristicLab.Encodings.PermutationEncoding {
    2727  [Item("Swap2MoveRelativeAttribute", "Specifies the tabu attributes for a swap-2 move on a relative position permutation.")]
    28   [StorableClass]
     28  [StorableClass("1502BB1B-FD53-42D8-81D7-332544BE0E89")]
    2929  public class Swap2MoveRelativeAttribute : PermutationMoveAttribute {
    3030    [Storable]
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Moves/Swap2/Swap2MoveSoftTabuCriterion.cs

    r12012 r13368  
    1 #region License Information
     1#region License Information
    22/* HeuristicLab
    33 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
     
    3434
    3535If the aspiration condition is activated, a move will not be considered tabu against a move in the tabu list if it leads to a better solution than the quality recorded with the move in the tabu list.")]
    36   [StorableClass]
     36  [StorableClass("ADB87CD5-C157-4659-8A32-51524C2650D7")]
    3737  public class Swap2MoveSoftTabuCriterion : SingleSuccessorOperator, IPermutationSwap2MoveOperator, ITabuChecker {
    3838    public override bool CanChangeName {
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Moves/Swap2/Swap2MoveTabuMaker.cs

    r12012 r13368  
    1 #region License Information
     1#region License Information
    22/* HeuristicLab
    33 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
     
    2828namespace HeuristicLab.Encodings.PermutationEncoding {
    2929  [Item("Swap2MoveTabuMaker", "Declares a given swap-2 move as tabu, by adding its attributes to the tabu list and also store the solution quality or the move quality (whichever is better).")]
    30   [StorableClass]
     30  [StorableClass("A5A03F1E-5037-4B26-84CE-8C8825666B3A")]
    3131  public class Swap2MoveTabuMaker : TabuMaker, IPermutationSwap2MoveOperator {
    3232    public ILookupParameter<Permutation> PermutationParameter {
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Moves/ThreeIndexMove.cs

    r12012 r13368  
    1 #region License Information
     1#region License Information
    22/* HeuristicLab
    33 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
     
    2626namespace HeuristicLab.Encodings.PermutationEncoding {
    2727  [Item("ThreeIndexMove", "A move on a permutation that is specified by 3 indices.")]
    28   [StorableClass]
     28  [StorableClass("D0C144E4-A935-41E2-865C-9C64E5E94483")]
    2929  public class ThreeIndexMove : Item {
    3030    [Storable]
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Moves/ThreeOpt/ExhaustiveInsertionMoveGenerator.cs

    r12012 r13368  
    1 #region License Information
     1#region License Information
    22/* HeuristicLab
    33 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
     
    3030namespace HeuristicLab.Encodings.PermutationEncoding {
    3131  [Item("ExhaustiveInsertionMoveGenerator", "Generates all possible insertion moves (3-opt) from a given permutation.")]
    32   [StorableClass]
     32  [StorableClass("8F845DE6-046D-4B30-A194-9EF7F2C96027")]
    3333  public class ExhaustiveInsertionMoveGenerator : TranslocationMoveGenerator, IExhaustiveMoveGenerator {
    3434    [StorableConstructor]
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Moves/ThreeOpt/StochasticSingleInsertionMoveGenerator.cs

    r12012 r13368  
    1 #region License Information
     1#region License Information
    22/* HeuristicLab
    33 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
     
    3131namespace HeuristicLab.Encodings.PermutationEncoding {
    3232  [Item("StochasticInsertionMultiMoveGenerator", "Generates all possible insertion moves (3-opt) from a few numbers in a given permutation.")]
    33   [StorableClass]
     33  [StorableClass("7CB7A65B-497E-4FF7-8F78-267AB504DC03")]
    3434  public class StochasticInsertionMultiMoveGenerator : TranslocationMoveGenerator, IMultiMoveGenerator, IStochasticOperator {
    3535    public ILookupParameter<IRandom> RandomParameter {
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Moves/ThreeOpt/StochasticTranslocationMultiMoveGenerator.cs

    r12012 r13368  
    1 #region License Information
     1#region License Information
    22/* HeuristicLab
    33 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
     
    2929namespace HeuristicLab.Encodings.PermutationEncoding {
    3030  [Item("StochasticTranslocationMultiMoveGenerator", "Randomly samples n from all possible translocation and insertion moves (3-opt) from a given permutation.")]
    31   [StorableClass]
     31  [StorableClass("2D0D551A-0A53-4F80-A9EC-E20ED6CF7460")]
    3232  public class StochasticTranslocationMultiMoveGenerator : TranslocationMoveGenerator, IStochasticOperator, IMultiMoveGenerator {
    3333    public ILookupParameter<IRandom> RandomParameter {
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Moves/ThreeOpt/StochasticTranslocationSingleMoveGenerator.cs

    r12012 r13368  
    1 #region License Information
     1#region License Information
    22/* HeuristicLab
    33 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
     
    2929namespace HeuristicLab.Encodings.PermutationEncoding {
    3030  [Item("StochasticTranslocationSingleMoveGenerator", "Randomly samples one from all possible translocation and insertion moves (3-opt) from a given permutation.")]
    31   [StorableClass]
     31  [StorableClass("0359ABB3-2621-494E-9E6C-C640D909BF02")]
    3232  public class StochasticTranslocationSingleMoveGenerator : TranslocationMoveGenerator, IStochasticOperator, ISingleMoveGenerator {
    3333    public ILookupParameter<IRandom> RandomParameter {
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Moves/ThreeOpt/TranslocationMove.cs

    r12012 r13368  
    1 #region License Information
     1#region License Information
    22/* HeuristicLab
    33 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
     
    2626namespace HeuristicLab.Encodings.PermutationEncoding {
    2727  [Item("TranslocationMove", "A move that changes three edges by performing a translocation.")]
    28   [StorableClass]
     28  [StorableClass("E34918C6-C489-455F-A250-6C65E1B47627")]
    2929  public class TranslocationMove : ThreeIndexMove {
    3030    [StorableConstructor]
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Moves/ThreeOpt/TranslocationMoveAbsoluteAttribute.cs

    r12012 r13368  
    1 #region License Information
     1#region License Information
    22/* HeuristicLab
    33 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
     
    2626namespace HeuristicLab.Encodings.PermutationEncoding {
    2727  [Item("TranslocationMoveAbsoluteAttribute", "Specifies the tabu attributes for a translocation and insertion move (3-opt) on absolute permutation encodings.")]
    28   [StorableClass]
     28  [StorableClass("66B20FD4-F837-44E4-BC2A-CB197626CE1D")]
    2929  public class TranslocationMoveAbsoluteAttribute : PermutationMoveAttribute {
    3030    [Storable]
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Moves/ThreeOpt/TranslocationMoveGenerator.cs

    r12012 r13368  
    1 #region License Information
     1#region License Information
    22/* HeuristicLab
    33 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
     
    2929namespace HeuristicLab.Encodings.PermutationEncoding {
    3030  [Item("TranslocationMoveGenerator", "Base class for move generators that produce translocation moves (3-opt).")]
    31   [StorableClass]
     31  [StorableClass("ACC633A0-17E2-4887-9681-293AFB19E65B")]
    3232  public abstract class TranslocationMoveGenerator : SingleSuccessorOperator, IPermutationTranslocationMoveOperator, IMoveGenerator {
    3333    public override bool CanChangeName {
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Moves/ThreeOpt/TranslocationMoveHardTabuCriterion.cs

    r12012 r13368  
    1 #region License Information
     1#region License Information
    22/* HeuristicLab
    33 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
     
    3333
    3434If the aspiration condition is activated, a move will not be considered tabu against a move in the tabu list if it leads to a better solution than the quality recorded with the move in the tabu list.")]
    35   [StorableClass]
     35  [StorableClass("3C63BA6F-9104-48C0-AA1D-AF2E07C9D876")]
    3636  public class TranslocationMoveHardTabuCriterion : SingleSuccessorOperator, IPermutationTranslocationMoveOperator, ITabuChecker {
    3737    public override bool CanChangeName {
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Moves/ThreeOpt/TranslocationMoveMaker.cs

    r12012 r13368  
    1 #region License Information
     1#region License Information
    22/* HeuristicLab
    33 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
     
    3030namespace HeuristicLab.Encodings.PermutationEncoding {
    3131  [Item("TranslocationMoveMaker", "Peforms a translocation or insertion move (3-opt) on a given permutation and updates the quality.")]
    32   [StorableClass]
     32  [StorableClass("682F4178-91C4-405D-AE6F-1F581EFD47C0")]
    3333  public class TranslocationMoveMaker : SingleSuccessorOperator, IPermutationTranslocationMoveOperator, IMoveMaker, ISingleObjectiveOperator {
    3434    public override bool CanChangeName {
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Moves/ThreeOpt/TranslocationMoveRelativeAttribute.cs

    r12012 r13368  
    1 #region License Information
     1#region License Information
    22/* HeuristicLab
    33 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
     
    2626namespace HeuristicLab.Encodings.PermutationEncoding {
    2727  [Item("TranslocationMoveRelativeAttribute", "Specifies the tabu attributes for a translocation and insertion move (3-opt) on relative permutation encodings.")]
    28   [StorableClass]
     28  [StorableClass("1CBBC1F2-1AB8-4E18-8C72-200DAC93C4C6")]
    2929  public class TranslocationMoveRelativeAttribute : PermutationMoveAttribute {
    3030    [Storable]
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Moves/ThreeOpt/TranslocationMoveSoftTabuCriterion.cs

    r12012 r13368  
    1 #region License Information
     1#region License Information
    22/* HeuristicLab
    33 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
     
    3333
    3434If the aspiration condition is activated, a move will not be considered tabu against a move in the tabu list if it leads to a better solution than the quality recorded with the move in the tabu list.")]
    35   [StorableClass]
     35  [StorableClass("193ADBC5-07A4-43B0-9EBA-07BE1A4A365C")]
    3636  public class TranslocationMoveSoftTabuCriterion : SingleSuccessorOperator, IPermutationTranslocationMoveOperator, ITabuChecker {
    3737    public override bool CanChangeName {
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Moves/ThreeOpt/TranslocationMoveTabuMaker.cs

    r12012 r13368  
    1 #region License Information
     1#region License Information
    22/* HeuristicLab
    33 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
     
    2828namespace HeuristicLab.Encodings.PermutationEncoding {
    2929  [Item("TranslocationMoveTabuMaker", "Declares a given translocation or insertion move (3-opt) as tabu, by adding its attributes to the tabu list.")]
    30   [StorableClass]
     30  [StorableClass("94BDC663-D2D0-4114-9D56-3B632F3C655A")]
    3131  public class TranslocationMoveTabuMaker : TabuMaker, IPermutationTranslocationMoveOperator {
    3232    public ILookupParameter<Permutation> PermutationParameter {
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Moves/TwoIndexMove.cs

    r12012 r13368  
    1 #region License Information
     1#region License Information
    22/* HeuristicLab
    33 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
     
    2626namespace HeuristicLab.Encodings.PermutationEncoding {
    2727  [Item("TwoIndexMove", "A move on a permutation that is specified by 2 indices.")]
    28   [StorableClass]
     28  [StorableClass("54380E43-E827-4A8E-9C6D-9CE92AB9F15B")]
    2929  public class TwoIndexMove : Item {
    3030    [Storable]
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Moves/TwoOpt/ExhaustiveInversionMoveGenerator.cs

    r12012 r13368  
    1 #region License Information
     1#region License Information
    22/* HeuristicLab
    33 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
     
    3030namespace HeuristicLab.Encodings.PermutationEncoding {
    3131  [Item("ExhaustiveInversionMoveGenerator", "Generates all possible inversion moves (2-opt) from a given permutation.")]
    32   [StorableClass]
     32  [StorableClass("478207CB-6282-4FB6-8A76-F2D0FBCB0CE9")]
    3333  public class ExhaustiveInversionMoveGenerator : InversionMoveGenerator, IExhaustiveMoveGenerator {
    3434    [StorableConstructor]
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Moves/TwoOpt/InversionMove.cs

    r12012 r13368  
    1 #region License Information
     1#region License Information
    22/* HeuristicLab
    33 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
     
    2626namespace HeuristicLab.Encodings.PermutationEncoding {
    2727  [Item("InversionMove", "Item that describes an inversion move (2-opt).")]
    28   [StorableClass]
     28  [StorableClass("E414DB9B-5CA1-410E-84C8-C44FA792F2A7")]
    2929  public class InversionMove : TwoIndexMove {
    3030    [StorableConstructor]
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Moves/TwoOpt/InversionMoveAbsoluteAttribute.cs

    r12012 r13368  
    1 #region License Information
     1#region License Information
    22/* HeuristicLab
    33 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
     
    2626namespace HeuristicLab.Encodings.PermutationEncoding {
    2727  [Item("InversionMoveAbsoluteAttribute", "Specifies the tabu attributes for an inversion move (2-opt) on an absolute position permutation.")]
    28   [StorableClass]
     28  [StorableClass("79A62352-C17B-45E1-B334-E841B0EBCEC2")]
    2929  public class InversionMoveAbsoluteAttribute : PermutationMoveAttribute {
    3030    [Storable]
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Moves/TwoOpt/InversionMoveGenerator.cs

    r12012 r13368  
    1 #region License Information
     1#region License Information
    22/* HeuristicLab
    33 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
     
    2929namespace HeuristicLab.Encodings.PermutationEncoding {
    3030  [Item("InversionMoveGenerator", "Base class for all inversion (2-opt) move generators.")]
    31   [StorableClass]
     31  [StorableClass("17C1A6A7-9F09-40F6-8CF2-F14202C40D2C")]
    3232  public abstract class InversionMoveGenerator : SingleSuccessorOperator, IPermutationInversionMoveOperator, IMoveGenerator {
    3333    public override bool CanChangeName {
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Moves/TwoOpt/InversionMoveHardTabuCriterion.cs

    r12012 r13368  
    1 #region License Information
     1#region License Information
    22/* HeuristicLab
    33 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
     
    3434
    3535If the aspiration condition is activated, a move will not be considered tabu against a move in the tabu list if it leads to a better solution than the quality recorded with the move in the tabu list.")]
    36   [StorableClass]
     36  [StorableClass("56EEE556-6AF2-4A96-82DB-92862B0C591E")]
    3737  public class InversionMoveHardTabuCriterion : SingleSuccessorOperator, IPermutationInversionMoveOperator, ITabuChecker {
    3838    public override bool CanChangeName {
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Moves/TwoOpt/InversionMoveMaker.cs

    r12012 r13368  
    1 #region License Information
     1#region License Information
    22/* HeuristicLab
    33 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
     
    3030namespace HeuristicLab.Encodings.PermutationEncoding {
    3131  [Item("InversionMoveMaker", "Peforms an inversion move (2-opt) on a given permutation and updates the quality.")]
    32   [StorableClass]
     32  [StorableClass("53F8C88F-CBBE-47E0-82CB-7BE79A548ECF")]
    3333  public class InversionMoveMaker : SingleSuccessorOperator, IPermutationInversionMoveOperator, IMoveMaker, ISingleObjectiveOperator {
    3434    public override bool CanChangeName {
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Moves/TwoOpt/InversionMoveRelativeAttribute.cs

    r12012 r13368  
    1 #region License Information
     1#region License Information
    22/* HeuristicLab
    33 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
     
    2626namespace HeuristicLab.Encodings.PermutationEncoding {
    2727  [Item("InversionMoveRelativeAttribute", "Specifies the tabu attributes for an inversion move (2-opt) on a relative position permutation.")]
    28   [StorableClass]
     28  [StorableClass("46C13821-2887-486D-9C81-7F32BE0917DC")]
    2929  public class InversionMoveRelativeAttribute : PermutationMoveAttribute {
    3030    [Storable]
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Moves/TwoOpt/InversionMoveSoftTabuCriterion.cs

    r12012 r13368  
    1 #region License Information
     1#region License Information
    22/* HeuristicLab
    33 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
     
    3434
    3535If the aspiration condition is activated, a move will not be considered tabu against a move in the tabu list if it leads to a better solution than the quality recorded with the move in the tabu list.")]
    36   [StorableClass]
     36  [StorableClass("C73FADD7-3A8D-4C4C-B46A-B00F62A3C63F")]
    3737  public class InversionMoveSoftTabuCriterion : SingleSuccessorOperator, IPermutationInversionMoveOperator, ITabuChecker {
    3838    public override bool CanChangeName {
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Moves/TwoOpt/InversionMoveTabuMaker.cs

    r12012 r13368  
    1 #region License Information
     1#region License Information
    22/* HeuristicLab
    33 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
     
    2828namespace HeuristicLab.Encodings.PermutationEncoding {
    2929  [Item("InversionMoveTabuMaker", "Declares a given inversion move (2-opt) as tabu, by adding its attributes to the tabu list and also store the solution quality or the move quality (whichever is better).")]
    30   [StorableClass]
     30  [StorableClass("350D23FD-8A33-4B1C-87CC-A89A64957241")]
    3131  public class InversionMoveTabuMaker : TabuMaker, IPermutationInversionMoveOperator {
    3232    public ILookupParameter<Permutation> PermutationParameter {
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Moves/TwoOpt/StochasticInversionMultiMoveGenerator.cs

    r12012 r13368  
    1 #region License Information
     1#region License Information
    22/* HeuristicLab
    33 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
     
    2929namespace HeuristicLab.Encodings.PermutationEncoding {
    3030  [Item("StochasticInversionMultiMoveGenerator", "Randomly samples n from all possible inversion moves (2-opt) from a given permutation.")]
    31   [StorableClass]
     31  [StorableClass("19A5F55E-A99B-4583-8A37-BC3AA0C6F76B")]
    3232  public class StochasticInversionMultiMoveGenerator : InversionMoveGenerator, IMultiMoveGenerator, IStochasticOperator {
    3333    public ILookupParameter<IRandom> RandomParameter {
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Moves/TwoOpt/StochasticInversionSingleMoveGenerator.cs

    r12012 r13368  
    1 #region License Information
     1#region License Information
    22/* HeuristicLab
    33 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
     
    2929namespace HeuristicLab.Encodings.PermutationEncoding {
    3030  [Item("StochasticInversionSingleMoveGenerator", "Randomly samples a single from all possible inversion moves (2-opt) from a given permutation.")]
    31   [StorableClass]
     31  [StorableClass("A2CC5598-A797-4F1C-9DCA-4B914FB21722")]
    3232  public class StochasticInversionSingleMoveGenerator : InversionMoveGenerator, IStochasticOperator, ISingleMoveGenerator {
    3333    public ILookupParameter<IRandom> RandomParameter {
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Permutation.cs

    r12012 r13368  
    2828namespace HeuristicLab.Encodings.PermutationEncoding {
    2929  [Item("Permutation", "Represents a permutation of integer values.")]
    30   [StorableClass]
     30  [StorableClass("42B08CF9-1133-452B-B23B-7A620340DCB9")]
    3131  public class Permutation : IntArray {
    3232    [Storable]
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/PermutationCrossover.cs

    r12012 r13368  
    3232  /// </summary>
    3333  [Item("PermutationCrossover", "A base class for permutation crossover operators.")]
    34   [StorableClass]
     34  [StorableClass("2445B070-3A3E-493B-8DC0-E87DFB35CB57")]
    3535  public abstract class PermutationCrossover : InstrumentedOperator, IPermutationCrossover, IStochasticOperator {
    3636    public override bool CanChangeName {
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/PermutationEncoding.cs

    r12015 r13368  
    1 #region License Information
     1#region License Information
    22/* HeuristicLab
    33 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
     
    3333namespace HeuristicLab.Encodings.PermutationEncoding {
    3434  [Item("PermutationEncoding", "Describes a permutation encoding.")]
    35   [StorableClass]
     35  [StorableClass("82EDACEE-89C6-429E-AEBA-FCF3B107F648")]
    3636  public sealed class PermutationEncoding : Encoding<IPermutationCreator> {
    3737    #region encoding parameters
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/PermutationManipulator.cs

    r12012 r13368  
    3232  /// </summary>
    3333  [Item("PermutationManipulator", "A base class for permutation manipulation operators.")]
    34   [StorableClass]
     34  [StorableClass("E41E1D7D-F34A-4836-8926-8F7C1D4BB2F7")]
    3535  public abstract class PermutationManipulator : InstrumentedOperator, IPermutationManipulator, IStochasticOperator {
    3636    public override bool CanChangeName {
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/PermutationType.cs

    r12012 r13368  
    1 #region License Information
     1#region License Information
    22/* HeuristicLab
    33 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
     
    2828namespace HeuristicLab.Encodings.PermutationEncoding {
    2929  [Item("PermutationType", "Represents a certain type of permutation.")]
    30   [StorableClass]
     30  [StorableClass("79CC3CEE-A75E-4859-B231-269EC5C5809C")]
    3131  public class PermutationType : ValueTypeValue<PermutationTypes> {
    3232    public static new Image StaticItemImage {
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/ShakingOperators/PermutationShakingOperator.cs

    r12012 r13368  
    1 #region License Information
     1#region License Information
    22/* HeuristicLab
    33 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
     
    3636  /// </summary>
    3737  [Item("PermutationShakingOperator", "A shaking operator for VNS which uses available manipulation operators to perform the shaking.")]
    38   [StorableClass]
     38  [StorableClass("BAED7CA8-C931-48CD-B5F9-D8634EE19888")]
    3939  public class PermutationShakingOperator : ShakingOperator<IPermutationManipulator>, IPermutationMultiNeighborhoodShakingOperator, IStochasticOperator {
    4040
Note: See TracChangeset for help on using the changeset viewer.