Free cookie consent management tool by TermsFeed Policy Generator

Ignore:
Timestamp:
03/03/17 11:41:43 (8 years ago)
Author:
gkronber
Message:

#2520

  • renamed StorableClass -> StorableType
  • changed persistence to use GUIDs instead of type names
Location:
branches/PersistenceOverhaul/HeuristicLab.Encodings.RealVectorEncoding/3.3
Files:
47 edited

Legend:

Unmodified
Added
Removed
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.RealVectorEncoding/3.3/BoundsChecker.cs

    r13368 r14711  
    3434  /// </summary>
    3535  [Item("BoundsChecker", "Checks if all elements of a real vector are inside the bounds. If not, elements are set to the respective values of the bounds.")]
    36   [StorableClass("1C496D91-2846-45C5-A81A-5B48F677DBC6")]
     36  [StorableType("1C496D91-2846-45C5-A81A-5B48F677DBC6")]
    3737  public class BoundsChecker : SingleSuccessorOperator, IRealVectorBoundsChecker {
    3838    public LookupParameter<RealVector> RealVectorParameter {
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.RealVectorEncoding/3.3/Creators/NormalDistributedRealVectorCreator.cs

    r13368 r14711  
    3434  /// </summary>
    3535  [Item("NormalDistributedRealVectorCreator", "An operator which creates a new random real vector with each element normally distributed in a specified range.")]
    36   [StorableClass("23C921F5-3BBB-42F3-A925-789A2BAD0F63")]
     36  [StorableType("23C921F5-3BBB-42F3-A925-789A2BAD0F63")]
    3737  public class NormalDistributedRealVectorCreator : RealVectorCreator, IStrategyParameterCreator {
    3838
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.RealVectorEncoding/3.3/Creators/UniformRandomRealVectorCreator.cs

    r13368 r14711  
    3232  /// </summary>
    3333  [Item("UniformRandomRealVectorCreator", "An operator which creates a new random real vector with each element uniformly distributed in a specified range.")]
    34   [StorableClass("060E853A-13F2-4E1A-A84E-19BFBAB8F8AF")]
     34  [StorableType("060E853A-13F2-4E1A-A84E-19BFBAB8F8AF")]
    3535  public class UniformRandomRealVectorCreator : RealVectorCreator, IStrategyParameterCreator {
    3636    [StorableConstructor]
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.RealVectorEncoding/3.3/Crossovers/AverageCrossover.cs

    r13368 r14711  
    3333  /// </remarks>
    3434  [Item("AverageCrossover", "The average crossover (intermediate recombination) produces a new offspring by calculating in each position the average of a number of parents. It is implemented as described by Beyer, H.-G. and Schwefel, H.-P. 2002. Evolution Strategies - A Comprehensive Introduction Natural Computing, 1, pp. 3-52.")]
    35   [StorableClass("633EF75E-BD1A-4B89-86FA-EC785B4E2D28")]
     35  [StorableType("633EF75E-BD1A-4B89-86FA-EC785B4E2D28")]
    3636  public class AverageCrossover : RealVectorCrossover {
    3737    [StorableConstructor]
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.RealVectorEncoding/3.3/Crossovers/BlendAlphaBetaCrossover.cs

    r13368 r14711  
    4040  /// </remarks>
    4141  [Item("BlendAlphaBetaCrossover", "The blend alpha beta crossover (BLX-a-b) for real vectors is similar to the blend alpha crossover (BLX-a), but distinguishes between the better and worse of the parents. The interval from which to choose the new offspring can be extended beyond the better parent by specifying a higher alpha value, and beyond the worse parent by specifying a higher beta value. The new offspring is sampled uniformly in the extended range. It is implemented as described in Takahashi, M. and Kita, H. 2001. A crossover operator using independent component analysis for real-coded genetic algorithms Proceedings of the 2001 Congress on Evolutionary Computation, pp. 643-649.")]
    42   [StorableClass("087B7AC1-6925-436A-B2D8-757E617DA206")]
     42  [StorableType("087B7AC1-6925-436A-B2D8-757E617DA206")]
    4343  public class BlendAlphaBetaCrossover : RealVectorCrossover, ISingleObjectiveOperator {
    4444    /// <summary>
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.RealVectorEncoding/3.3/Crossovers/BlendAlphaCrossover.cs

    r13368 r14711  
    3838  /// </remarks>
    3939  [Item("BlendAlphaCrossover", "The blend alpha crossover (BLX-a) for real vectors creates new offspring by sampling a new value in the range [min_i - d * alpha, max_i + d * alpha) at each position i. Here min_i and max_i are the smaller and larger value of the two parents at position i and d is max_i - min_i. It is implemented as described in Takahashi, M. and Kita, H. 2001. A crossover operator using independent component analysis for real-coded genetic algorithms Proceedings of the 2001 Congress on Evolutionary Computation, pp. 643-649.")]
    40   [StorableClass("8506B15A-8091-47BE-B75B-FF454895FB34")]
     40  [StorableType("8506B15A-8091-47BE-B75B-FF454895FB34")]
    4141  public class BlendAlphaCrossover : RealVectorCrossover {
    4242    /// <summary>
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.RealVectorEncoding/3.3/Crossovers/DiscreteCrossover.cs

    r13368 r14711  
    3535  /// </remarks>
    3636  [Item("DiscreteCrossover", "Discrete crossover for real vectors: Creates a new offspring by combining the alleles in the parents such that each allele is randomly selected from one parent. It is implemented as described in Beyer, H.-G. and Schwefel, H.-P. 2002. Evolution Strategies - A Comprehensive Introduction Natural Computing, 1, pp. 3-52.")]
    37   [StorableClass("23A39268-6A9D-468E-AD99-10599558DE7B")]
     37  [StorableType("23A39268-6A9D-468E-AD99-10599558DE7B")]
    3838  public class DiscreteCrossover : RealVectorCrossover {
    3939    [StorableConstructor]
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.RealVectorEncoding/3.3/Crossovers/HeuristicCrossover.cs

    r13368 r14711  
    3737  /// </remarks>
    3838  [Item("HeuristicCrossover", "The heuristic crossover produces offspring that extend the better parent in direction from the worse to the better parent. It is implemented as described in Wright, A.H. (1994), Genetic algorithms for real parameter optimization, Foundations of Genetic Algorithms, G.J.E. Rawlins (Ed.), Morgan Kaufmann, San Mateo, CA, 205-218.")]
    39   [StorableClass("F1A85C12-A841-48A4-8BB3-D24CA29AC69C")]
     39  [StorableType("F1A85C12-A841-48A4-8BB3-D24CA29AC69C")]
    4040  public class HeuristicCrossover : RealVectorCrossover, ISingleObjectiveOperator {
    4141    /// <summary>
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.RealVectorEncoding/3.3/Crossovers/LocalCrossover.cs

    r13368 r14711  
    3333  /// </remarks>
    3434  [Item("LocalCrossover", @"The local crossover is similar to the arithmetic all positions crossover, but uses a random alpha for each position x = alpha * p1 + (1-alpha) * p2. It is implemented as described in Dumitrescu, D. et al. (2000), Evolutionary computation, CRC Press, Boca Raton, FL., p. 194.")]
    35   [StorableClass("521BC15A-CB2F-47DA-B7BA-D266149B8F5F")]
     35  [StorableType("521BC15A-CB2F-47DA-B7BA-D266149B8F5F")]
    3636  public class LocalCrossover : RealVectorCrossover {
    3737    [StorableConstructor]
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.RealVectorEncoding/3.3/Crossovers/MultiRealVectorCrossover.cs

    r13368 r14711  
    3434namespace HeuristicLab.Encodings.RealVectorEncoding {
    3535  [Item("MultiRealVectorCrossover", "Randomly selects and applies one of its crossovers every time it is called.")]
    36   [StorableClass("DEC2B1FD-2F80-4A3E-9E9B-C6214B2761DD")]
     36  [StorableType("DEC2B1FD-2F80-4A3E-9E9B-C6214B2761DD")]
    3737  public class MultiRealVectorCrossover : StochasticMultiBranch<IRealVectorCrossover>, IRealVectorCrossover, IStochasticOperator {
    3838    public override bool CanChangeName {
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.RealVectorEncoding/3.3/Crossovers/RandomConvexCrossover.cs

    r13368 r14711  
    3333  /// </remarks>
    3434  [Item("RandomConvexCrossover", "The random convex crossover acts like the local crossover, but with just one randomly chosen alpha for all crossed positions. It is implementes as described in Dumitrescu, D. et al. (2000), Evolutionary computation, CRC Press, Boca Raton, FL, pp. 193 - 194.")]
    35   [StorableClass("B39B5390-EFEF-478A-8574-A754A2CE26A7")]
     35  [StorableType("B39B5390-EFEF-478A-8574-A754A2CE26A7")]
    3636  public class RandomConvexCrossover : RealVectorCrossover {
    3737    [StorableConstructor]
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.RealVectorEncoding/3.3/Crossovers/SimulatedBinaryCrossover.cs

    r13368 r14711  
    3636  /// </remarks>
    3737  [Item("SimulatedBinaryCrossover", "The simulated binary crossover (SBX) is implemented as described in Deb, K. and Agrawal, R. B. 1995. Simulated binary crossover for continuous search space. Complex Systems, 9, pp. 115-148.")]
    38   [StorableClass("5FF68A72-B072-4A3D-8546-456B25A90D2D")]
     38  [StorableType("5FF68A72-B072-4A3D-8546-456B25A90D2D")]
    3939  public class SimulatedBinaryCrossover : RealVectorCrossover {
    4040    /// <summary>
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.RealVectorEncoding/3.3/Crossovers/SinglePointCrossover.cs

    r13368 r14711  
    3535  /// </remarks>
    3636  [Item("SinglePointCrossover", "Breaks both parent chromosomes at a randomly chosen point and assembles a child by taking one part of the first parent and the other part of the second pard. It is implemented as described in Michalewicz, Z. 1999. Genetic Algorithms + Data Structures = Evolution Programs. Third, Revised and Extended Edition, Spring-Verlag Berlin Heidelberg.")]
    37   [StorableClass("F130CB4D-94AA-4314-B399-9A5E7582CD0E")]
     37  [StorableType("F130CB4D-94AA-4314-B399-9A5E7582CD0E")]
    3838  public class SinglePointCrossover : RealVectorCrossover {
    3939    [StorableConstructor]
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.RealVectorEncoding/3.3/Crossovers/UniformAllPositionsArithmeticCrossover.cs

    r13368 r14711  
    3636  /// </remarks>
    3737  [Item("UniformAllPositionsArithmeticCrossover", "The uniform all positions arithmetic crossover constructs an offspring by calculating x = alpha * p1 + (1-alpha) * p2 for every position x in the vector. Note that for alpha = 0.5 it is the same as the AverageCrossover (except that the AverageCrossover is defined for more than 2 parents). It is implemented as described in Michalewicz, Z. 1999. Genetic Algorithms + Data Structures = Evolution Programs. Third, Revised and Extended Edition, Spring-Verlag Berlin Heidelberg.")]
    38   [StorableClass("29E697F1-FDA2-4E22-9607-01A17C7A9E70")]
     38  [StorableType("29E697F1-FDA2-4E22-9607-01A17C7A9E70")]
    3939  public class UniformAllPositionsArithmeticCrossover : RealVectorCrossover {
    4040    /// <summary>
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.RealVectorEncoding/3.3/Crossovers/UniformSomePositionsArithmeticCrossover.cs

    r13368 r14711  
    3636  /// </remarks>
    3737  [Item("UniformSomePositionsArithmeticCrossover", "The uniform some positions arithmetic crossover (continuous recombination) constructs an offspring by calculating x = alpha * p1 + (1-alpha) * p2 for a position x in the vector with a given probability (otherwise p1 is taken at this position). It is implemented as described in Dumitrescu, D. et al. (2000), Evolutionary computation, CRC Press, Boca Raton, FL, p. 191. Note that Dumitrescu et al. specify the alpha to be 0.5.")]
    38   [StorableClass("8F762A73-A651-41EB-B5E6-F045124418B3")]
     38  [StorableType("8F762A73-A651-41EB-B5E6-F045124418B3")]
    3939  public class UniformSomePositionsArithmeticCrossover : RealVectorCrossover {
    4040    /// <summary>
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.RealVectorEncoding/3.3/Manipulators/BreederGeneticAlgorithmManipulator.cs

    r13368 r14711  
    3636  /// </remarks>
    3737  [Item("BreederGeneticAlgorithmManipulator", "It is implemented as described by MÃŒhlenbein, H. and Schlierkamp-Voosen, D. 1993. Predictive Models for the Breeder Genetic Algorithm - I. Continuous Parameter Optimization. Evolutionary Computation, 1(1), pp. 25-49.")]
    38   [StorableClass("3F2B4154-E060-4140-9C0C-EDD8AF90D91C")]
     38  [StorableType("3F2B4154-E060-4140-9C0C-EDD8AF90D91C")]
    3939  public class BreederGeneticAlgorithmManipulator : RealVectorManipulator {
    4040    private static readonly double[] powerOfTwo = new double[] { 1, 0.5, 0.25, 0.125, 0.0625, 0.03125, 0.015625, 0.0078125, 0.00390625, 0.001953125, 0.0009765625, 0.00048828125, 0.000244140625, 0.0001220703125, 0.00006103515625, 0.000030517578125 };
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.RealVectorEncoding/3.3/Manipulators/FixedNormalAllPositionsManipulator.cs

    r13368 r14711  
    3737  /// </remarks>
    3838  [Item("FixedNormalAllPositionsManipulator", "This manipulation operator adds a value sigma_i * N_i(0,1) to the current value in each position i given the values for sigma_i in the parameter. If there are less elements in Sigma than positions, then Sigma is cycled. It is implemented as described in Beyer, H.-G. and Schwefel, H.-P. 2002. Evolution Strategies - A Comprehensive Introduction Natural Computing, 1, pp. 3-52.")]
    39   [StorableClass("BE4276B2-477C-4CE2-858A-F9CB891AC377")]
     39  [StorableType("BE4276B2-477C-4CE2-858A-F9CB891AC377")]
    4040  public class FixedNormalAllPositionsManipulator : RealVectorManipulator {
    4141
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.RealVectorEncoding/3.3/Manipulators/MichalewiczNonUniformAllPositionsManipulator.cs

    r13368 r14711  
    3737  /// </remarks>
    3838  [Item("MichalewiczNonUniformAllPositionsManipulator", "It is implemented as described in Michalewicz, Z. 1999. Genetic Algorithms + Data Structures = Evolution Programs. Third, Revised and Extended Edition, Spring-Verlag Berlin Heidelberg.")]
    39   [StorableClass("A55B0F35-BBED-4796-8168-1D379AFE5AF0")]
     39  [StorableType("A55B0F35-BBED-4796-8168-1D379AFE5AF0")]
    4040  public class MichalewiczNonUniformAllPositionsManipulator : RealVectorManipulator, IIterationBasedOperator {
    4141    /// <summary>
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.RealVectorEncoding/3.3/Manipulators/MichalewiczNonUniformOnePositionManipulator.cs

    r13368 r14711  
    3737  /// </remarks>
    3838  [Item("MichalewiczNonUniformOnePositionManipulator", "It is implemented as described in Michalewicz, Z. 1999. Genetic Algorithms + Data Structures = Evolution Programs. Third, Revised and Extended Edition, Spring-Verlag Berlin Heidelberg.")]
    39   [StorableClass("7FAC5018-8B02-4AAE-896C-FDC39B8F309E")]
     39  [StorableType("7FAC5018-8B02-4AAE-896C-FDC39B8F309E")]
    4040  public class MichalewiczNonUniformOnePositionManipulator : RealVectorManipulator, IIterationBasedOperator {
    4141    /// <summary>
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.RealVectorEncoding/3.3/Manipulators/MultiRealVectorManipulator.cs

    r13368 r14711  
    3333namespace HeuristicLab.Encodings.RealVectorEncoding {
    3434  [Item("MultiRealVectorManipulator", "Randomly selects and applies one of its manipulators every time it is called.")]
    35   [StorableClass("AD8F0125-BFFD-4A6D-9D09-C82883B7BD2D")]
     35  [StorableType("AD8F0125-BFFD-4A6D-9D09-C82883B7BD2D")]
    3636  public class MultiRealVectorManipulator : StochasticMultiBranch<IRealVectorManipulator>, IRealVectorManipulator, IStochasticOperator {
    3737    public override bool CanChangeName {
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.RealVectorEncoding/3.3/Manipulators/PolynomialAllPositionManipulator.cs

    r13368 r14711  
    3636  /// </remarks>
    3737  [Item("PolynomialAllPositionManipulator", "The polynomial manipulation is implemented as described in Deb, K. & Goyal, M. A. 1996. Combined Genetic Adaptive Search (GeneAS) for Engineering Design Computer Science and Informatics, 26, pp. 30-45. In this operator it is performed on all positions of the real vector.")]
    38   [StorableClass("913519ED-CB13-40A6-9979-C57C1955BE4C")]
     38  [StorableType("913519ED-CB13-40A6-9979-C57C1955BE4C")]
    3939  public class PolynomialAllPositionManipulator : RealVectorManipulator {
    4040    /// <summary>
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.RealVectorEncoding/3.3/Manipulators/PolynomialOnePositionManipulator.cs

    r13368 r14711  
    3535  /// </remarks>
    3636  [Item("PolynomialOnePositionManipulator", "The polynomial manipulation is implemented as described in Deb, K. & Goyal, M. A. 1996. Combined Genetic Adaptive Search (GeneAS) for Engineering Design Computer Science and Informatics, 26, pp. 30-45. In this operator it is performed on a single randomly chosen position of the real vector.")]
    37   [StorableClass("4E0B3BC5-09EB-4E58-9FF5-4F0857761A2D")]
     37  [StorableType("4E0B3BC5-09EB-4E58-9FF5-4F0857761A2D")]
    3838  public class PolynomialOnePositionManipulator : RealVectorManipulator {
    3939    /// <summary>
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.RealVectorEncoding/3.3/Manipulators/SelfAdaptiveNormalAllPositionsManipulator.cs

    r13368 r14711  
    3838  /// </remarks>
    3939  [Item("SelfAdaptiveNormalAllPositionsManipulator", "This manipulation operator adds a value sigma_i * N(0,1) to the current value in each position i. The values for sigma_i are looked up dynamically. If there are less elements in the strategy vector than positions, then the strategy vector is cycled. It is implemented as described in Beyer, H.-G. and Schwefel, H.-P. 2002. Evolution Strategies - A Comprehensive Introduction Natural Computing, 1, pp. 3-52.")]
    40   [StorableClass("ECDCD2D0-E69E-4D27-8BD3-E03AD4CEE62F")]
     40  [StorableType("ECDCD2D0-E69E-4D27-8BD3-E03AD4CEE62F")]
    4141  // BackwardsCompatibility3.3
    4242  // Rename class to match file- and itemname when upgrading to 3.4
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.RealVectorEncoding/3.3/Manipulators/UniformOnePositionManipulator.cs

    r13368 r14711  
    3434  /// </remarks>
    3535  [Item("UniformOnePositionManipulator", "Changes a single position in the vector by sampling uniformly from the interval [Minimum_i, Maximum_i) in dimension i. It is implemented as described in Michalewicz, Z. 1999. Genetic Algorithms + Data Structures = Evolution Programs. Third, Revised and Extended Edition, Spring-Verlag Berlin Heidelberg.")]
    36   [StorableClass("EE3F0FAD-E779-41D8-A98B-23553EB792F8")]
     36  [StorableType("EE3F0FAD-E779-41D8-A98B-23553EB792F8")]
    3737  public class UniformOnePositionManipulator : RealVectorManipulator {
    3838    [StorableConstructor]
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.RealVectorEncoding/3.3/Moves/AdditiveMove.cs

    r13368 r14711  
    2626namespace HeuristicLab.Encodings.RealVectorEncoding {
    2727  [Item("AdditiveMove", "A move on a real vector that that represents an additive change in one dimension.")]
    28   [StorableClass("638D2CA0-FE54-4161-ADBA-E091F621CDBD")]
     28  [StorableType("638D2CA0-FE54-4161-ADBA-E091F621CDBD")]
    2929  public class AdditiveMove : Item {
    3030    [Storable]
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.RealVectorEncoding/3.3/Moves/AdditiveMoveGenerator.cs

    r13368 r14711  
    3030namespace HeuristicLab.Encodings.RealVectorEncoding {
    3131  [Item("AdditiveMoveGenerator", "Base class for all additive move generators.")]
    32   [StorableClass("E890C9C9-C20B-4333-AE9D-9AE350A8EEA6")]
     32  [StorableType("E890C9C9-C20B-4333-AE9D-9AE350A8EEA6")]
    3333  public abstract class AdditiveMoveGenerator : SingleSuccessorOperator, IAdditiveRealVectorMoveOperator, IMoveGenerator, IStochasticOperator {
    3434    public override bool CanChangeName {
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.RealVectorEncoding/3.3/Moves/AdditiveMoveMaker.cs

    r13368 r14711  
    3030namespace HeuristicLab.Encodings.RealVectorEncoding {
    3131  [Item("AdditiveMoveMaker", "Peforms an additive move on a given real vector and updates the quality.")]
    32   [StorableClass("7519F001-7037-4FC8-998B-24D2456E134F")]
     32  [StorableType("7519F001-7037-4FC8-998B-24D2456E134F")]
    3333  public class AdditiveMoveMaker : SingleSuccessorOperator, IAdditiveRealVectorMoveOperator, IMoveMaker, ISingleObjectiveOperator {
    3434    public override bool CanChangeName {
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.RealVectorEncoding/3.3/Moves/AdditiveMoveTabuAttribute.cs

    r13368 r14711  
    2626namespace HeuristicLab.Encodings.RealVectorEncoding {
    2727  [Item("AdditiveMoveTabuAttribute", "Tabu attribute for additive moves.")]
    28   [StorableClass("09C7B9C7-7972-4661-B296-1EADB12CA56C")]
     28  [StorableType("09C7B9C7-7972-4661-B296-1EADB12CA56C")]
    2929  public class AdditiveMoveTabuAttribute : Item {
    3030    [Storable]
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.RealVectorEncoding/3.3/Moves/AdditiveMoveTabuChecker.cs

    r13368 r14711  
    3131namespace HeuristicLab.Encodings.RealVectorEncoding {
    3232  [Item("AdditiveMoveTabuChecker", "Prevents falling back into ranges that have been moved over before.")]
    33   [StorableClass("30A69FFF-9466-43DE-AE31-FF0231DBCFEF")]
     33  [StorableType("30A69FFF-9466-43DE-AE31-FF0231DBCFEF")]
    3434  public class AdditiveMoveTabuChecker : SingleSuccessorOperator, IAdditiveRealVectorMoveOperator, ITabuChecker {
    3535    public override bool CanChangeName {
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.RealVectorEncoding/3.3/Moves/AdditiveMoveTabuMaker.cs

    r13368 r14711  
    2828namespace HeuristicLab.Encodings.RealVectorEncoding {
    2929  [Item("AdditiveMoveTabuMaker", "Sets the move tabu.")]
    30   [StorableClass("2ECDAD97-0EE5-4CB4-A9DC-4B9AC0CE1372")]
     30  [StorableType("2ECDAD97-0EE5-4CB4-A9DC-4B9AC0CE1372")]
    3131  public class AdditiveMoveTabuMaker : TabuMaker, IAdditiveRealVectorMoveOperator {
    3232    public ILookupParameter<AdditiveMove> AdditiveMoveParameter {
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.RealVectorEncoding/3.3/Moves/StochasticNormalMultiMoveGenerator.cs

    r13368 r14711  
    3030namespace HeuristicLab.Encodings.RealVectorEncoding {
    3131  [Item("StochasticNormalMultiMoveGenerator", "Generates normal distributed moves from a given real vector.")]
    32   [StorableClass("F8D689F6-6CF2-4896-9109-E9A6CCDF9AF4")]
     32  [StorableType("F8D689F6-6CF2-4896-9109-E9A6CCDF9AF4")]
    3333  public class StochasticNormalMultiMoveGenerator : AdditiveMoveGenerator, IMultiMoveGenerator {
    3434    public IValueLookupParameter<DoubleValue> SigmaParameter {
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.RealVectorEncoding/3.3/Moves/StochasticPolynomialMultiMoveGenerator.cs

    r13368 r14711  
    2929namespace HeuristicLab.Encodings.RealVectorEncoding {
    3030  [Item("StochasticPolynomialMultiMoveGenerator", "Generates polynomial moves from a given real vector.")]
    31   [StorableClass("E3794FEB-061E-4031-AB82-7AC9B675BCAB")]
     31  [StorableType("E3794FEB-061E-4031-AB82-7AC9B675BCAB")]
    3232  public class StochasticPolynomialMultiMoveGenerator : AdditiveMoveGenerator, IMultiMoveGenerator {
    3333    /// <summary>
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.RealVectorEncoding/3.3/ParticleOperators/RealVectorNeighborhoodParticleUpdater.cs

    r13368 r14711  
    2727namespace HeuristicLab.Encodings.RealVectorEncoding {
    2828  [Item("Neighborhood Particle Updater", "Updates the particle's position using (among other things) the best neighbor's position. Point = Point + Velocity*Inertia + (PersonalBestPoint-Point)*Phi_P*r_p + (BestNeighborPoint-Point)*Phi_G*r_g.")]
    29   [StorableClass("3AA4BAE1-E220-4C1B-A98D-7D2DCCD8EA6C")]
     29  [StorableType("3AA4BAE1-E220-4C1B-A98D-7D2DCCD8EA6C")]
    3030  public sealed class RealVectorNeighborhoodParticleUpdater : RealVectorParticleUpdater, ILocalParticleUpdater {
    3131
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.RealVectorEncoding/3.3/ParticleOperators/RealVectorParticleCreator.cs

    r13368 r14711  
    2929namespace HeuristicLab.Encodings.RealVectorEncoding {
    3030  [Item("RealVectorParticleCreator", "Creates a particle with position, zero velocity vector and personal best.")]
    31   [StorableClass("2BAC68E4-1D1D-4A99-904E-5EFA8992FC75")]
     31  [StorableType("2BAC68E4-1D1D-4A99-904E-5EFA8992FC75")]
    3232  public class RealVectorParticleCreator : AlgorithmOperator, IRealVectorParticleCreator {
    3333
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.RealVectorEncoding/3.3/ParticleOperators/RealVectorParticleUpdater.cs

    r13368 r14711  
    3131
    3232  [Item("RealVectorParticleUpdater", "Updates a certain particle taking the current position and velocity into account, as well as the best point and the best point in a local neighborhood.")]
    33   [StorableClass("3D25AEC9-BBA1-429D-AE17-5FAD8ABA1E19")]
     33  [StorableType("3D25AEC9-BBA1-429D-AE17-5FAD8ABA1E19")]
    3434  public abstract class RealVectorParticleUpdater : SingleSuccessorOperator, IRealVectorParticleUpdater {
    3535
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.RealVectorEncoding/3.3/ParticleOperators/RealVectorSwarmUpdater.cs

    r13368 r14711  
    3434namespace HeuristicLab.Encodings.RealVectorEncoding {
    3535  [Item("RealVectorSwarmUpdater", "Updates personal best point and quality as well as global best point and quality.")]
    36   [StorableClass("225BE25D-6441-47EE-8189-9AAE78C4A3BF")]
     36  [StorableType("225BE25D-6441-47EE-8189-9AAE78C4A3BF")]
    3737  public sealed class RealVectorSwarmUpdater : SingleSuccessorOperator, IRealVectorSwarmUpdater, ISingleObjectiveOperator {
    3838
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.RealVectorEncoding/3.3/ParticleOperators/RealVectorTotallyConnectedParticleUpdater.cs

    r13368 r14711  
    2727namespace HeuristicLab.Encodings.RealVectorEncoding {
    2828  [Item("Totally Connected Particle Updater", "Updates the particle's position using (among other things) the global best position. Use together with the empty topology initialzer. Point = Point + Velocity*Inertia + (PersonalBestPoint-Point)*Phi_P*r_p + (BestPoint-Point)*Phi_G*r_g")]
    29   [StorableClass("1E56877E-2E96-4D97-864E-D52DC639919B")]
     29  [StorableType("1E56877E-2E96-4D97-864E-D52DC639919B")]
    3030  public sealed class RealVectorTotallyConnectedParticleUpdater : RealVectorParticleUpdater, IGlobalParticleUpdater {
    3131
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.RealVectorEncoding/3.3/RealVector.cs

    r13368 r14711  
    2626
    2727namespace HeuristicLab.Encodings.RealVectorEncoding {
    28   [StorableClass("CC9876FD-90CA-4CD1-B3D0-30825C98C3DC")]
     28  [StorableType("CC9876FD-90CA-4CD1-B3D0-30825C98C3DC")]
    2929  [Item("RealVector", "Represents a vector of real values.")]
    3030  public class RealVector : DoubleArray {
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.RealVectorEncoding/3.3/RealVectorCreator.cs

    r13368 r14711  
    3333  /// </summary>
    3434  [Item("RealVectorCreator", "A base class for operators creating real-valued vectors.")]
    35   [StorableClass("AD106219-C6C7-4FE7-BDB2-D187C1DFB1D7")]
     35  [StorableType("AD106219-C6C7-4FE7-BDB2-D187C1DFB1D7")]
    3636  public abstract class RealVectorCreator : InstrumentedOperator, IRealVectorCreator, IStochasticOperator {
    3737    public override bool CanChangeName {
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.RealVectorEncoding/3.3/RealVectorCrossover.cs

    r13368 r14711  
    3434  /// </summary>
    3535  [Item("RealVectorCrossover", "A base class for operators that perform a crossover of real-valued vectors.")]
    36   [StorableClass("BC045C7B-4CE7-4DFC-9C4A-54D5F8F29097")]
     36  [StorableType("BC045C7B-4CE7-4DFC-9C4A-54D5F8F29097")]
    3737  public abstract class RealVectorCrossover : InstrumentedOperator, IRealVectorCrossover, IStochasticOperator {
    3838    public override bool CanChangeName {
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.RealVectorEncoding/3.3/RealVectorEncoding.cs

    r13368 r14711  
    3333namespace HeuristicLab.Encodings.RealVectorEncoding {
    3434  [Item("RealVectorEncoding", "Describes a real vector encoding.")]
    35   [StorableClass("D08DC8DA-4F29-41AA-829D-A991487E8D19")]
     35  [StorableType("D08DC8DA-4F29-41AA-829D-A991487E8D19")]
    3636  public sealed class RealVectorEncoding : Encoding<IRealVectorCreator> {
    3737    #region Encoding Parameters
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.RealVectorEncoding/3.3/RealVectorManipulator.cs

    r13368 r14711  
    3434  /// </summary>
    3535  [Item("RealVectorManipulator", "A base class for operators that manipulate real-valued vectors.")]
    36   [StorableClass("1D48374A-D8C9-49D4-A430-7C20D6C14443")]
     36  [StorableType("1D48374A-D8C9-49D4-A430-7C20D6C14443")]
    3737  public abstract class RealVectorManipulator : InstrumentedOperator, IRealVectorManipulator, IStochasticOperator {
    3838    public override bool CanChangeName {
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.RealVectorEncoding/3.3/ReflectiveBoundsChecker.cs

    r13368 r14711  
    3434  /// </summary>
    3535  [Item("ReflectiveBoundsChecker", "Checks if all elements of a real vector are inside the bounds. If not, elements are mirrored at the bounds.")]
    36   [StorableClass("752716CC-81D8-432B-959A-4A022E8B8F2C")]
     36  [StorableType("752716CC-81D8-432B-959A-4A022E8B8F2C")]
    3737  public class ReflectiveBoundsChecker : SingleSuccessorOperator, IRealVectorBoundsChecker {
    3838    public LookupParameter<RealVector> RealVectorParameter {
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.RealVectorEncoding/3.3/ShakingOperators/RealVectorShakingOperator.cs

    r13368 r14711  
    3737  /// </summary>
    3838  [Item("RealVectorShakingOperator", "A shaking operator for VNS which uses available manipulation operators to perform the shaking.")]
    39   [StorableClass("A691B4FD-6FB7-4AA8-B49E-FEACB8FA1CAE")]
     39  [StorableType("A691B4FD-6FB7-4AA8-B49E-FEACB8FA1CAE")]
    4040  public class RealVectorShakingOperator : ShakingOperator<IRealVectorManipulator>, IRealVectorMultiNeighborhoodShakingOperator, IStochasticOperator {
    4141
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.RealVectorEncoding/3.3/StrategyParameters/StdDevStrategyVectorCreator.cs

    r13368 r14711  
    3030namespace HeuristicLab.Encodings.RealVectorEncoding {
    3131  [Item("StdDevStrategyVectorCreator", "Creates the endogeneous strategy parameters.")]
    32   [StorableClass("C7872B5A-AFC9-4192-95A0-5C4940834396")]
     32  [StorableType("C7872B5A-AFC9-4192-95A0-5C4940834396")]
    3333  public class StdDevStrategyVectorCreator : SingleSuccessorOperator, IStochasticOperator, IRealVectorStdDevStrategyParameterCreator {
    3434    public override bool CanChangeName {
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.RealVectorEncoding/3.3/StrategyParameters/StdDevStrategyVectorCrossover.cs

    r13368 r14711  
    2929namespace HeuristicLab.Encodings.RealVectorEncoding {
    3030  [Item("StdDevStrategyVectorCrossover", "Crosses the strategy vector by using intermediate recombination (average crossover).")]
    31   [StorableClass("74AD9335-0AC3-41C5-BD38-779A87B32A4E")]
     31  [StorableType("74AD9335-0AC3-41C5-BD38-779A87B32A4E")]
    3232  public class StdDevStrategyVectorCrossover : SingleSuccessorOperator, IStochasticOperator, IRealVectorStdDevStrategyParameterCrossover {
    3333    public override bool CanChangeName {
  • branches/PersistenceOverhaul/HeuristicLab.Encodings.RealVectorEncoding/3.3/StrategyParameters/StdDevStrategyVectorManipulator.cs

    r13368 r14711  
    3535  /// </summary>
    3636  [Item("StdDevStrategyVectorManipulator", "Mutates the endogenous strategy parameters.")]
    37   [StorableClass("E2427F65-BE01-4243-877D-84FD70EC6EBC")]
     37  [StorableType("E2427F65-BE01-4243-877D-84FD70EC6EBC")]
    3838  public class StdDevStrategyVectorManipulator : SingleSuccessorOperator, IStochasticOperator, IRealVectorStdDevStrategyParameterManipulator {
    3939    public override bool CanChangeName {
Note: See TracChangeset for help on using the changeset viewer.