- Timestamp:
- 11/24/15 17:08:13 (9 years ago)
- 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 33 33 /// </summary> 34 34 [Item("RandomPermutationCreator", "An operator which creates a new random permutation of integer values.")] 35 [StorableClass ]35 [StorableClass("A1067375-67E4-4BBE-B7C1-08614C0FB608")] 36 36 public sealed class RandomPermutationCreator : InstrumentedOperator, IPermutationCreator, IStochasticOperator { 37 37 public override bool CanChangeName { -
branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Crossovers/CosaCrossover.cs
r12012 r13368 36 36 /// </remarks> 37 37 [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")] 39 39 public class CosaCrossover : PermutationCrossover { 40 40 [StorableConstructor] -
branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Crossovers/CyclicCrossover.cs
r12012 r13368 33 33 /// </remarks> 34 34 [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")] 36 36 public class CyclicCrossover : PermutationCrossover { 37 37 [StorableConstructor] -
branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Crossovers/CyclicCrossover2.cs
r12012 r13368 34 34 /// </remarks> 35 35 [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")] 37 37 public class CyclicCrossover2 : PermutationCrossover { 38 38 [StorableConstructor] -
branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Crossovers/EdgeRecombinationCrossover.cs
r12012 r13368 36 36 /// </remarks> 37 37 [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")] 39 39 public class EdgeRecombinationCrossover : PermutationCrossover { 40 40 [StorableConstructor] -
branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Crossovers/MaximalPreservativeCrossover.cs
r12012 r13368 30 30 /// Performs a crossover between two permuation arrays by preserving a large number of edges in both parents. 31 31 /// 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 /> 33 33 /// 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. 35 35 /// If the length of the permutation is smaller than 15, the size of the segment is always equal to 3. 36 36 /// </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")] 39 39 public class MaximalPreservativeCrossover : PermutationCrossover { 40 40 [StorableConstructor] … … 71 71 int breakPoint1, breakPoint2, subsegmentLength, index; 72 72 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. 74 74 breakPoint1 = random.Next(length); 75 75 breakPoint2 = breakPoint1 + subsegmentLength; -
branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Crossovers/MultiPermutationCrossover.cs
r12012 r13368 1 #region License Information1 #region License Information 2 2 /* HeuristicLab 3 3 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL) … … 33 33 namespace HeuristicLab.Encodings.PermutationEncoding { 34 34 [Item("MultiPermutationCrossover", "Randomly selects and applies one of its crossovers every time it is called.")] 35 [StorableClass ]35 [StorableClass("F350D445-AB72-4B38-91A1-961A9D24141A")] 36 36 public class MultiPermutationCrossover : StochasticMultiBranch<IPermutationCrossover>, IPermutationCrossover, IStochasticOperator { 37 37 public override bool CanChangeName { -
branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Crossovers/OrderBasedCrossover.cs
r12012 r13368 36 36 /// </remarks> 37 37 [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")] 39 39 public class OrderBasedCrossover : PermutationCrossover { 40 40 [StorableConstructor] -
branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Crossovers/OrderCrossover.cs
r12012 r13368 36 36 /// </remarks> 37 37 [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")] 39 39 public class OrderCrossover : PermutationCrossover { 40 40 [StorableConstructor] -
branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Crossovers/OrderCrossover2.cs
r12012 r13368 1 #region License Information1 #region License Information 2 2 /* HeuristicLab 3 3 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL) … … 35 35 /// </remarks> 36 36 [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")] 38 38 public class OrderCrossover2 : PermutationCrossover { 39 39 [StorableConstructor] -
branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Crossovers/PartiallyMatchedCrossover.cs
r12012 r13368 35 35 /// </remarks> 36 36 [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")] 38 38 public class PartiallyMatchedCrossover : PermutationCrossover { 39 39 [StorableConstructor] -
branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Crossovers/PositionBasedCrossover.cs
r12012 r13368 33 33 /// </remarks> 34 34 [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")] 36 36 public class PositionBasedCrossover : PermutationCrossover { 37 37 [StorableConstructor] -
branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Crossovers/UniformLikeCrossover.cs
r12012 r13368 1 #region License Information1 #region License Information 2 2 /* HeuristicLab 3 3 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL) … … 28 28 namespace HeuristicLab.Encodings.PermutationEncoding { 29 29 [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")] 31 31 public sealed class UniformLikeCrossover : PermutationCrossover { 32 32 [StorableConstructor] -
branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Manipulators/InsertionManipulator.cs
r12012 r13368 32 32 /// </remarks> 33 33 [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")] 35 35 public class InsertionManipulator : PermutationManipulator { 36 36 [StorableConstructor] -
branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Manipulators/InversionManipulator.cs
r12012 r13368 32 32 /// </remarks> 33 33 [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")] 35 35 public class InversionManipulator : PermutationManipulator { 36 36 [StorableConstructor] -
branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Manipulators/MultiPermutationManipulator.cs
r12012 r13368 1 #region License Information1 #region License Information 2 2 /* HeuristicLab 3 3 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL) … … 33 33 namespace HeuristicLab.Encodings.PermutationEncoding { 34 34 [Item("MultiPermutationManipulator", "Randomly selects and applies one of its manipulators every time it is called.")] 35 [StorableClass ]35 [StorableClass("A7EB272E-7E7F-443F-80B2-CF2FAA2908CC")] 36 36 public class MultiPermutationManipulator : StochasticMultiBranch<IPermutationManipulator>, IPermutationManipulator, IStochasticOperator { 37 37 public override bool CanChangeName { -
branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Manipulators/ScrambleManipulator.cs
r12012 r13368 32 32 /// </remarks> 33 33 [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")] 35 35 public class ScrambleManipulator : PermutationManipulator { 36 36 [StorableConstructor] -
branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Manipulators/Swap2Manipulator.cs
r12012 r13368 32 32 /// </remarks> 33 33 [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")] 35 35 public class Swap2Manipulator : PermutationManipulator { 36 36 [StorableConstructor] -
branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Manipulators/Swap3Manipulator.cs
r12012 r13368 34 34 /// </remarks> 35 35 [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")] 37 37 public class Swap3Manipulator : PermutationManipulator { 38 38 [StorableConstructor] -
branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Manipulators/TranslocationInversionManipulator.cs
r12012 r13368 33 33 /// </remarks> 34 34 [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")] 36 36 public class TranslocationInversionManipulator : PermutationManipulator { 37 37 [StorableConstructor] -
branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Manipulators/TranslocationManipulator.cs
r12012 r13368 33 33 /// </remarks> 34 34 [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")] 36 36 public class TranslocationManipulator : PermutationManipulator { 37 37 [StorableConstructor] -
branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Moves/Edge.cs
r12012 r13368 1 #region License Information1 #region License Information 2 2 /* HeuristicLab 3 3 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL) … … 26 26 namespace HeuristicLab.Encodings.PermutationEncoding { 27 27 [Item("Edge", "An edge between two integer nodes and a flag for the direction.")] 28 [StorableClass ]28 [StorableClass("D680CEE9-7AD1-4B9C-BCF1-6A164B419134")] 29 29 public class Edge : Item { 30 30 [Storable] -
branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Moves/PermutationMoveAttribute.cs
r12012 r13368 1 #region License Information1 #region License Information 2 2 /* HeuristicLab 3 3 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL) … … 26 26 namespace HeuristicLab.Encodings.PermutationEncoding { 27 27 [Item("PermutationMoveAttribute", "Base class for specifying a move attribute")] 28 [StorableClass ]28 [StorableClass("C4A12864-0A1D-4F1F-9344-0799C5FBA743")] 29 29 public class PermutationMoveAttribute : Item { 30 30 [Storable] -
branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Moves/Scramble/ScrambleMove.cs
r12012 r13368 1 #region License Information1 #region License Information 2 2 /* HeuristicLab 3 3 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL) … … 26 26 namespace HeuristicLab.Encodings.PermutationEncoding { 27 27 [Item("ScrambleMove", "Item that describes a scramble move.")] 28 [StorableClass ]28 [StorableClass("F476B122-D942-4E3D-AE60-232038E1B587")] 29 29 public sealed class ScrambleMove : Item { 30 30 [Storable] -
branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Moves/Scramble/ScrambleMoveGenerator.cs
r12012 r13368 1 #region License Information1 #region License Information 2 2 /* HeuristicLab 3 3 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL) … … 29 29 namespace HeuristicLab.Encodings.PermutationEncoding { 30 30 [Item("ScrambleMoveGenerator", "Base class for all scramble move generators.")] 31 [StorableClass ]31 [StorableClass("52F3D879-3375-4623-91D7-CA2A515493BC")] 32 32 public abstract class ScrambleMoveGenerator : SingleSuccessorOperator, IPermutationScrambleMoveOperator, IMoveGenerator { 33 33 public override bool CanChangeName { -
branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Moves/Scramble/ScrambleMoveMaker.cs
r12012 r13368 1 #region License Information1 #region License Information 2 2 /* HeuristicLab 3 3 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL) … … 30 30 namespace HeuristicLab.Encodings.PermutationEncoding { 31 31 [Item("ScrambleMoveMaker", "Peforms a scramble move on a given permutation and updates the quality.")] 32 [StorableClass ]32 [StorableClass("4EC7AAF2-33BE-4CB8-A9C1-FB913496EA3B")] 33 33 public class ScrambleMoveMaker : SingleSuccessorOperator, IPermutationScrambleMoveOperator, IMoveMaker, ISingleObjectiveOperator { 34 34 public override bool CanChangeName { -
branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Moves/Scramble/StochasticScrambleMultiMoveGenerator.cs
r12012 r13368 1 #region License Information1 #region License Information 2 2 /* HeuristicLab 3 3 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL) … … 31 31 namespace HeuristicLab.Encodings.PermutationEncoding { 32 32 [Item("StochasticScrambleMultiMoveGenerator", "Randomly samples n from all possible scramble moves from a given permutation.")] 33 [StorableClass ]33 [StorableClass("3BB4C6C6-7984-4423-A6FE-58394E5C528B")] 34 34 public class StochasticScrambleMultiMoveGenerator : ScrambleMoveGenerator, IMultiMoveGenerator, IStochasticOperator { 35 35 public ILookupParameter<IRandom> RandomParameter { -
branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Moves/Swap2/ExhaustiveSwap2MoveGenerator.cs
r12012 r13368 1 #region License Information1 #region License Information 2 2 /* HeuristicLab 3 3 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL) … … 29 29 namespace HeuristicLab.Encodings.PermutationEncoding { 30 30 [Item("ExhaustiveSwap2MoveGenerator", "Generates all possible swap-2 moves from a given permutation.")] 31 [StorableClass ]31 [StorableClass("BEE5F7B6-9DF3-4810-8E52-C7D4402EA5BB")] 32 32 public class ExhaustiveSwap2MoveGenerator : Swap2MoveGenerator, IExhaustiveMoveGenerator { 33 33 [StorableConstructor] -
branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Moves/Swap2/StochasticSwap2MultiMoveGenerator.cs
r12012 r13368 1 #region License Information1 #region License Information 2 2 /* HeuristicLab 3 3 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL) … … 29 29 namespace HeuristicLab.Encodings.PermutationEncoding { 30 30 [Item("StochasticSwap2MultiMoveGenerator", "Randomly samples n from all possible swap-2 moves from a given permutation.")] 31 [StorableClass ]31 [StorableClass("E5D11F27-2647-44AD-BA8B-236C4D46AC69")] 32 32 public class StochasticSwap2MultiMoveGenerator : Swap2MoveGenerator, IMultiMoveGenerator, IStochasticOperator { 33 33 public ILookupParameter<IRandom> RandomParameter { -
branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Moves/Swap2/StochasticSwap2SingleMoveGenerator.cs
r12012 r13368 1 #region License Information1 #region License Information 2 2 /* HeuristicLab 3 3 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL) … … 29 29 namespace HeuristicLab.Encodings.PermutationEncoding { 30 30 [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")] 32 32 public class StochasticSwap2SingleMoveGenerator : Swap2MoveGenerator, IStochasticOperator, ISingleMoveGenerator { 33 33 public ILookupParameter<IRandom> RandomParameter { -
branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Moves/Swap2/Swap2Move.cs
r12012 r13368 1 #region License Information1 #region License Information 2 2 /* HeuristicLab 3 3 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL) … … 26 26 namespace HeuristicLab.Encodings.PermutationEncoding { 27 27 [Item("Swap2Move", "Item that describes a swap-2 move.")] 28 [StorableClass ]28 [StorableClass("26CB204D-F3ED-4C88-B5A4-6369278E4540")] 29 29 public class Swap2Move : TwoIndexMove { 30 30 [StorableConstructor] -
branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Moves/Swap2/Swap2MoveAbsoluteAttribute.cs
r12012 r13368 1 #region License Information1 #region License Information 2 2 /* HeuristicLab 3 3 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL) … … 26 26 namespace HeuristicLab.Encodings.PermutationEncoding { 27 27 [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")] 29 29 public class Swap2MoveAbsoluteAttribute : PermutationMoveAttribute { 30 30 [Storable] -
branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Moves/Swap2/Swap2MoveGenerator.cs
r12012 r13368 1 #region License Information1 #region License Information 2 2 /* HeuristicLab 3 3 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL) … … 29 29 namespace HeuristicLab.Encodings.PermutationEncoding { 30 30 [Item("Swap2MoveGenerator", "Base class for all swap-2 move generators.")] 31 [StorableClass ]31 [StorableClass("8DD2743F-2966-4CF0-8501-68208A761289")] 32 32 public abstract class Swap2MoveGenerator : SingleSuccessorOperator, IPermutationSwap2MoveOperator, IMoveGenerator { 33 33 public override bool CanChangeName { -
branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Moves/Swap2/Swap2MoveHardTabuCriterion.cs
r12012 r13368 1 #region License Information1 #region License Information 2 2 /* HeuristicLab 3 3 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL) … … 34 34 35 35 If 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")] 37 37 public class Swap2MoveHardTabuCriterion : SingleSuccessorOperator, IPermutationSwap2MoveOperator, ITabuChecker { 38 38 public override bool CanChangeName { -
branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Moves/Swap2/Swap2MoveMaker.cs
r12012 r13368 1 #region License Information1 #region License Information 2 2 /* HeuristicLab 3 3 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL) … … 30 30 namespace HeuristicLab.Encodings.PermutationEncoding { 31 31 [Item("Swap2MoveMaker", "Peforms a swap-2 move on a given permutation and updates the quality.")] 32 [StorableClass ]32 [StorableClass("2853359E-C0DF-43C9-A6DC-B8680CC66288")] 33 33 public class Swap2MoveMaker : SingleSuccessorOperator, IPermutationSwap2MoveOperator, IMoveMaker, ISingleObjectiveOperator { 34 34 public override bool CanChangeName { -
branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Moves/Swap2/Swap2MoveRelativeAttribute.cs
r12012 r13368 1 #region License Information1 #region License Information 2 2 /* HeuristicLab 3 3 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL) … … 26 26 namespace HeuristicLab.Encodings.PermutationEncoding { 27 27 [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")] 29 29 public class Swap2MoveRelativeAttribute : PermutationMoveAttribute { 30 30 [Storable] -
branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Moves/Swap2/Swap2MoveSoftTabuCriterion.cs
r12012 r13368 1 #region License Information1 #region License Information 2 2 /* HeuristicLab 3 3 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL) … … 34 34 35 35 If 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")] 37 37 public class Swap2MoveSoftTabuCriterion : SingleSuccessorOperator, IPermutationSwap2MoveOperator, ITabuChecker { 38 38 public override bool CanChangeName { -
branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Moves/Swap2/Swap2MoveTabuMaker.cs
r12012 r13368 1 #region License Information1 #region License Information 2 2 /* HeuristicLab 3 3 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL) … … 28 28 namespace HeuristicLab.Encodings.PermutationEncoding { 29 29 [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")] 31 31 public class Swap2MoveTabuMaker : TabuMaker, IPermutationSwap2MoveOperator { 32 32 public ILookupParameter<Permutation> PermutationParameter { -
branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Moves/ThreeIndexMove.cs
r12012 r13368 1 #region License Information1 #region License Information 2 2 /* HeuristicLab 3 3 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL) … … 26 26 namespace HeuristicLab.Encodings.PermutationEncoding { 27 27 [Item("ThreeIndexMove", "A move on a permutation that is specified by 3 indices.")] 28 [StorableClass ]28 [StorableClass("D0C144E4-A935-41E2-865C-9C64E5E94483")] 29 29 public class ThreeIndexMove : Item { 30 30 [Storable] -
branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Moves/ThreeOpt/ExhaustiveInsertionMoveGenerator.cs
r12012 r13368 1 #region License Information1 #region License Information 2 2 /* HeuristicLab 3 3 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL) … … 30 30 namespace HeuristicLab.Encodings.PermutationEncoding { 31 31 [Item("ExhaustiveInsertionMoveGenerator", "Generates all possible insertion moves (3-opt) from a given permutation.")] 32 [StorableClass ]32 [StorableClass("8F845DE6-046D-4B30-A194-9EF7F2C96027")] 33 33 public class ExhaustiveInsertionMoveGenerator : TranslocationMoveGenerator, IExhaustiveMoveGenerator { 34 34 [StorableConstructor] -
branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Moves/ThreeOpt/StochasticSingleInsertionMoveGenerator.cs
r12012 r13368 1 #region License Information1 #region License Information 2 2 /* HeuristicLab 3 3 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL) … … 31 31 namespace HeuristicLab.Encodings.PermutationEncoding { 32 32 [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")] 34 34 public class StochasticInsertionMultiMoveGenerator : TranslocationMoveGenerator, IMultiMoveGenerator, IStochasticOperator { 35 35 public ILookupParameter<IRandom> RandomParameter { -
branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Moves/ThreeOpt/StochasticTranslocationMultiMoveGenerator.cs
r12012 r13368 1 #region License Information1 #region License Information 2 2 /* HeuristicLab 3 3 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL) … … 29 29 namespace HeuristicLab.Encodings.PermutationEncoding { 30 30 [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")] 32 32 public class StochasticTranslocationMultiMoveGenerator : TranslocationMoveGenerator, IStochasticOperator, IMultiMoveGenerator { 33 33 public ILookupParameter<IRandom> RandomParameter { -
branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Moves/ThreeOpt/StochasticTranslocationSingleMoveGenerator.cs
r12012 r13368 1 #region License Information1 #region License Information 2 2 /* HeuristicLab 3 3 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL) … … 29 29 namespace HeuristicLab.Encodings.PermutationEncoding { 30 30 [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")] 32 32 public class StochasticTranslocationSingleMoveGenerator : TranslocationMoveGenerator, IStochasticOperator, ISingleMoveGenerator { 33 33 public ILookupParameter<IRandom> RandomParameter { -
branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Moves/ThreeOpt/TranslocationMove.cs
r12012 r13368 1 #region License Information1 #region License Information 2 2 /* HeuristicLab 3 3 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL) … … 26 26 namespace HeuristicLab.Encodings.PermutationEncoding { 27 27 [Item("TranslocationMove", "A move that changes three edges by performing a translocation.")] 28 [StorableClass ]28 [StorableClass("E34918C6-C489-455F-A250-6C65E1B47627")] 29 29 public class TranslocationMove : ThreeIndexMove { 30 30 [StorableConstructor] -
branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Moves/ThreeOpt/TranslocationMoveAbsoluteAttribute.cs
r12012 r13368 1 #region License Information1 #region License Information 2 2 /* HeuristicLab 3 3 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL) … … 26 26 namespace HeuristicLab.Encodings.PermutationEncoding { 27 27 [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")] 29 29 public class TranslocationMoveAbsoluteAttribute : PermutationMoveAttribute { 30 30 [Storable] -
branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Moves/ThreeOpt/TranslocationMoveGenerator.cs
r12012 r13368 1 #region License Information1 #region License Information 2 2 /* HeuristicLab 3 3 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL) … … 29 29 namespace HeuristicLab.Encodings.PermutationEncoding { 30 30 [Item("TranslocationMoveGenerator", "Base class for move generators that produce translocation moves (3-opt).")] 31 [StorableClass ]31 [StorableClass("ACC633A0-17E2-4887-9681-293AFB19E65B")] 32 32 public abstract class TranslocationMoveGenerator : SingleSuccessorOperator, IPermutationTranslocationMoveOperator, IMoveGenerator { 33 33 public override bool CanChangeName { -
branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Moves/ThreeOpt/TranslocationMoveHardTabuCriterion.cs
r12012 r13368 1 #region License Information1 #region License Information 2 2 /* HeuristicLab 3 3 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL) … … 33 33 34 34 If 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")] 36 36 public class TranslocationMoveHardTabuCriterion : SingleSuccessorOperator, IPermutationTranslocationMoveOperator, ITabuChecker { 37 37 public override bool CanChangeName { -
branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Moves/ThreeOpt/TranslocationMoveMaker.cs
r12012 r13368 1 #region License Information1 #region License Information 2 2 /* HeuristicLab 3 3 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL) … … 30 30 namespace HeuristicLab.Encodings.PermutationEncoding { 31 31 [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")] 33 33 public class TranslocationMoveMaker : SingleSuccessorOperator, IPermutationTranslocationMoveOperator, IMoveMaker, ISingleObjectiveOperator { 34 34 public override bool CanChangeName { -
branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Moves/ThreeOpt/TranslocationMoveRelativeAttribute.cs
r12012 r13368 1 #region License Information1 #region License Information 2 2 /* HeuristicLab 3 3 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL) … … 26 26 namespace HeuristicLab.Encodings.PermutationEncoding { 27 27 [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")] 29 29 public class TranslocationMoveRelativeAttribute : PermutationMoveAttribute { 30 30 [Storable] -
branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Moves/ThreeOpt/TranslocationMoveSoftTabuCriterion.cs
r12012 r13368 1 #region License Information1 #region License Information 2 2 /* HeuristicLab 3 3 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL) … … 33 33 34 34 If 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")] 36 36 public class TranslocationMoveSoftTabuCriterion : SingleSuccessorOperator, IPermutationTranslocationMoveOperator, ITabuChecker { 37 37 public override bool CanChangeName { -
branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Moves/ThreeOpt/TranslocationMoveTabuMaker.cs
r12012 r13368 1 #region License Information1 #region License Information 2 2 /* HeuristicLab 3 3 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL) … … 28 28 namespace HeuristicLab.Encodings.PermutationEncoding { 29 29 [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")] 31 31 public class TranslocationMoveTabuMaker : TabuMaker, IPermutationTranslocationMoveOperator { 32 32 public ILookupParameter<Permutation> PermutationParameter { -
branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Moves/TwoIndexMove.cs
r12012 r13368 1 #region License Information1 #region License Information 2 2 /* HeuristicLab 3 3 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL) … … 26 26 namespace HeuristicLab.Encodings.PermutationEncoding { 27 27 [Item("TwoIndexMove", "A move on a permutation that is specified by 2 indices.")] 28 [StorableClass ]28 [StorableClass("54380E43-E827-4A8E-9C6D-9CE92AB9F15B")] 29 29 public class TwoIndexMove : Item { 30 30 [Storable] -
branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Moves/TwoOpt/ExhaustiveInversionMoveGenerator.cs
r12012 r13368 1 #region License Information1 #region License Information 2 2 /* HeuristicLab 3 3 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL) … … 30 30 namespace HeuristicLab.Encodings.PermutationEncoding { 31 31 [Item("ExhaustiveInversionMoveGenerator", "Generates all possible inversion moves (2-opt) from a given permutation.")] 32 [StorableClass ]32 [StorableClass("478207CB-6282-4FB6-8A76-F2D0FBCB0CE9")] 33 33 public class ExhaustiveInversionMoveGenerator : InversionMoveGenerator, IExhaustiveMoveGenerator { 34 34 [StorableConstructor] -
branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Moves/TwoOpt/InversionMove.cs
r12012 r13368 1 #region License Information1 #region License Information 2 2 /* HeuristicLab 3 3 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL) … … 26 26 namespace HeuristicLab.Encodings.PermutationEncoding { 27 27 [Item("InversionMove", "Item that describes an inversion move (2-opt).")] 28 [StorableClass ]28 [StorableClass("E414DB9B-5CA1-410E-84C8-C44FA792F2A7")] 29 29 public class InversionMove : TwoIndexMove { 30 30 [StorableConstructor] -
branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Moves/TwoOpt/InversionMoveAbsoluteAttribute.cs
r12012 r13368 1 #region License Information1 #region License Information 2 2 /* HeuristicLab 3 3 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL) … … 26 26 namespace HeuristicLab.Encodings.PermutationEncoding { 27 27 [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")] 29 29 public class InversionMoveAbsoluteAttribute : PermutationMoveAttribute { 30 30 [Storable] -
branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Moves/TwoOpt/InversionMoveGenerator.cs
r12012 r13368 1 #region License Information1 #region License Information 2 2 /* HeuristicLab 3 3 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL) … … 29 29 namespace HeuristicLab.Encodings.PermutationEncoding { 30 30 [Item("InversionMoveGenerator", "Base class for all inversion (2-opt) move generators.")] 31 [StorableClass ]31 [StorableClass("17C1A6A7-9F09-40F6-8CF2-F14202C40D2C")] 32 32 public abstract class InversionMoveGenerator : SingleSuccessorOperator, IPermutationInversionMoveOperator, IMoveGenerator { 33 33 public override bool CanChangeName { -
branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Moves/TwoOpt/InversionMoveHardTabuCriterion.cs
r12012 r13368 1 #region License Information1 #region License Information 2 2 /* HeuristicLab 3 3 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL) … … 34 34 35 35 If 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")] 37 37 public class InversionMoveHardTabuCriterion : SingleSuccessorOperator, IPermutationInversionMoveOperator, ITabuChecker { 38 38 public override bool CanChangeName { -
branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Moves/TwoOpt/InversionMoveMaker.cs
r12012 r13368 1 #region License Information1 #region License Information 2 2 /* HeuristicLab 3 3 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL) … … 30 30 namespace HeuristicLab.Encodings.PermutationEncoding { 31 31 [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")] 33 33 public class InversionMoveMaker : SingleSuccessorOperator, IPermutationInversionMoveOperator, IMoveMaker, ISingleObjectiveOperator { 34 34 public override bool CanChangeName { -
branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Moves/TwoOpt/InversionMoveRelativeAttribute.cs
r12012 r13368 1 #region License Information1 #region License Information 2 2 /* HeuristicLab 3 3 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL) … … 26 26 namespace HeuristicLab.Encodings.PermutationEncoding { 27 27 [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")] 29 29 public class InversionMoveRelativeAttribute : PermutationMoveAttribute { 30 30 [Storable] -
branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Moves/TwoOpt/InversionMoveSoftTabuCriterion.cs
r12012 r13368 1 #region License Information1 #region License Information 2 2 /* HeuristicLab 3 3 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL) … … 34 34 35 35 If 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")] 37 37 public class InversionMoveSoftTabuCriterion : SingleSuccessorOperator, IPermutationInversionMoveOperator, ITabuChecker { 38 38 public override bool CanChangeName { -
branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Moves/TwoOpt/InversionMoveTabuMaker.cs
r12012 r13368 1 #region License Information1 #region License Information 2 2 /* HeuristicLab 3 3 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL) … … 28 28 namespace HeuristicLab.Encodings.PermutationEncoding { 29 29 [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")] 31 31 public class InversionMoveTabuMaker : TabuMaker, IPermutationInversionMoveOperator { 32 32 public ILookupParameter<Permutation> PermutationParameter { -
branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Moves/TwoOpt/StochasticInversionMultiMoveGenerator.cs
r12012 r13368 1 #region License Information1 #region License Information 2 2 /* HeuristicLab 3 3 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL) … … 29 29 namespace HeuristicLab.Encodings.PermutationEncoding { 30 30 [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")] 32 32 public class StochasticInversionMultiMoveGenerator : InversionMoveGenerator, IMultiMoveGenerator, IStochasticOperator { 33 33 public ILookupParameter<IRandom> RandomParameter { -
branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Moves/TwoOpt/StochasticInversionSingleMoveGenerator.cs
r12012 r13368 1 #region License Information1 #region License Information 2 2 /* HeuristicLab 3 3 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL) … … 29 29 namespace HeuristicLab.Encodings.PermutationEncoding { 30 30 [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")] 32 32 public class StochasticInversionSingleMoveGenerator : InversionMoveGenerator, IStochasticOperator, ISingleMoveGenerator { 33 33 public ILookupParameter<IRandom> RandomParameter { -
branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/Permutation.cs
r12012 r13368 28 28 namespace HeuristicLab.Encodings.PermutationEncoding { 29 29 [Item("Permutation", "Represents a permutation of integer values.")] 30 [StorableClass ]30 [StorableClass("42B08CF9-1133-452B-B23B-7A620340DCB9")] 31 31 public class Permutation : IntArray { 32 32 [Storable] -
branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/PermutationCrossover.cs
r12012 r13368 32 32 /// </summary> 33 33 [Item("PermutationCrossover", "A base class for permutation crossover operators.")] 34 [StorableClass ]34 [StorableClass("2445B070-3A3E-493B-8DC0-E87DFB35CB57")] 35 35 public abstract class PermutationCrossover : InstrumentedOperator, IPermutationCrossover, IStochasticOperator { 36 36 public override bool CanChangeName { -
branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/PermutationEncoding.cs
r12015 r13368 1 #region License Information1 #region License Information 2 2 /* HeuristicLab 3 3 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL) … … 33 33 namespace HeuristicLab.Encodings.PermutationEncoding { 34 34 [Item("PermutationEncoding", "Describes a permutation encoding.")] 35 [StorableClass ]35 [StorableClass("82EDACEE-89C6-429E-AEBA-FCF3B107F648")] 36 36 public sealed class PermutationEncoding : Encoding<IPermutationCreator> { 37 37 #region encoding parameters -
branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/PermutationManipulator.cs
r12012 r13368 32 32 /// </summary> 33 33 [Item("PermutationManipulator", "A base class for permutation manipulation operators.")] 34 [StorableClass ]34 [StorableClass("E41E1D7D-F34A-4836-8926-8F7C1D4BB2F7")] 35 35 public abstract class PermutationManipulator : InstrumentedOperator, IPermutationManipulator, IStochasticOperator { 36 36 public override bool CanChangeName { -
branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/PermutationType.cs
r12012 r13368 1 #region License Information1 #region License Information 2 2 /* HeuristicLab 3 3 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL) … … 28 28 namespace HeuristicLab.Encodings.PermutationEncoding { 29 29 [Item("PermutationType", "Represents a certain type of permutation.")] 30 [StorableClass ]30 [StorableClass("79CC3CEE-A75E-4859-B231-269EC5C5809C")] 31 31 public class PermutationType : ValueTypeValue<PermutationTypes> { 32 32 public static new Image StaticItemImage { -
branches/PersistenceOverhaul/HeuristicLab.Encodings.PermutationEncoding/3.3/ShakingOperators/PermutationShakingOperator.cs
r12012 r13368 1 #region License Information1 #region License Information 2 2 /* HeuristicLab 3 3 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL) … … 36 36 /// </summary> 37 37 [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")] 39 39 public class PermutationShakingOperator : ShakingOperator<IPermutationManipulator>, IPermutationMultiNeighborhoodShakingOperator, IStochasticOperator { 40 40
Note: See TracChangeset
for help on using the changeset viewer.