- Timestamp:
- 11/24/15 17:08:13 (9 years ago)
- Location:
- branches/PersistenceOverhaul/HeuristicLab.Problems.Knapsack/3.3
- Files:
-
- 9 edited
Legend:
- Unmodified
- Added
- Removed
-
branches/PersistenceOverhaul/HeuristicLab.Problems.Knapsack/3.3/Analyzers/BestKnapsackSolutionAnalyzer.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("BestKnapsackSolutionAnalyzer", "An operator for analyzing the best solution for a Knapsack problem.")] 37 [StorableClass ]37 [StorableClass("C51C26E7-08B2-47AC-839F-FE57AB853B2E")] 38 38 public class BestKnapsackSolutionAnalyzer : SingleSuccessorOperator, IAnalyzer, ISingleObjectiveOperator { 39 39 public virtual bool EnabledByDefault { -
branches/PersistenceOverhaul/HeuristicLab.Problems.Knapsack/3.3/Evaluators/KnapsackEvaluator.cs
r12012 r13368 34 34 /// </summary> 35 35 [Item("KnapsackEvaluator", "Evaluates solutions for the Knapsack problem.")] 36 [StorableClass ]36 [StorableClass("597BEB68-140C-4A73-A2D8-6E9173C1F386")] 37 37 public class KnapsackEvaluator : InstrumentedOperator, IKnapsackEvaluator { 38 38 public ILookupParameter<DoubleValue> QualityParameter { -
branches/PersistenceOverhaul/HeuristicLab.Problems.Knapsack/3.3/Improvers/KnapsackImprovementOperator.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 /// <remarks> 38 /// It is implemented as described in Laguna, M. and Mart í, R. (2003). Scatter Search: Methodology and Implementations in C. Operations Research/Computer Science Interfaces Series, Vol. 24. Springer.<br />38 /// It is implemented as described in Laguna, M. and MartÃ, R. (2003). Scatter Search: Methodology and Implementations in C. Operations Research/Computer Science Interfaces Series, Vol. 24. Springer.<br /> 39 39 /// The operator first orders the elements of the knapsack according to their value-to-weight ratio, then, if the solution is not feasible, removes the element with the lowest ratio until the solution is feasible and tries to add new elements with the best ratio that are not already included yet until the knapsack is full. 40 40 /// </remarks> 41 [Item("KnapsackImprovementOperator", "An operator that improves knapsack solutions. It is implemented as described in Laguna, M. and Mart í, R. (2003). Scatter Search: Methodology and Implementations in C. Operations Research/Computer Science Interfaces Series, Vol. 24. Springer.")]42 [StorableClass ]41 [Item("KnapsackImprovementOperator", "An operator that improves knapsack solutions. It is implemented as described in Laguna, M. and MartÃ, R. (2003). Scatter Search: Methodology and Implementations in C. Operations Research/Computer Science Interfaces Series, Vol. 24. Springer.")] 42 [StorableClass("AA2BAD0D-6083-4CD2-9B0E-5502DCBD8B86")] 43 43 public sealed class KnapsackImprovementOperator : SingleSuccessorOperator, ISingleObjectiveImprovementOperator { 44 44 #region Parameter properties -
branches/PersistenceOverhaul/HeuristicLab.Problems.Knapsack/3.3/KnapsackProblem.cs
r13173 r13368 37 37 [Item("Knapsack Problem (KSP)", "Represents a Knapsack problem.")] 38 38 [Creatable(CreatableAttribute.Categories.CombinatorialProblems, Priority = 200)] 39 [StorableClass ]39 [StorableClass("79642344-A5D5-4982-9A98-169C18FED755")] 40 40 public sealed class KnapsackProblem : SingleObjectiveHeuristicOptimizationProblem<IKnapsackEvaluator, IBinaryVectorCreator>, IStorableContent { 41 41 public string Filename { get; set; } -
branches/PersistenceOverhaul/HeuristicLab.Problems.Knapsack/3.3/KnapsackSolution.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("KnapsackSolution", "Represents a Knapsack solution which can be visualized in the GUI.")] 35 [StorableClass ]35 [StorableClass("85BF9C19-A5F7-4B75-A480-56FD8E0073C5")] 36 36 public class KnapsackSolution : Item { 37 37 public static new Image StaticItemImage { -
branches/PersistenceOverhaul/HeuristicLab.Problems.Knapsack/3.3/MoveEvaluators/KnapsackMoveEvaluator.cs
r12012 r13368 34 34 /// </summary> 35 35 [Item("KnapsackMoveEvaluator", "A base class for operators which evaluate Knapsack moves.")] 36 [StorableClass ]36 [StorableClass("CCB7703D-62B4-427B-ACF1-1B78EEC6DE27")] 37 37 public abstract class KnapsackMoveEvaluator : SingleSuccessorOperator, IKnapsackMoveEvaluator, IBinaryVectorMoveOperator { 38 38 public ILookupParameter<DoubleValue> QualityParameter { -
branches/PersistenceOverhaul/HeuristicLab.Problems.Knapsack/3.3/MoveEvaluators/KnapsackOneBitflipMoveEvaluator.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("KnapsackOneBitflipMoveEvaluator", "Base class for evaluating one bitflip moves.")] 34 [StorableClass ]34 [StorableClass("14DF5681-3AC8-4DD8-B983-1F849973A7B4")] 35 35 public class KnapsackOneBitflipMoveEvaluator : KnapsackMoveEvaluator, IOneBitflipMoveOperator { 36 36 public ILookupParameter<OneBitflipMove> OneBitflipMoveParameter { -
branches/PersistenceOverhaul/HeuristicLab.Problems.Knapsack/3.3/PathRelinkers/KnapsackPathRelinker.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) … … 38 38 /// </remarks> 39 39 [Item("KnapsackPathRelinker", "An operator that relinks paths between knapsack solutions. The operator incrementally assimilates the initiating solution into the guiding solution by adding and removing elements as needed.")] 40 [StorableClass ]40 [StorableClass("C4EEE093-3548-4F22-B5E1-FAA5D42D1F65")] 41 41 public sealed class KnapsackPathRelinker : SingleObjectivePathRelinker { 42 42 [StorableConstructor] -
branches/PersistenceOverhaul/HeuristicLab.Problems.Knapsack/3.3/PathRelinkers/KnapsackSimultaneousPathRelinker.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) … … 38 38 /// </remarks> 39 39 [Item("KnapsackSimultaneousPathRelinker", "An operator that relinks paths between knapsack solutions starting from both ends. The operator incrementally assimilates the initiating solution into the guiding solution and vice versa by adding and removing elements as needed.")] 40 [StorableClass ]40 [StorableClass("D6769E5C-9A3A-43E4-B3D8-E8219324B76F")] 41 41 public sealed class KnapsackSimultaneousPathRelinker : SingleObjectivePathRelinker { 42 42 [StorableConstructor]
Note: See TracChangeset
for help on using the changeset viewer.