- Timestamp:
- 11/24/15 17:08:13 (9 years ago)
- Location:
- branches/PersistenceOverhaul/HeuristicLab.Encodings.IntegerVectorEncoding/3.3
- Files:
-
- 26 edited
Legend:
- Unmodified
- Added
- Removed
-
branches/PersistenceOverhaul/HeuristicLab.Encodings.IntegerVectorEncoding/3.3/BoundedIntegerVectorCrossover.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.IntegerVectorEncoding { 30 30 [Item("BoundedIntegerVectorCrossover", "Base class for bounded crossovers.")] 31 [StorableClass ]31 [StorableClass("49947F88-A4D5-4E31-B9BC-E0ED40CC27AB")] 32 32 public abstract class BoundedIntegerVectorCrossover : IntegerVectorCrossover, IBoundedIntegerVectorOperator { 33 33 -
branches/PersistenceOverhaul/HeuristicLab.Encodings.IntegerVectorEncoding/3.3/BoundedIntegerVectorManipulator.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.IntegerVectorEncoding { 30 30 [Item("BoundedIntegerVectorManipulator", "Base class for bounded integer vector manipulators.")] 31 [StorableClass ]31 [StorableClass("9D6833F8-FACF-4A16-AA6D-6FF4CEA3389B")] 32 32 public abstract class BoundedIntegerVectorManipulator : IntegerVectorManipulator, IBoundedIntegerVectorOperator { 33 33 -
branches/PersistenceOverhaul/HeuristicLab.Encodings.IntegerVectorEncoding/3.3/Creators/UniformRandomIntegerVectorCreator.cs
r12012 r13368 30 30 /// </summary> 31 31 [Item("UniformRandomIntegerVectorCreator", "An operator which creates a new random int vector with each element uniformly distributed in a specified range.")] 32 [StorableClass ]32 [StorableClass("194DF198-4D24-4B74-9E43-9A630137A181")] 33 33 public class UniformRandomIntegerVectorCreator : IntegerVectorCreator { 34 34 [StorableConstructor] -
branches/PersistenceOverhaul/HeuristicLab.Encodings.IntegerVectorEncoding/3.3/Crossovers/DiscreteCrossover.cs
r12012 r13368 33 33 /// </remarks> 34 34 [Item("DiscreteCrossover", "Discrete crossover for integer vectors. It is implemented as described in Gwiazda, T.D. 2006. Genetic algorithms reference Volume I Crossover for single-objective numerical optimization problems, p.17.")] 35 [StorableClass ]35 [StorableClass("23781F8B-1DE6-48D8-9207-EAA1767C261A")] 36 36 public class DiscreteCrossover : IntegerVectorCrossover { 37 37 [StorableConstructor] -
branches/PersistenceOverhaul/HeuristicLab.Encodings.IntegerVectorEncoding/3.3/Crossovers/MultiIntegerVectorCrossover.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 namespace HeuristicLab.Encodings.IntegerVectorEncoding { 35 35 [Item("MultiIntegerVectorCrossover", "Randomly selects and applies one of its crossovers every time it is called.")] 36 [StorableClass ]36 [StorableClass("0EACA5FD-8F63-4830-B035-517F6A117197")] 37 37 public class MultiIntegerVectorCrossover : StochasticMultiBranch<IIntegerVectorCrossover>, IIntegerVectorCrossover, IStochasticOperator, IBoundedIntegerVectorOperator { 38 38 public override bool CanChangeName { -
branches/PersistenceOverhaul/HeuristicLab.Encodings.IntegerVectorEncoding/3.3/Crossovers/RoundedAverageCrossover.cs
r12012 r13368 31 31 /// </summary> 32 32 [Item("RoundedAverageCrossover", "Average crossover for integer vectors.")] 33 [StorableClass ]33 [StorableClass("22319477-6A9C-46CA-B520-6F0F43476BC2")] 34 34 public class RoundedAverageCrossover : BoundedIntegerVectorCrossover, IBoundedIntegerVectorOperator { 35 35 -
branches/PersistenceOverhaul/HeuristicLab.Encodings.IntegerVectorEncoding/3.3/Crossovers/RoundedBlendAlphaBetaCrossover.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) … … 37 37 /// </summary> 38 38 [Item("RoundedBlendAlphaBetaCrossover", "The rounded blend alpha beta crossover (BLX-a-b) for integer 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 and rounded to the next feasible integer.")] 39 [StorableClass ]39 [StorableClass("A2FB1771-A5D9-4F76-AD09-40F982BFC613")] 40 40 public class RoundedBlendAlphaBetaCrossover : BoundedIntegerVectorCrossover, ISingleObjectiveOperator { 41 41 /// <summary> -
branches/PersistenceOverhaul/HeuristicLab.Encodings.IntegerVectorEncoding/3.3/Crossovers/RoundedBlendAlphaCrossover.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 /// </summary> 35 35 [Item("RoundedBlendAlphaCrossover", "The rounded blend alpha crossover (BLX-a) for integer vectors creates new offspring by sampling a new value in the range [min_i - d * alpha, max_i + d * alpha) at each position i and rounding the result to the next feasible integer. 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.")] 36 [StorableClass ]36 [StorableClass("DD591661-53F5-4B3E-AA1C-38F65F9007EB")] 37 37 public class RoundedBlendAlphaCrossover : BoundedIntegerVectorCrossover { 38 38 /// <summary> -
branches/PersistenceOverhaul/HeuristicLab.Encodings.IntegerVectorEncoding/3.3/Crossovers/RoundedHeuristicCrossover.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 /// </summary> 36 36 [Item("RoundedHeuristicCrossover", "The heuristic crossover produces offspring that extend the better parent in direction from the worse to the better parent.")] 37 [StorableClass ]37 [StorableClass("D34DD2C1-FE8D-47B9-8E1E-D9962B9152DB")] 38 38 public class RoundedHeuristicCrossover : BoundedIntegerVectorCrossover, ISingleObjectiveOperator { 39 39 /// <summary> -
branches/PersistenceOverhaul/HeuristicLab.Encodings.IntegerVectorEncoding/3.3/Crossovers/RoundedLocalCrossover.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) … … 32 32 /// </remarks> 33 33 [Item("RoundedLocalCrossover", @"The runded local crossover is similar to the arithmetic crossover, but uses a random alpha for each position x = alpha * p1 + (1-alpha) * p2.")] 34 [StorableClass ]34 [StorableClass("09A11920-6228-4E34-B947-10FD8DCEC59D")] 35 35 public class RoundedLocalCrossover : BoundedIntegerVectorCrossover { 36 36 [StorableConstructor] -
branches/PersistenceOverhaul/HeuristicLab.Encodings.IntegerVectorEncoding/3.3/Crossovers/RoundedUniformArithmeticCrossover.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) … … 32 32 /// </summary> 33 33 [Item("RoundedUniformSomePositionsArithmeticCrossover", "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).")] 34 [StorableClass ]34 [StorableClass("AE89B625-028E-463B-95B2-CD34E3043184")] 35 35 public class RoundedUniformArithmeticCrossover : BoundedIntegerVectorCrossover, IBoundedIntegerVectorOperator { 36 36 -
branches/PersistenceOverhaul/HeuristicLab.Encodings.IntegerVectorEncoding/3.3/Crossovers/SinglePointCrossover.cs
r12012 r13368 33 33 /// </remarks> 34 34 [Item("SinglePointCrossover", "Single point crossover for integer vectors. It is implemented as described in Michalewicz, Z. 1999. Genetic Algorithms + Data Structures = Evolution Programs. Third, Revised and Extended Edition, Spring-Verlag Berlin Heidelberg.")] 35 [StorableClass ]35 [StorableClass("BDEE2362-85DD-4981-B984-A97863AA7E83")] 36 36 public class SinglePointCrossover : IntegerVectorCrossover { 37 37 [StorableConstructor] -
branches/PersistenceOverhaul/HeuristicLab.Encodings.IntegerVectorEncoding/3.3/IntegerVector.cs
r12012 r13368 27 27 28 28 namespace HeuristicLab.Encodings.IntegerVectorEncoding { 29 [StorableClass ]29 [StorableClass("16CD2B18-AD74-41DF-B503-CD00A48F95C9")] 30 30 [Item("IntegerVector", "Represents a vector of integer values.")] 31 31 public class IntegerVector : IntArray { -
branches/PersistenceOverhaul/HeuristicLab.Encodings.IntegerVectorEncoding/3.3/IntegerVectorCreator.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 /// </summary> 34 34 [Item("IntegerVectorCreator", "A base class for operators creating int-valued vectors.")] 35 [StorableClass ]35 [StorableClass("DC5D2847-F6F1-482D-8924-1DDA12342311")] 36 36 public abstract class IntegerVectorCreator : InstrumentedOperator, IIntegerVectorCreator, IStochasticOperator { 37 37 public override bool CanChangeName { -
branches/PersistenceOverhaul/HeuristicLab.Encodings.IntegerVectorEncoding/3.3/IntegerVectorCrossover.cs
r12012 r13368 31 31 /// </summary> 32 32 [Item("IntegerVectorCrossover", "A base class for operators that perform a crossover of int-valued vectors.")] 33 [StorableClass ]33 [StorableClass("3FAA28E7-1B07-4FA4-AAB5-9A5D74001DF4")] 34 34 public abstract class IntegerVectorCrossover : IntegerVectorOperator, IIntegerVectorCrossover, IStochasticOperator { 35 35 public override bool CanChangeName { -
branches/PersistenceOverhaul/HeuristicLab.Encodings.IntegerVectorEncoding/3.3/IntegerVectorEncoding.cs
r12837 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.IntegerVectorEncoding { 34 34 [Item("IntegerVectorEncoding", "Describes an integer vector encoding.")] 35 [StorableClass ]35 [StorableClass("500CFD10-CC30-414C-876C-9D1F5EA2D5F9")] 36 36 public sealed class IntegerVectorEncoding : Encoding<IIntegerVectorCreator> { 37 37 #region Encoding Parameters -
branches/PersistenceOverhaul/HeuristicLab.Encodings.IntegerVectorEncoding/3.3/IntegerVectorManipulator.cs
r12012 r13368 31 31 /// </summary> 32 32 [Item("IntegerVectorManipulator", "A base class for operators that manipulate int-valued vectors.")] 33 [StorableClass ]33 [StorableClass("8F633D30-AEFD-49E8-B14D-AD5C4FACD638")] 34 34 public abstract class IntegerVectorManipulator : IntegerVectorOperator, IIntegerVectorManipulator, IStochasticOperator { 35 35 public override bool CanChangeName { -
branches/PersistenceOverhaul/HeuristicLab.Encodings.IntegerVectorEncoding/3.3/IntegerVectorOperator.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.IntegerVectorEncoding { 29 29 [Item("IntegerVectorOperator", "Base class for integer vectoro operators.")] 30 [StorableClass ]30 [StorableClass("C8B7F32F-0EC8-40E6-88A1-004F3751A692")] 31 31 public abstract class IntegerVectorOperator : InstrumentedOperator, IIntegerVectorOperator { 32 32 -
branches/PersistenceOverhaul/HeuristicLab.Encodings.IntegerVectorEncoding/3.3/Manipulators/RoundedNormalAllPositionsManipulator.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 /// </summary> 35 35 [Item("RoundedNormalAllPositionsManipulator", "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. The result is rounded to the next feasible value. If there are less elements in Sigma than positions, then Sigma is cycled.")] 36 [StorableClass ]36 [StorableClass("FE8B3F5A-BA59-476E-9BE9-1DB184861FBB")] 37 37 public class RoundedNormalAllPositionsManipulator : BoundedIntegerVectorManipulator { 38 38 -
branches/PersistenceOverhaul/HeuristicLab.Encodings.IntegerVectorEncoding/3.3/Manipulators/SelfAdaptiveRoundedNormalAllPositionsManipulator.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 /// </summary> 36 36 [Item("SelfAdaptiveRoundedNormalAllPositionsManipulator", "This manipulation operator adds a value sigma_i * N(0,1) to the current value in each position i. The resulting value is rounded to the next feasible value. 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.")] 37 [StorableClass ]37 [StorableClass("D74E4288-55DA-42AE-9253-06E7AE90D62C")] 38 38 public class SelfAdaptiveRoundedNormalAllPositionsManipulator : BoundedIntegerVectorManipulator, ISelfAdaptiveManipulator { 39 39 public Type StrategyParameterType { -
branches/PersistenceOverhaul/HeuristicLab.Encodings.IntegerVectorEncoding/3.3/Manipulators/UniformOnePositionManipulator.cs
r12012 r13368 35 35 /// </remarks> 36 36 [Item("UniformOnePositionManipulator", " Uniformly distributed change of a single position of an integer vector. 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 ]37 [StorableClass("08E4FFB0-3DE7-4B6A-BAF4-FBC321A778E4")] 38 38 public class UniformOnePositionManipulator : BoundedIntegerVectorManipulator { 39 39 -
branches/PersistenceOverhaul/HeuristicLab.Encodings.IntegerVectorEncoding/3.3/Manipulators/UniformSomePositionsManipulator.cs
r12012 r13368 35 35 /// </remarks> 36 36 [Item("UniformSomePositionsManipulator", "Uniformly distributed change of several, but at least one, positions of an integer vector. 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 ]37 [StorableClass("1613E5C0-E52E-4E1C-BF89-5031D9F56CF5")] 38 38 public class UniformSomePositionsManipulator : BoundedIntegerVectorManipulator { 39 39 -
branches/PersistenceOverhaul/HeuristicLab.Encodings.IntegerVectorEncoding/3.3/ShakingOperators/IntegerVectorShakingOperator.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) … … 37 37 /// </summary> 38 38 [Item("IntegerVectorShakingOperator", "A shaking operator for VNS which uses available manipulation operators to perform the shaking.")] 39 [StorableClass ]39 [StorableClass("2167AD16-5B78-4682-82D4-3EFDC15782D4")] 40 40 public class IntegerVectorShakingOperator : ShakingOperator<IIntegerVectorManipulator>, IIntegerVectorMultiNeighborhoodShakingOperator, IStochasticOperator, IBoundedIntegerVectorOperator { 41 41 -
branches/PersistenceOverhaul/HeuristicLab.Encodings.IntegerVectorEncoding/3.3/StrategyParameters/StdDevStrategyVectorCreator.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.IntegerVectorEncoding { 31 31 [Item("StdDevStrategyVectorCreator", "Creates the endogeneous strategy parameters.")] 32 [StorableClass ]32 [StorableClass("3EDD0809-495B-4F33-91BB-0C1C16CF1AB0")] 33 33 public class StdDevStrategyVectorCreator : SingleSuccessorOperator, IStochasticOperator, IIntegerVectorStdDevStrategyParameterCreator { 34 34 public override bool CanChangeName { -
branches/PersistenceOverhaul/HeuristicLab.Encodings.IntegerVectorEncoding/3.3/StrategyParameters/StdDevStrategyVectorCrossover.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.IntegerVectorEncoding { 31 31 [Item("StdDevStrategyVectorCrossover", "Crosses the strategy vector by using intermediate recombination (average crossover).")] 32 [StorableClass ]32 [StorableClass("A740D439-16AE-4420-935A-8FF39EBA3009")] 33 33 public class StdDevStrategyVectorCrossover : SingleSuccessorOperator, IStochasticOperator, IIntegerVectorStdDevStrategyParameterCrossover { 34 34 public override bool CanChangeName { -
branches/PersistenceOverhaul/HeuristicLab.Encodings.IntegerVectorEncoding/3.3/StrategyParameters/StdDevStrategyVectorManipulator.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 /// </summary> 36 36 [Item("StdDevStrategyVectorManipulator", "Mutates the endogenous strategy parameters.")] 37 [StorableClass ]37 [StorableClass("D3CCCCE3-1A2C-4FF7-A28F-349F84A02A04")] 38 38 public class StdDevStrategyVectorManipulator : SingleSuccessorOperator, IStochasticOperator, IIntegerVectorStdDevStrategyParameterManipulator { 39 39 public override bool CanChangeName {
Note: See TracChangeset
for help on using the changeset viewer.