- Timestamp:
- 12/28/18 16:10:48 (6 years ago)
- Location:
- branches/2520_PersistenceReintegration/HeuristicLab.Problems.LinearAssignment/3.3
- Files:
-
- 7 edited
Legend:
- Unmodified
- Added
- Removed
-
branches/2520_PersistenceReintegration/HeuristicLab.Problems.LinearAssignment/3.3/Analyzers/BestLAPSolutionAnalyzer.cs
r16453 r16462 28 28 using HeuristicLab.Optimization; 29 29 using HeuristicLab.Parameters; 30 using H euristicLab.Persistence.Default.CompositeSerializers.Storable;30 using HEAL.Fossil; 31 31 32 32 namespace HeuristicLab.Problems.LinearAssignment { 33 33 [Item("BestLAPSolutionAnalyzer", "Analyzes the best solution found.")] 34 [Storable Class]34 [StorableType("7C4B1DB3-E351-4C6C-899B-801303DFCE61")] 35 35 public class BestLAPSolutionAnalyzer : SingleSuccessorOperator, IAnalyzer, ISingleObjectiveOperator { 36 36 public bool EnabledByDefault { get { return true; } } … … 71 71 72 72 [StorableConstructor] 73 protected BestLAPSolutionAnalyzer( bool deserializing) : base(deserializing) { }73 protected BestLAPSolutionAnalyzer(StorableConstructorFlag _) : base(_) { } 74 74 protected BestLAPSolutionAnalyzer(BestLAPSolutionAnalyzer original, Cloner cloner) : base(original, cloner) { } 75 75 public BestLAPSolutionAnalyzer() -
branches/2520_PersistenceReintegration/HeuristicLab.Problems.LinearAssignment/3.3/HeuristicLab.Problems.LinearAssignment-3.3.csproj
r16454 r16462 112 112 <HintPath>..\..\packages\Google.Protobuf.3.6.1\lib\net45\Google.Protobuf.dll</HintPath> 113 113 </Reference> 114 <Reference Include="HEAL.Fossil, Version=1.0.0.0, Culture=neutral, processorArchitecture=MSIL">114 <Reference Include="HEAL.Fossil, Version=1.0.0.0, Culture=neutral, PublicKeyToken=ba48961d6f65dcec, processorArchitecture=MSIL"> 115 115 <HintPath>..\..\packages\HEAL.Fossil.1.0.0\lib\netstandard2.0\HEAL.Fossil.dll</HintPath> 116 116 </Reference> -
branches/2520_PersistenceReintegration/HeuristicLab.Problems.LinearAssignment/3.3/HungarianAlgorithm.cs
r16453 r16462 28 28 using HeuristicLab.Optimization; 29 29 using HeuristicLab.Parameters; 30 using H euristicLab.Persistence.Default.CompositeSerializers.Storable;30 using HEAL.Fossil; 31 31 32 32 namespace HeuristicLab.Problems.LinearAssignment { … … 36 36 [Item("Hungarian Algorithm", "The Hungarian algorithm can be used to solve the linear assignment problem in O(n^3). It is also known as the Kuhn–Munkres algorithm or Munkres assignment algorithm.")] 37 37 [Creatable(CreatableAttribute.Categories.SingleSolutionAlgorithms, Priority = 170)] 38 [Storable Class]38 [StorableType("2A2C1C1B-E0C3-4757-873B-C3F7C6D11A01")] 39 39 public sealed class HungarianAlgorithm : EngineAlgorithm, IStorableContent { 40 40 public string Filename { get; set; } … … 67 67 68 68 [StorableConstructor] 69 private HungarianAlgorithm( bool deserializing) : base(deserializing) { }69 private HungarianAlgorithm(StorableConstructorFlag _) : base(_) { } 70 70 private HungarianAlgorithm(HungarianAlgorithm original, Cloner cloner) 71 71 : base(original, cloner) { -
branches/2520_PersistenceReintegration/HeuristicLab.Problems.LinearAssignment/3.3/LAPAssignment.cs
r16453 r16462 25 25 using HeuristicLab.Data; 26 26 using HeuristicLab.Encodings.PermutationEncoding; 27 using H euristicLab.Persistence.Default.CompositeSerializers.Storable;27 using HEAL.Fossil; 28 28 29 29 namespace HeuristicLab.Problems.LinearAssignment { 30 30 [Item("LAP Assignment", "Represents a solution to the LAP.")] 31 [Storable Class]31 [StorableType("8F255E15-291B-44D5-BF8B-AC79264274C0")] 32 32 public sealed class LAPAssignment : Item, INotifyPropertyChanged, IStorableContent { 33 33 public string Filename { get; set; } … … 89 89 90 90 [StorableConstructor] 91 private LAPAssignment( bool deserializing) : base(deserializing) { }91 private LAPAssignment(StorableConstructorFlag _) : base(_) { } 92 92 private LAPAssignment(LAPAssignment original, Cloner cloner) 93 93 : base(original, cloner) { -
branches/2520_PersistenceReintegration/HeuristicLab.Problems.LinearAssignment/3.3/LAPEvaluator.cs
r16453 r16462 22 22 23 23 using HeuristicLab.Operators; 24 using H euristicLab.Persistence.Default.CompositeSerializers.Storable;24 using HEAL.Fossil; 25 25 using HeuristicLab.Core; 26 26 using HeuristicLab.Common; … … 31 31 namespace HeuristicLab.Problems.LinearAssignment { 32 32 [Item("LAPEvaluator", "Evaluates a solution to the linear assignment problem.")] 33 [Storable Class]33 [StorableType("DB86EA88-EE30-4E57-8447-D24B7B6ACB8A")] 34 34 public class LAPEvaluator : InstrumentedOperator, ILAPEvaluator { 35 35 … … 45 45 46 46 [StorableConstructor] 47 protected LAPEvaluator( bool deserializing) : base(deserializing) { }47 protected LAPEvaluator(StorableConstructorFlag _) : base(_) { } 48 48 protected LAPEvaluator(LAPEvaluator original, Cloner cloner) : base(original, cloner) { } 49 49 public LAPEvaluator() -
branches/2520_PersistenceReintegration/HeuristicLab.Problems.LinearAssignment/3.3/LinearAssignmentProblem.cs
r16453 r16462 31 31 using HeuristicLab.Optimization.Operators; 32 32 using HeuristicLab.Parameters; 33 using H euristicLab.Persistence.Default.CompositeSerializers.Storable;33 using HEAL.Fossil; 34 34 using HeuristicLab.PluginInfrastructure; 35 35 … … 37 37 [Item("Linear Assignment Problem (LAP)", "In the linear assignment problem (LAP) an assignment of workers to jobs has to be found such that each worker is assigned to exactly one job, each job is assigned to exactly one worker and the sum of the resulting costs is minimal (or maximal).")] 38 38 [Creatable(CreatableAttribute.Categories.CombinatorialProblems, Priority = 130)] 39 [Storable Class]39 [StorableType("7766E004-A93D-4CA6-8012-AE5E8F4C4D85")] 40 40 public sealed class LinearAssignmentProblem : SingleObjectiveHeuristicOptimizationProblem<ILAPEvaluator, IPermutationCreator>, IStorableContent { 41 41 public static readonly string CostsDescription = "The cost matrix that describes the assignment of rows to columns."; … … 94 94 95 95 [StorableConstructor] 96 private LinearAssignmentProblem( bool deserializing) : base(deserializing) { }96 private LinearAssignmentProblem(StorableConstructorFlag _) : base(_) { } 97 97 private LinearAssignmentProblem(LinearAssignmentProblem original, Cloner cloner) 98 98 : base(original, cloner) { -
branches/2520_PersistenceReintegration/HeuristicLab.Problems.LinearAssignment/3.3/LinearAssignmentProblemSolver.cs
r16453 r16462 27 27 using HeuristicLab.Optimization; 28 28 using HeuristicLab.Parameters; 29 using H euristicLab.Persistence.Default.CompositeSerializers.Storable;29 using HEAL.Fossil; 30 30 31 31 namespace HeuristicLab.Problems.LinearAssignment { 32 32 [Item("LinearAssignmentProblemSolver", "Uses the hungarian algorithm to solve linear assignment problems.")] 33 [Storable Class]33 [StorableType("ABF202CC-44E4-4208-9EBF-1A104806358F")] 34 34 public sealed class LinearAssignmentProblemSolver : SingleSuccessorOperator, ISingleObjectiveOperator { 35 35 private const int UNASSIGNED = -1; … … 49 49 50 50 [StorableConstructor] 51 private LinearAssignmentProblemSolver( bool deserializing) : base(deserializing) { }51 private LinearAssignmentProblemSolver(StorableConstructorFlag _) : base(_) { } 52 52 private LinearAssignmentProblemSolver(LinearAssignmentProblemSolver original, Cloner cloner) : base(original, cloner) { } 53 53 public LinearAssignmentProblemSolver()
Note: See TracChangeset
for help on using the changeset viewer.