Changeset 3160 for trunk/sources/HeuristicLab.Encodings.PermutationEncoding
- Timestamp:
- 03/22/10 03:25:21 (15 years ago)
- Location:
- trunk/sources/HeuristicLab.Encodings.PermutationEncoding/3.3
- Files:
-
- 19 edited
Legend:
- Unmodified
- Added
- Removed
-
trunk/sources/HeuristicLab.Encodings.PermutationEncoding/3.3/Creators/RandomPermutationCreator.cs
r3053 r3160 33 33 [Item("RandomPermutationCreator", "An operator which creates a new random permutation of integer values.")] 34 34 [StorableClass] 35 [Creatable("Test")]36 35 public sealed class RandomPermutationCreator : SingleSuccessorOperator, IPermutationCreator, IStochasticOperator { 37 36 public override bool CanChangeName { -
trunk/sources/HeuristicLab.Encodings.PermutationEncoding/3.3/Crossovers/CosaCrossover.cs
r3053 r3160 36 36 [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 37 [StorableClass] 38 [Creatable("Test")]39 38 public class CosaCrossover : PermutationCrossover { 40 39 /// <summary> -
trunk/sources/HeuristicLab.Encodings.PermutationEncoding/3.3/Crossovers/CyclicCrossover.cs
r3053 r3160 33 33 [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 34 [StorableClass] 35 [Creatable("Test")]36 35 public class CyclicCrossover : PermutationCrossover { 37 36 /// <summary> -
trunk/sources/HeuristicLab.Encodings.PermutationEncoding/3.3/Crossovers/CyclicCrossover2.cs
r3053 r3160 34 34 [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 35 [StorableClass] 36 [Creatable("Test")]37 36 public class CyclicCrossover2 : PermutationCrossover { 38 37 /// <summary> -
trunk/sources/HeuristicLab.Encodings.PermutationEncoding/3.3/Crossovers/EdgeRecombinationCrossover.cs
r3053 r3160 36 36 [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.")] 37 37 [StorableClass] 38 [Creatable("Test")]39 38 public class EdgeRecombinationCrossover : PermutationCrossover { 40 39 /// <summary> -
trunk/sources/HeuristicLab.Encodings.PermutationEncoding/3.3/Crossovers/MaximalPreservativeCrossover.cs
r3053 r3160 36 36 [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 37 [StorableClass] 38 [Creatable("Test")]39 38 public class MaximalPreservativeCrossover : PermutationCrossover { 40 39 /// <summary> -
trunk/sources/HeuristicLab.Encodings.PermutationEncoding/3.3/Crossovers/OrderBasedCrossover.cs
r3053 r3160 36 36 [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 37 [StorableClass] 38 [Creatable("Test")]39 38 public class OrderBasedCrossover : PermutationCrossover { 40 39 /// <summary> -
trunk/sources/HeuristicLab.Encodings.PermutationEncoding/3.3/Crossovers/OrderCrossover.cs
r3053 r3160 36 36 [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 37 [StorableClass] 38 [Creatable("Test")]39 38 public class OrderCrossover : PermutationCrossover { 40 39 /// <summary> -
trunk/sources/HeuristicLab.Encodings.PermutationEncoding/3.3/Crossovers/OrderCrossover2.cs
r3053 r3160 35 35 [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 36 [StorableClass] 37 [Creatable("Test")]38 37 public class OrderCrossover2 : PermutationCrossover { 39 38 /// <summary> -
trunk/sources/HeuristicLab.Encodings.PermutationEncoding/3.3/Crossovers/PartiallyMatchedCrossover.cs
r3053 r3160 35 35 [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 36 [StorableClass] 37 [Creatable("Test")]38 37 public class PartiallyMatchedCrossover : PermutationCrossover { 39 38 /// <summary> -
trunk/sources/HeuristicLab.Encodings.PermutationEncoding/3.3/Crossovers/PositionBasedCrossover.cs
r3053 r3160 33 33 [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 34 [StorableClass] 35 [Creatable("Test")]36 35 public class PositionBasedCrossover : PermutationCrossover { 37 36 /// <summary> -
trunk/sources/HeuristicLab.Encodings.PermutationEncoding/3.3/Manipulators/InsertionManipulator.cs
r3053 r3160 32 32 [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 33 [StorableClass] 34 [Creatable("Test")]35 34 public class InsertionManipulator : PermutationManipulator { 36 35 /// <summary> -
trunk/sources/HeuristicLab.Encodings.PermutationEncoding/3.3/Manipulators/InversionManipulator.cs
r3053 r3160 32 32 [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 33 [StorableClass] 34 [Creatable("Test")]35 34 public class InversionManipulator : PermutationManipulator { 36 35 /// <summary> -
trunk/sources/HeuristicLab.Encodings.PermutationEncoding/3.3/Manipulators/ScrambleManipulator.cs
r3053 r3160 32 32 [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 33 [StorableClass] 34 [Creatable("Test")]35 34 public class ScrambleManipulator : PermutationManipulator { 36 35 /// <summary> -
trunk/sources/HeuristicLab.Encodings.PermutationEncoding/3.3/Manipulators/Swap2Manipulator.cs
r3053 r3160 32 32 [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 33 [StorableClass] 34 [Creatable("Test")]35 34 public class Swap2Manipulator : PermutationManipulator { 36 35 /// <summary> -
trunk/sources/HeuristicLab.Encodings.PermutationEncoding/3.3/Manipulators/Swap3Manipulator.cs
r3053 r3160 34 34 [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 35 [StorableClass] 36 [Creatable("Test")]37 36 public class Swap3Manipulator : PermutationManipulator { 38 37 /// <summary> -
trunk/sources/HeuristicLab.Encodings.PermutationEncoding/3.3/Manipulators/TranslocationInversionManipulator.cs
r3053 r3160 33 33 [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 34 [StorableClass] 35 [Creatable("Test")]36 35 public class TranslocationInversionManipulator : PermutationManipulator { 37 36 /// <summary> -
trunk/sources/HeuristicLab.Encodings.PermutationEncoding/3.3/Manipulators/TranslocationManipulator.cs
r3053 r3160 33 33 [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 34 [StorableClass] 35 [Creatable("Test")]36 35 public class TranslocationManipulator : PermutationManipulator { 37 36 /// <summary> -
trunk/sources/HeuristicLab.Encodings.PermutationEncoding/3.3/Permutation.cs
r3054 r3160 27 27 [StorableClass] 28 28 [Item("Permutation", "Represents a permutation of integer values.")] 29 [Creatable("Test")]30 29 public class Permutation : IntArray { 31 30 public Permutation() : base() { }
Note: See TracChangeset
for help on using the changeset viewer.