Context Navigation

Manipulators

Timestamp:

03/22/10 03:25:21 (14 years ago)

Author:

swagner

Message:

Removed Creatable test attribute (#935).

Location:

Files:

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>

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>

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>

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>

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>

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>

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>

Note: See TracChangeset for help on using the changeset viewer.