- Timestamp:
- 06/19/12 13:17:29 (12 years ago)
- Location:
- trunk/sources/HeuristicLab.Problems.VehicleRouting/3.4/Analyzer
- Files:
-
- 20 edited
Legend:
- Unmodified
- Added
- Removed
-
trunk/sources/HeuristicLab.Problems.VehicleRouting/3.4/Analyzer/BestAverageWorstTours/BestAverageWorstVRPToursAnalyzer.cs
r7175 r8053 1 1 #region License Information 2 2 /* HeuristicLab 3 * Copyright (C) 2002-201 0Heuristic and Evolutionary Algorithms Laboratory (HEAL)3 * Copyright (C) 2002-2012 Heuristic and Evolutionary Algorithms Laboratory (HEAL) 4 4 * 5 5 * This file is part of HeuristicLab. … … 21 21 22 22 using System; 23 using HeuristicLab.Analysis; 23 24 using HeuristicLab.Common; 24 25 using HeuristicLab.Core; … … 29 30 using HeuristicLab.Parameters; 30 31 using HeuristicLab.Persistence.Default.CompositeSerializers.Storable; 31 using HeuristicLab. Analysis;32 using HeuristicLab.Problems.VehicleRouting.Interfaces; 32 33 using HeuristicLab.Problems.VehicleRouting.Variants; 33 using HeuristicLab.Problems.VehicleRouting.Interfaces;34 34 35 35 namespace HeuristicLab.Problems.VehicleRouting { … … 187 187 private BestAverageWorstVRPToursAnalyzer(BestAverageWorstVRPToursAnalyzer original, Cloner cloner) 188 188 : base(original, cloner) { 189 189 this.Initialize(); 190 190 } 191 191 -
trunk/sources/HeuristicLab.Problems.VehicleRouting/3.4/Analyzer/BestAverageWorstTours/BestAverageWorstVRPToursCalculator.cs
r4752 r8053 1 1 #region License Information 2 2 /* HeuristicLab 3 * Copyright (C) 2002-201 0Heuristic and Evolutionary Algorithms Laboratory (HEAL)3 * Copyright (C) 2002-2012 Heuristic and Evolutionary Algorithms Laboratory (HEAL) 4 4 * 5 5 * This file is part of HeuristicLab. … … 20 20 #endregion 21 21 22 using HeuristicLab.Common; 22 23 using HeuristicLab.Core; 23 24 using HeuristicLab.Data; … … 25 26 using HeuristicLab.Parameters; 26 27 using HeuristicLab.Persistence.Default.CompositeSerializers.Storable; 27 using HeuristicLab.Common;28 28 29 29 namespace HeuristicLab.Problems.VehicleRouting { … … 103 103 } 104 104 105 105 106 106 private void UpdateVehiclesUtilized() { 107 107 ItemArray<DoubleValue> vehiclesUtilized = VehiclesUtilizedParameter.ActualValue; -
trunk/sources/HeuristicLab.Problems.VehicleRouting/3.4/Analyzer/BestAverageWorstTours/BestVRPToursMemorizer.cs
r4752 r8053 1 1 #region License Information 2 2 /* HeuristicLab 3 * Copyright (C) 2002-201 0Heuristic and Evolutionary Algorithms Laboratory (HEAL)3 * Copyright (C) 2002-2012 Heuristic and Evolutionary Algorithms Laboratory (HEAL) 4 4 * 5 5 * This file is part of HeuristicLab. … … 21 21 22 22 using System.Linq; 23 using HeuristicLab.Common; 23 24 using HeuristicLab.Core; 24 25 using HeuristicLab.Data; … … 26 27 using HeuristicLab.Parameters; 27 28 using HeuristicLab.Persistence.Default.CompositeSerializers.Storable; 28 using HeuristicLab.Common;29 29 30 30 namespace HeuristicLab.Problems.VehicleRouting { … … 53 53 Parameters.Add(new ValueLookupParameter<DoubleValue>("BestDistance", "The best distance found so far.")); 54 54 Parameters.Add(new ValueLookupParameter<DoubleValue>("BestVehiclesUtilized", "The best vehicles utilized found so far.")); 55 55 56 56 } 57 57 -
trunk/sources/HeuristicLab.Problems.VehicleRouting/3.4/Analyzer/BestAverageWorstTours/Capacitated/BestAverageWorstCapacitatedVRPToursAnalyzer.cs
r7175 r8053 1 1 #region License Information 2 2 /* HeuristicLab 3 * Copyright (C) 2002-201 0Heuristic and Evolutionary Algorithms Laboratory (HEAL)3 * Copyright (C) 2002-2012 Heuristic and Evolutionary Algorithms Laboratory (HEAL) 4 4 * 5 5 * This file is part of HeuristicLab. … … 21 21 22 22 using System; 23 using HeuristicLab.Analysis; 23 24 using HeuristicLab.Common; 24 25 using HeuristicLab.Core; … … 29 30 using HeuristicLab.Parameters; 30 31 using HeuristicLab.Persistence.Default.CompositeSerializers.Storable; 31 using HeuristicLab. Analysis;32 using HeuristicLab.Problems.VehicleRouting.Interfaces; 32 33 using HeuristicLab.Problems.VehicleRouting.Variants; 33 using HeuristicLab.Problems.VehicleRouting.Interfaces;34 34 35 35 namespace HeuristicLab.Problems.VehicleRouting { … … 82 82 public BestAverageWorstCapaciatatedVRPToursAnalyzer() 83 83 : base() { 84 #region Create parameters 84 #region Create parameters 85 85 Parameters.Add(new LookupParameter<IVRPProblemInstance>("ProblemInstance", "The problem instance.")); 86 86 … … 91 91 Parameters.Add(new ValueLookupParameter<DoubleValue>("CurrentWorstOverload", "The current worst overload value of all solutions.")); 92 92 Parameters.Add(new ValueLookupParameter<DataTable>("Overloads", "The data table to store the current best, current average, current worst, best and best known overload value.")); 93 93 94 94 Parameters.Add(new ValueLookupParameter<VariableCollection>("Results", "The results collection where the analysis values should be stored.")); 95 95 #endregion … … 145 145 private BestAverageWorstCapaciatatedVRPToursAnalyzer(BestAverageWorstCapaciatatedVRPToursAnalyzer original, Cloner cloner) 146 146 : base(original, cloner) { 147 147 this.Initialize(); 148 148 } 149 149 … … 151 151 BestAverageWorstCalculator.OverloadParameter.Depth = OverloadParameter.Depth; 152 152 BestMemorizer.OverloadParameter.Depth = OverloadParameter.Depth; 153 } 153 } 154 154 } 155 155 } -
trunk/sources/HeuristicLab.Problems.VehicleRouting/3.4/Analyzer/BestAverageWorstTours/Capacitated/BestAverageWorstCapacitatedVRPToursCalculator.cs
r4752 r8053 1 1 #region License Information 2 2 /* HeuristicLab 3 * Copyright (C) 2002-201 0Heuristic and Evolutionary Algorithms Laboratory (HEAL)3 * Copyright (C) 2002-2012 Heuristic and Evolutionary Algorithms Laboratory (HEAL) 4 4 * 5 5 * This file is part of HeuristicLab. … … 20 20 #endregion 21 21 22 using HeuristicLab.Common; 22 23 using HeuristicLab.Core; 23 24 using HeuristicLab.Data; … … 25 26 using HeuristicLab.Parameters; 26 27 using HeuristicLab.Persistence.Default.CompositeSerializers.Storable; 27 using HeuristicLab.Common;28 28 29 29 namespace HeuristicLab.Problems.VehicleRouting { … … 84 84 } 85 85 } 86 86 87 87 public override IOperation Apply() { 88 88 UpdateOverloads(); 89 89 90 90 return base.Apply(); 91 91 } -
trunk/sources/HeuristicLab.Problems.VehicleRouting/3.4/Analyzer/BestAverageWorstTours/Capacitated/BestCapacitatedVRPToursMemorizer.cs
r4752 r8053 1 1 #region License Information 2 2 /* HeuristicLab 3 * Copyright (C) 2002-201 0Heuristic and Evolutionary Algorithms Laboratory (HEAL)3 * Copyright (C) 2002-2012 Heuristic and Evolutionary Algorithms Laboratory (HEAL) 4 4 * 5 5 * This file is part of HeuristicLab. … … 21 21 22 22 using System.Linq; 23 using HeuristicLab.Common; 23 24 using HeuristicLab.Core; 24 25 using HeuristicLab.Data; … … 26 27 using HeuristicLab.Parameters; 27 28 using HeuristicLab.Persistence.Default.CompositeSerializers.Storable; 28 using HeuristicLab.Common;29 29 30 30 namespace HeuristicLab.Problems.VehicleRouting { … … 43 43 : base() { 44 44 Parameters.Add(new ScopeTreeLookupParameter<DoubleValue>("Overload", "The overloads of the VRP solutions which should be analyzed.")); 45 45 46 46 Parameters.Add(new ValueLookupParameter<DoubleValue>("BestOverload", "The best overload found so far.")); 47 47 } … … 62 62 if (BestOverloadParameter.ActualValue == null) 63 63 BestOverloadParameter.ActualValue = new DoubleValue(OverloadParameter.ActualValue[i].Value); 64 else if (OverloadParameter.ActualValue[i].Value <= BestOverloadParameter.ActualValue.Value)64 else if (OverloadParameter.ActualValue[i].Value <= BestOverloadParameter.ActualValue.Value) 65 65 BestOverloadParameter.ActualValue.Value = OverloadParameter.ActualValue[i].Value; 66 66 -
trunk/sources/HeuristicLab.Problems.VehicleRouting/3.4/Analyzer/BestAverageWorstTours/PickupAndDelivery/BestAverageWorstPickupAndDeliveryVRPToursAnalyzer.cs
r7175 r8053 1 1 #region License Information 2 2 /* HeuristicLab 3 * Copyright (C) 2002-201 0Heuristic and Evolutionary Algorithms Laboratory (HEAL)3 * Copyright (C) 2002-2012 Heuristic and Evolutionary Algorithms Laboratory (HEAL) 4 4 * 5 5 * This file is part of HeuristicLab. … … 21 21 22 22 using System; 23 using HeuristicLab.Analysis; 23 24 using HeuristicLab.Common; 24 25 using HeuristicLab.Core; … … 29 30 using HeuristicLab.Parameters; 30 31 using HeuristicLab.Persistence.Default.CompositeSerializers.Storable; 31 using HeuristicLab. Analysis;32 using HeuristicLab.Problems.VehicleRouting.Interfaces; 32 33 using HeuristicLab.Problems.VehicleRouting.Variants; 33 using HeuristicLab.Problems.VehicleRouting.Interfaces;34 34 35 35 namespace HeuristicLab.Problems.VehicleRouting { … … 82 82 public BestAverageWorstPickupAndDeliveryVRPToursAnalyzer() 83 83 : base() { 84 #region Create parameters 84 #region Create parameters 85 85 Parameters.Add(new LookupParameter<IVRPProblemInstance>("ProblemInstance", "The problem instance.")); 86 86 … … 91 91 Parameters.Add(new ValueLookupParameter<IntValue>("CurrentWorstPickupViolations", "The current worst pickup violations value of all solutions.")); 92 92 Parameters.Add(new ValueLookupParameter<DataTable>("PickupViolationsValues", "The data table to store the current best, current average, current worst, best and best known pickup violations value.")); 93 93 94 94 Parameters.Add(new ValueLookupParameter<VariableCollection>("Results", "The results collection where the analysis values should be stored.")); 95 95 #endregion … … 145 145 private BestAverageWorstPickupAndDeliveryVRPToursAnalyzer(BestAverageWorstPickupAndDeliveryVRPToursAnalyzer original, Cloner cloner) 146 146 : base(original, cloner) { 147 147 this.Initialize(); 148 148 } 149 149 … … 151 151 BestAverageWorstCalculator.PickupViolationsParameter.Depth = PickupViolationsParameter.Depth; 152 152 BestMemorizer.PickupViolationsParameter.Depth = PickupViolationsParameter.Depth; 153 } 153 } 154 154 } 155 155 } -
trunk/sources/HeuristicLab.Problems.VehicleRouting/3.4/Analyzer/BestAverageWorstTours/PickupAndDelivery/BestAverageWorstPickupAndDeliveryVRPToursCalculator.cs
r6710 r8053 1 1 #region License Information 2 2 /* HeuristicLab 3 * Copyright (C) 2002-201 0Heuristic and Evolutionary Algorithms Laboratory (HEAL)3 * Copyright (C) 2002-2012 Heuristic and Evolutionary Algorithms Laboratory (HEAL) 4 4 * 5 5 * This file is part of HeuristicLab. … … 20 20 #endregion 21 21 22 using HeuristicLab.Common; 22 23 using HeuristicLab.Core; 23 24 using HeuristicLab.Data; … … 25 26 using HeuristicLab.Parameters; 26 27 using HeuristicLab.Persistence.Default.CompositeSerializers.Storable; 27 using HeuristicLab.Common;28 28 29 29 namespace HeuristicLab.Problems.VehicleRouting { … … 46 46 public BestAverageWorstPickupAndDeliveryVRPToursCalculator() 47 47 : base() { 48 49 50 51 48 Parameters.Add(new ScopeTreeLookupParameter<IntValue>("PickupViolations", "The pickup violations of the VRP solutions which should be analyzed.")); 49 Parameters.Add(new ValueLookupParameter<IntValue>("BestPickupViolations", "The best pickup violations value.")); 50 Parameters.Add(new ValueLookupParameter<DoubleValue>("AveragePickupViolations", "The average pickup violations value of all solutions.")); 51 Parameters.Add(new ValueLookupParameter<IntValue>("WorstPickupViolations", "The worst pickup violations value of all solutions.")); 52 52 } 53 53 … … 84 84 } 85 85 } 86 86 87 87 public override IOperation Apply() { 88 88 UpdatePickupViolations(); 89 89 90 90 return base.Apply(); 91 91 } -
trunk/sources/HeuristicLab.Problems.VehicleRouting/3.4/Analyzer/BestAverageWorstTours/PickupAndDelivery/BestPickupAndDeliveryVRPToursMemorizer.cs
r6710 r8053 1 1 #region License Information 2 2 /* HeuristicLab 3 * Copyright (C) 2002-201 0Heuristic and Evolutionary Algorithms Laboratory (HEAL)3 * Copyright (C) 2002-2012 Heuristic and Evolutionary Algorithms Laboratory (HEAL) 4 4 * 5 5 * This file is part of HeuristicLab. … … 21 21 22 22 using System.Linq; 23 using HeuristicLab.Common; 23 24 using HeuristicLab.Core; 24 25 using HeuristicLab.Data; … … 26 27 using HeuristicLab.Parameters; 27 28 using HeuristicLab.Persistence.Default.CompositeSerializers.Storable; 28 using HeuristicLab.Common;29 29 30 30 namespace HeuristicLab.Problems.VehicleRouting { … … 42 42 public BestPickupAndDeliveryVRPToursMemorizer() 43 43 : base() { 44 44 Parameters.Add(new ScopeTreeLookupParameter<IntValue>("PickupViolations", "The pickup violations of the VRP solutions which should be analyzed.")); 45 45 46 46 Parameters.Add(new ValueLookupParameter<IntValue>("BestPickupViolations", "The best pickup violations found so far.")); 47 47 } 48 48 -
trunk/sources/HeuristicLab.Problems.VehicleRouting/3.4/Analyzer/BestAverageWorstTours/TimeWindowed/BestAverageWorstTimeWindowedVRPToursAnalyzer.cs
r7175 r8053 1 1 #region License Information 2 2 /* HeuristicLab 3 * Copyright (C) 2002-201 0Heuristic and Evolutionary Algorithms Laboratory (HEAL)3 * Copyright (C) 2002-2012 Heuristic and Evolutionary Algorithms Laboratory (HEAL) 4 4 * 5 5 * This file is part of HeuristicLab. … … 21 21 22 22 using System; 23 using HeuristicLab.Analysis; 23 24 using HeuristicLab.Common; 24 25 using HeuristicLab.Core; … … 29 30 using HeuristicLab.Parameters; 30 31 using HeuristicLab.Persistence.Default.CompositeSerializers.Storable; 31 using HeuristicLab. Analysis;32 using HeuristicLab.Problems.VehicleRouting.Interfaces; 32 33 using HeuristicLab.Problems.VehicleRouting.Variants; 33 using HeuristicLab.Problems.VehicleRouting.Interfaces;34 34 35 35 namespace HeuristicLab.Problems.VehicleRouting { … … 101 101 public BestAverageWorstTimeWindowedVRPToursAnalyzer() 102 102 : base() { 103 #region Create parameters 103 #region Create parameters 104 104 Parameters.Add(new LookupParameter<IVRPProblemInstance>("ProblemInstance", "The problem instance.")); 105 105 … … 193 193 private BestAverageWorstTimeWindowedVRPToursAnalyzer(BestAverageWorstTimeWindowedVRPToursAnalyzer original, Cloner cloner) 194 194 : base(original, cloner) { 195 195 this.Initialize(); 196 196 } 197 197 -
trunk/sources/HeuristicLab.Problems.VehicleRouting/3.4/Analyzer/BestAverageWorstTours/TimeWindowed/BestAverageWorstTimeWindowedVRPToursCalculator.cs
r4752 r8053 1 1 #region License Information 2 2 /* HeuristicLab 3 * Copyright (C) 2002-201 0Heuristic and Evolutionary Algorithms Laboratory (HEAL)3 * Copyright (C) 2002-2012 Heuristic and Evolutionary Algorithms Laboratory (HEAL) 4 4 * 5 5 * This file is part of HeuristicLab. … … 20 20 #endregion 21 21 22 using HeuristicLab.Common; 22 23 using HeuristicLab.Core; 23 24 using HeuristicLab.Data; … … 25 26 using HeuristicLab.Parameters; 26 27 using HeuristicLab.Persistence.Default.CompositeSerializers.Storable; 27 using HeuristicLab.Common;28 28 29 29 namespace HeuristicLab.Problems.VehicleRouting { -
trunk/sources/HeuristicLab.Problems.VehicleRouting/3.4/Analyzer/BestAverageWorstTours/TimeWindowed/BestTimeWindowedVRPToursMemorizer.cs
r4752 r8053 1 1 #region License Information 2 2 /* HeuristicLab 3 * Copyright (C) 2002-201 0Heuristic and Evolutionary Algorithms Laboratory (HEAL)3 * Copyright (C) 2002-2012 Heuristic and Evolutionary Algorithms Laboratory (HEAL) 4 4 * 5 5 * This file is part of HeuristicLab. … … 21 21 22 22 using System.Linq; 23 using HeuristicLab.Common; 23 24 using HeuristicLab.Core; 24 25 using HeuristicLab.Data; … … 26 27 using HeuristicLab.Parameters; 27 28 using HeuristicLab.Persistence.Default.CompositeSerializers.Storable; 28 using HeuristicLab.Common;29 29 30 30 namespace HeuristicLab.Problems.VehicleRouting { -
trunk/sources/HeuristicLab.Problems.VehicleRouting/3.4/Analyzer/BestSolution/BestVRPSolutionAnalyzer.cs
r7934 r8053 1 1 #region License Information 2 2 /* HeuristicLab 3 * Copyright (C) 2002-201 0Heuristic and Evolutionary Algorithms Laboratory (HEAL)3 * Copyright (C) 2002-2012 Heuristic and Evolutionary Algorithms Laboratory (HEAL) 4 4 * 5 5 * This file is part of HeuristicLab. -
trunk/sources/HeuristicLab.Problems.VehicleRouting/3.4/Analyzer/BestSolution/Capacitated/BestCapacitatedVRPSolutionAnalyzer.cs
r7175 r8053 1 1 #region License Information 2 2 /* HeuristicLab 3 * Copyright (C) 2002-201 0Heuristic and Evolutionary Algorithms Laboratory (HEAL)3 * Copyright (C) 2002-2012 Heuristic and Evolutionary Algorithms Laboratory (HEAL) 4 4 * 5 5 * This file is part of HeuristicLab. … … 21 21 22 22 using System.Linq; 23 using HeuristicLab.Common; 23 24 using HeuristicLab.Core; 24 25 using HeuristicLab.Data; … … 29 30 using HeuristicLab.Problems.VehicleRouting.Interfaces; 30 31 using HeuristicLab.Problems.VehicleRouting.Variants; 31 using HeuristicLab.Common;32 32 33 33 namespace HeuristicLab.Problems.VehicleRouting { … … 68 68 public BestCapacitatedVRPSolutionAnalyzer() 69 69 : base() { 70 71 72 70 Parameters.Add(new LookupParameter<IVRPProblemInstance>("ProblemInstance", "The problem instance.")); 71 Parameters.Add(new ScopeTreeLookupParameter<IVRPEncoding>("VRPTours", "The VRP tours which should be evaluated.")); 72 Parameters.Add(new ScopeTreeLookupParameter<DoubleValue>("Quality", "The qualities of the VRP solutions which should be analyzed.")); 73 73 74 74 Parameters.Add(new ScopeTreeLookupParameter<DoubleValue>("Overload", "The overloads of the VRP solutions which should be analyzed.")); 75 75 76 77 76 Parameters.Add(new LookupParameter<VRPSolution>("BestSolution", "The best VRP solution.")); 77 Parameters.Add(new ValueLookupParameter<ResultCollection>("Results", "The result collection where the best VRP solution should be stored.")); 78 78 } 79 79 -
trunk/sources/HeuristicLab.Problems.VehicleRouting/3.4/Analyzer/BestSolution/PickupAndDelivery/BestPickupAndDeliveryVRPSolutionAnalyzer.cs
r7175 r8053 1 1 #region License Information 2 2 /* HeuristicLab 3 * Copyright (C) 2002-201 0Heuristic and Evolutionary Algorithms Laboratory (HEAL)3 * Copyright (C) 2002-2012 Heuristic and Evolutionary Algorithms Laboratory (HEAL) 4 4 * 5 5 * This file is part of HeuristicLab. … … 21 21 22 22 using System.Linq; 23 using HeuristicLab.Common; 23 24 using HeuristicLab.Core; 24 25 using HeuristicLab.Data; … … 29 30 using HeuristicLab.Problems.VehicleRouting.Interfaces; 30 31 using HeuristicLab.Problems.VehicleRouting.Variants; 31 using HeuristicLab.Common;32 32 33 33 namespace HeuristicLab.Problems.VehicleRouting { … … 68 68 public BestPickupAndDeliveryVRPSolutionAnalyzer() 69 69 : base() { 70 71 72 70 Parameters.Add(new LookupParameter<IVRPProblemInstance>("ProblemInstance", "The problem instance.")); 71 Parameters.Add(new ScopeTreeLookupParameter<IVRPEncoding>("VRPTours", "The VRP tours which should be evaluated.")); 72 Parameters.Add(new ScopeTreeLookupParameter<DoubleValue>("Quality", "The qualities of the VRP solutions which should be analyzed.")); 73 73 74 74 Parameters.Add(new ScopeTreeLookupParameter<IntValue>("PickupViolations", "The pickup violation of the VRP solutions which should be analyzed.")); 75 75 76 77 76 Parameters.Add(new LookupParameter<VRPSolution>("BestSolution", "The best VRP solution.")); 77 Parameters.Add(new ValueLookupParameter<ResultCollection>("Results", "The result collection where the best VRP solution should be stored.")); 78 78 } 79 79 -
trunk/sources/HeuristicLab.Problems.VehicleRouting/3.4/Analyzer/BestSolution/TimeWindowed/BestTimeWindowedVRPSolutionAnalyzer.cs
r7175 r8053 1 1 #region License Information 2 2 /* HeuristicLab 3 * Copyright (C) 2002-201 0Heuristic and Evolutionary Algorithms Laboratory (HEAL)3 * Copyright (C) 2002-2012 Heuristic and Evolutionary Algorithms Laboratory (HEAL) 4 4 * 5 5 * This file is part of HeuristicLab. … … 21 21 22 22 using System.Linq; 23 using HeuristicLab.Common; 23 24 using HeuristicLab.Core; 24 25 using HeuristicLab.Data; … … 29 30 using HeuristicLab.Problems.VehicleRouting.Interfaces; 30 31 using HeuristicLab.Problems.VehicleRouting.Variants; 31 using HeuristicLab.Common;32 32 33 33 namespace HeuristicLab.Problems.VehicleRouting { … … 71 71 public BestTimeWindowedVRPSolutionAnalyzer() 72 72 : base() { 73 74 75 73 Parameters.Add(new LookupParameter<IVRPProblemInstance>("ProblemInstance", "The problem instance.")); 74 Parameters.Add(new ScopeTreeLookupParameter<IVRPEncoding>("VRPTours", "The VRP tours which should be evaluated.")); 75 Parameters.Add(new ScopeTreeLookupParameter<DoubleValue>("Quality", "The qualities of the VRP solutions which should be analyzed.")); 76 76 77 78 77 Parameters.Add(new ScopeTreeLookupParameter<DoubleValue>("Tardiness", "The tardiness of the VRP solutions which should be analyzed.")); 78 Parameters.Add(new ScopeTreeLookupParameter<DoubleValue>("TravelTime", "The travel times of the VRP solutions which should be analyzed.")); 79 79 80 81 80 Parameters.Add(new LookupParameter<VRPSolution>("BestSolution", "The best VRP solution.")); 81 Parameters.Add(new ValueLookupParameter<ResultCollection>("Results", "The result collection where the best VRP solution should be stored.")); 82 82 } 83 83 -
trunk/sources/HeuristicLab.Problems.VehicleRouting/3.4/Analyzer/ConstraintRelaxation/Capacitated/CapacityRelaxationVRPAnalyzer.cs
r7906 r8053 1 1 #region License Information 2 2 /* HeuristicLab 3 * Copyright (C) 2002-201 0Heuristic and Evolutionary Algorithms Laboratory (HEAL)3 * Copyright (C) 2002-2012 Heuristic and Evolutionary Algorithms Laboratory (HEAL) 4 4 * 5 5 * This file is part of HeuristicLab. … … 20 20 #endregion 21 21 22 using System; 23 using System.Collections.Generic; 24 using System.Linq; 25 using System.Text; 22 using HeuristicLab.Common; 26 23 using HeuristicLab.Core; 27 using HeuristicLab. Persistence.Default.CompositeSerializers.Storable;24 using HeuristicLab.Data; 28 25 using HeuristicLab.Operators; 29 26 using HeuristicLab.Optimization; 27 using HeuristicLab.Parameters; 28 using HeuristicLab.Persistence.Default.CompositeSerializers.Storable; 29 using HeuristicLab.Problems.VehicleRouting.Interfaces; 30 30 using HeuristicLab.Problems.VehicleRouting.Variants; 31 using HeuristicLab.Problems.VehicleRouting.Interfaces;32 using HeuristicLab.Parameters;33 using HeuristicLab.Data;34 using HeuristicLab.Common;35 31 36 32 namespace HeuristicLab.Problems.VehicleRouting { … … 40 36 [Item("CapacityRelaxationVRPAnalyzer", "An operator for adaptively relaxing the capacity constraints.")] 41 37 [StorableClass] 42 public class CapacityRelaxationVRPAnalyzer : SingleSuccessorOperator, IAnalyzer, ICapacitatedOperator {38 public class CapacityRelaxationVRPAnalyzer : SingleSuccessorOperator, IAnalyzer, ICapacitatedOperator { 43 39 public ILookupParameter<IVRPProblemInstance> ProblemInstanceParameter { 44 40 get { return (ILookupParameter<IVRPProblemInstance>)Parameters["ProblemInstance"]; } … … 102 98 ICapacitatedProblemInstance cvrp = ProblemInstanceParameter.ActualValue as ICapacitatedProblemInstance; 103 99 ResultCollection results = ResultsParameter.ActualValue; 104 100 105 101 ItemArray<DoubleValue> qualities = QualityParameter.ActualValue; 106 102 ItemArray<DoubleValue> overloads = OverloadParameter.ActualValue; 107 103 108 104 double sigma = SigmaParameter.Value.Value; 109 105 double phi = PhiParameter.Value.Value; -
trunk/sources/HeuristicLab.Problems.VehicleRouting/3.4/Analyzer/ConstraintRelaxation/PickupAndDelivery/PickupViolationsRelaxationVRPAnalyzer.cs
r7906 r8053 1 1 #region License Information 2 2 /* HeuristicLab 3 * Copyright (C) 2002-201 0Heuristic and Evolutionary Algorithms Laboratory (HEAL)3 * Copyright (C) 2002-2012 Heuristic and Evolutionary Algorithms Laboratory (HEAL) 4 4 * 5 5 * This file is part of HeuristicLab. … … 20 20 #endregion 21 21 22 using System; 23 using System.Collections.Generic; 24 using System.Linq; 25 using System.Text; 22 using HeuristicLab.Common; 26 23 using HeuristicLab.Core; 27 using HeuristicLab. Persistence.Default.CompositeSerializers.Storable;24 using HeuristicLab.Data; 28 25 using HeuristicLab.Operators; 29 26 using HeuristicLab.Optimization; 27 using HeuristicLab.Parameters; 28 using HeuristicLab.Persistence.Default.CompositeSerializers.Storable; 29 using HeuristicLab.Problems.VehicleRouting.Interfaces; 30 30 using HeuristicLab.Problems.VehicleRouting.Variants; 31 using HeuristicLab.Problems.VehicleRouting.Interfaces;32 using HeuristicLab.Parameters;33 using HeuristicLab.Data;34 using HeuristicLab.Common;35 31 36 32 namespace HeuristicLab.Problems.VehicleRouting { … … 40 36 [Item("PickupViolationsRelaxationVRPAnalyzer", "An operator for adaptively relaxing the pickup constraints.")] 41 37 [StorableClass] 42 public class PickupViolationsRelaxationVRPAnalyzer : SingleSuccessorOperator, IAnalyzer, IPickupAndDeliveryOperator {38 public class PickupViolationsRelaxationVRPAnalyzer : SingleSuccessorOperator, IAnalyzer, IPickupAndDeliveryOperator { 43 39 public ILookupParameter<IVRPProblemInstance> ProblemInstanceParameter { 44 40 get { return (ILookupParameter<IVRPProblemInstance>)Parameters["ProblemInstance"]; } … … 102 98 IPickupAndDeliveryProblemInstance pdp = ProblemInstanceParameter.ActualValue as IPickupAndDeliveryProblemInstance; 103 99 ResultCollection results = ResultsParameter.ActualValue; 104 100 105 101 ItemArray<DoubleValue> qualities = QualityParameter.ActualValue; 106 102 ItemArray<IntValue> pickupViolations = PickupViolationsParameter.ActualValue; 107 103 108 104 double sigma = SigmaParameter.Value.Value; 109 105 double phi = PhiParameter.Value.Value; -
trunk/sources/HeuristicLab.Problems.VehicleRouting/3.4/Analyzer/ConstraintRelaxation/TimeWindowed/TimeWindowRelaxationVRPAnalyzer.cs
r7906 r8053 1 1 #region License Information 2 2 /* HeuristicLab 3 * Copyright (C) 2002-201 0Heuristic and Evolutionary Algorithms Laboratory (HEAL)3 * Copyright (C) 2002-2012 Heuristic and Evolutionary Algorithms Laboratory (HEAL) 4 4 * 5 5 * This file is part of HeuristicLab. … … 20 20 #endregion 21 21 22 using System; 23 using System.Collections.Generic; 24 using System.Linq; 25 using System.Text; 22 using HeuristicLab.Common; 26 23 using HeuristicLab.Core; 27 using HeuristicLab. Persistence.Default.CompositeSerializers.Storable;24 using HeuristicLab.Data; 28 25 using HeuristicLab.Operators; 29 26 using HeuristicLab.Optimization; 27 using HeuristicLab.Parameters; 28 using HeuristicLab.Persistence.Default.CompositeSerializers.Storable; 29 using HeuristicLab.Problems.VehicleRouting.Interfaces; 30 30 using HeuristicLab.Problems.VehicleRouting.Variants; 31 using HeuristicLab.Problems.VehicleRouting.Interfaces;32 using HeuristicLab.Parameters;33 using HeuristicLab.Data;34 using HeuristicLab.Common;35 31 36 32 namespace HeuristicLab.Problems.VehicleRouting { … … 40 36 [Item("TimeWindowRelaxationVRPAnalyzer", "An operator for adaptively relaxing the time window constraints.")] 41 37 [StorableClass] 42 public class TimeWindowRelaxationVRPAnalyzer : SingleSuccessorOperator, IAnalyzer, ITimeWindowedOperator {38 public class TimeWindowRelaxationVRPAnalyzer : SingleSuccessorOperator, IAnalyzer, ITimeWindowedOperator { 43 39 public ILookupParameter<IVRPProblemInstance> ProblemInstanceParameter { 44 40 get { return (ILookupParameter<IVRPProblemInstance>)Parameters["ProblemInstance"]; } … … 102 98 ITimeWindowedProblemInstance vrptw = ProblemInstanceParameter.ActualValue as ITimeWindowedProblemInstance; 103 99 ResultCollection results = ResultsParameter.ActualValue; 104 100 105 101 ItemArray<DoubleValue> qualities = QualityParameter.ActualValue; 106 102 ItemArray<DoubleValue> tardiness = TardinessParameter.ActualValue; 107 103 108 104 double sigma = SigmaParameter.Value.Value; 109 105 double phi = PhiParameter.Value.Value; -
trunk/sources/HeuristicLab.Problems.VehicleRouting/3.4/Analyzer/VRPSolution.cs
r7906 r8053 1 1 #region License Information 2 2 /* HeuristicLab 3 * Copyright (C) 2002-201 0Heuristic and Evolutionary Algorithms Laboratory (HEAL)3 * Copyright (C) 2002-2012 Heuristic and Evolutionary Algorithms Laboratory (HEAL) 4 4 * 5 5 * This file is part of HeuristicLab. … … 86 86 this.solution = solution; 87 87 this.quality = quality; 88 88 89 89 Initialize(); 90 90 } … … 136 136 changed(this, EventArgs.Empty); 137 137 } 138 138 139 139 private void RegisterProblemInstanceEvents() { 140 140 ProblemInstance.ToStringChanged += new EventHandler(ProblemInstance_ToStringChanged);
Note: See TracChangeset
for help on using the changeset viewer.