Free cookie consent management tool by TermsFeed Policy Generator

Ignore:
Timestamp:
03/10/10 18:28:50 (14 years ago)
Author:
epitzer
Message:

Make StorableClass attribute compulsory for StorableSerializer to work, add named property StorableClassType to choose between Empty and MarkedOnly, later other options will be added. (#548)

Location:
trunk/sources/HeuristicLab.Encodings.Permutation/3.3
Files:
22 edited

Legend:

Unmodified
Added
Removed

  • trunk/sources/HeuristicLab.Encodings.Permutation/3.3/Creators/RandomPermutationCreator.cs

    r2907 r2994  
    3232  /// </summary>
    3333  [Item("RandomPermutationCreator", "An operator which creates a new random permutation of integer values.")]
    34   [EmptyStorableClass]
     34  [StorableClass(StorableClassType.Empty)]
    3535  [Creatable("Test")]
    3636  public sealed class RandomPermutationCreator : SingleSuccessorOperator, IPermutationCreator, IStochasticOperator {

  • trunk/sources/HeuristicLab.Encodings.Permutation/3.3/Crossovers/CosaCrossover.cs

    r2907 r2994  
    3535  /// </remarks>
    3636  [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.")]
    37   [EmptyStorableClass]
     37  [StorableClass(StorableClassType.Empty)]
    3838  [Creatable("Test")]
    3939  public class CosaCrossover : PermutationCrossover {

  • trunk/sources/HeuristicLab.Encodings.Permutation/3.3/Crossovers/CyclicCrossover.cs

    r2907 r2994  
    3232  /// </remarks>
    3333  [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.")]
    34   [EmptyStorableClass]
     34  [StorableClass(StorableClassType.Empty)]
    3535  [Creatable("Test")]
    3636  public class CyclicCrossover : PermutationCrossover {

  • trunk/sources/HeuristicLab.Encodings.Permutation/3.3/Crossovers/CyclicCrossover2.cs

    r2907 r2994  
    3333  /// </remarks>
    3434  [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.")]
    35   [EmptyStorableClass]
     35  [StorableClass(StorableClassType.Empty)]
    3636  [Creatable("Test")]
    3737  public class CyclicCrossover2 : PermutationCrossover {

  • trunk/sources/HeuristicLab.Encodings.Permutation/3.3/Crossovers/EdgeRecombinationCrossover.cs

    r2907 r2994  
    3535  /// </remarks>
    3636  [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 ov Genetic Algorithms, New York, pp. 350-372.")]
    37   [EmptyStorableClass]
     37  [StorableClass(StorableClassType.Empty)]
    3838  [Creatable("Test")]
    3939  public class EdgeRecombinationCrossover : PermutationCrossover {

  • trunk/sources/HeuristicLab.Encodings.Permutation/3.3/Crossovers/MaximalPreservativeCrossover.cs

    r2907 r2994  
    3535  /// </remarks>
    3636  [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.")]
    37   [EmptyStorableClass]
     37  [StorableClass(StorableClassType.Empty)]
    3838  [Creatable("Test")]
    3939  public class MaximalPreservativeCrossover : PermutationCrossover {

  • trunk/sources/HeuristicLab.Encodings.Permutation/3.3/Crossovers/OrderBasedCrossover.cs

    r2907 r2994  
    3535  /// </remarks>
    3636  [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.")]
    37   [EmptyStorableClass]
     37  [StorableClass(StorableClassType.Empty)]
    3838  [Creatable("Test")]
    3939  public class OrderBasedCrossover : PermutationCrossover {

  • trunk/sources/HeuristicLab.Encodings.Permutation/3.3/Crossovers/OrderCrossover.cs

    r2907 r2994  
    3535  /// </remarks>
    3636  [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.")]
    37   [EmptyStorableClass]
     37  [StorableClass(StorableClassType.Empty)]
    3838  [Creatable("Test")]
    3939  public class OrderCrossover : PermutationCrossover {

  • trunk/sources/HeuristicLab.Encodings.Permutation/3.3/Crossovers/OrderCrossover2.cs

    r2907 r2994  
    3434  /// </remarks>
    3535  [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.")]
    36   [EmptyStorableClass]
     36  [StorableClass(StorableClassType.Empty)]
    3737  [Creatable("Test")]
    3838  public class OrderCrossover2 : PermutationCrossover {

  • trunk/sources/HeuristicLab.Encodings.Permutation/3.3/Crossovers/PartiallyMatchedCrossover.cs

    r2907 r2994  
    3434  /// </remarks>
    3535  [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.")]
    36   [EmptyStorableClass]
     36  [StorableClass(StorableClassType.Empty)]
    3737  [Creatable("Test")]
    3838  public class PartiallyMatchedCrossover : PermutationCrossover {

  • trunk/sources/HeuristicLab.Encodings.Permutation/3.3/Crossovers/PositionBasedCrossover.cs

    r2907 r2994  
    3232  /// </remarks>
    3333  [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.")]
    34   [EmptyStorableClass]
     34  [StorableClass(StorableClassType.Empty)]
    3535  [Creatable("Test")]
    3636  public class PositionBasedCrossover : PermutationCrossover {

  • trunk/sources/HeuristicLab.Encodings.Permutation/3.3/Manipulators/InsertionManipulator.cs

    r2907 r2994  
    3131  /// </remarks>
    3232  [Item("InsertionManipulator", "An operator which moves randomly one element to another position in the permutation. It is implemented as described in Fogel, D.B. (1988). An Evolutionary Approach to the Traveling Salesman Problem, Biological Cybernetics, 60, pp. 139-144.")]
    33   [EmptyStorableClass]
     33  [StorableClass(StorableClassType.Empty)]
    3434  [Creatable("Test")]
    3535  public class InsertionManipulator : PermutationManipulator {

  • trunk/sources/HeuristicLab.Encodings.Permutation/3.3/Manipulators/InversionManipulator.cs

    r2907 r2994  
    3131  /// </remarks>
    3232  [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.")]
    33   [EmptyStorableClass]
     33  [StorableClass(StorableClassType.Empty)]
    3434  [Creatable("Test")]
    3535  public class InversionManipulator : PermutationManipulator {

  • trunk/sources/HeuristicLab.Encodings.Permutation/3.3/Manipulators/ScrambleManipulator.cs

    r2907 r2994  
    3131  /// </remarks>
    3232  [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.")]
    33   [EmptyStorableClass]
     33  [StorableClass(StorableClassType.Empty)]
    3434  [Creatable("Test")]
    3535  public class ScrambleManipulator : PermutationManipulator {

  • trunk/sources/HeuristicLab.Encodings.Permutation/3.3/Manipulators/Swap2Manipulator.cs

    r2907 r2994  
    3131  /// </remarks>
    3232  [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.")]
    33   [EmptyStorableClass]
     33  [StorableClass(StorableClassType.Empty)]
    3434  [Creatable("Test")]
    3535  public class Swap2Manipulator : PermutationManipulator {

  • trunk/sources/HeuristicLab.Encodings.Permutation/3.3/Manipulators/Swap3Manipulator.cs

    r2907 r2994  
    3333  /// </remarks>
    3434  [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.")]
    35   [EmptyStorableClass]
     35  [StorableClass(StorableClassType.Empty)]
    3636  [Creatable("Test")]
    3737  public class Swap3Manipulator : PermutationManipulator {

  • trunk/sources/HeuristicLab.Encodings.Permutation/3.3/Manipulators/TranslocationInversionManipulator.cs

    r2907 r2994  
    3232  /// </remarks>
    3333  [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.")]
    34   [EmptyStorableClass]
     34  [StorableClass(StorableClassType.Empty)]
    3535  [Creatable("Test")]
    3636  public class TranslocationInversionManipulator : PermutationManipulator {

  • trunk/sources/HeuristicLab.Encodings.Permutation/3.3/Manipulators/TranslocationManipulator.cs

    r2907 r2994  
    3232  /// </remarks>
    3333  [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.")]
    34   [EmptyStorableClass]
     34  [StorableClass(StorableClassType.Empty)]
    3535  [Creatable("Test")]
    3636  public class TranslocationManipulator : PermutationManipulator {

  • trunk/sources/HeuristicLab.Encodings.Permutation/3.3/Moves/Permutation2IndexMove.cs

    r2984 r2994  
    2525namespace HeuristicLab.Encodings.Permutation {
    2626  [Item("Permutation2IndexMove", "A move on a permutation that is specified by 2 indices")]
     27  [StorableClass(StorableClassType.MarkedOnly)]
    2728  public class Permutation2IndexMove : Item {
    2829    [Storable]

  • trunk/sources/HeuristicLab.Encodings.Permutation/3.3/Permutation.cs

    r2974 r2994  
    2828
    2929namespace HeuristicLab.Encodings.Permutation {
    30   [EmptyStorableClass]
     30  [StorableClass(StorableClassType.Empty)]
    3131  [Item("Permutation", "Represents a permutation of integer values.")]
    3232  [Creatable("Test")]

  • trunk/sources/HeuristicLab.Encodings.Permutation/3.3/PermutationCrossover.cs

    r2947 r2994  
    3131  /// </summary>
    3232  [Item("PermutationCrossover", "A base class for permutation crossover operators.")]
    33   [EmptyStorableClass]
     33  [StorableClass(StorableClassType.Empty)]
    3434  public abstract class PermutationCrossover : SingleSuccessorOperator, IPermutationCrossover, IStochasticOperator {
    3535    public ILookupParameter<IRandom> RandomParameter {

  • trunk/sources/HeuristicLab.Encodings.Permutation/3.3/PermutationManipulator.cs

    r2906 r2994  
    3131  /// </summary>
    3232  [Item("PermutationManipulator", "A base class for permutation manipulation operators.")]
    33   [EmptyStorableClass]
     33  [StorableClass(StorableClassType.Empty)]
    3434  public abstract class PermutationManipulator : SingleSuccessorOperator, IPermutationManipulator, IStochasticOperator {
    3535    public ILookupParameter<IRandom> RandomParameter {
Note: See TracChangeset for help on using the changeset viewer.