Free cookie consent management tool by TermsFeed Policy Generator

Ignore:
Timestamp:
07/12/16 19:34:31 (8 years ago)
Author:
gkronber
Message:

#1966: unified namespaces

Location:
branches/HeuristicLab.BinPacking/HeuristicLab.Problems.BinPacking/3.3/Encodings/PackingSequence/Moves
Files:
9 edited

Legend:

Unmodified
Added
Removed
  • branches/HeuristicLab.BinPacking/HeuristicLab.Problems.BinPacking/3.3/Encodings/PackingSequence/Moves/GroupingMoveHardTabuCriterion.cs

    r13032 r14046  
    2828using HeuristicLab.Parameters;
    2929using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
    30 using HeuristicLab.Problems.BinPacking.Interfaces;
     30using HeuristicLab.Problems.BinPacking;
    3131
    3232namespace HeuristicLab.Encodings.PackingEncoding.PackingSequence {
     
    8383      int length = PackingSequence.PackingSequence.Length;
    8484      double moveQuality = MoveQualityParameter.ActualValue.Value;
    85       bool maximization = MaximizationParameter.ActualValue.Value;   
     85      bool maximization = MaximizationParameter.ActualValue.Value;
    8686      bool useAspiration = UseAspirationCriterionParameter.Value.Value;
    8787      bool isTabu = IsMoveTabu(tabuList, move, PackingSequence, moveQuality, maximization, useAspiration);
  • branches/HeuristicLab.BinPacking/HeuristicLab.Problems.BinPacking/3.3/Encodings/PackingSequence/Moves/GroupingMoveMaker.cs

    r13032 r14046  
    2828using HeuristicLab.Parameters;
    2929using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
    30 using HeuristicLab.Problems.BinPacking.Interfaces;
     30using HeuristicLab.Problems.BinPacking;
    3131
    3232namespace HeuristicLab.Encodings.PackingEncoding.PackingSequence {
  • branches/HeuristicLab.BinPacking/HeuristicLab.Problems.BinPacking/3.3/Encodings/PackingSequence/Moves/GroupingMoveSoftTabuCriterion.cs

    r13032 r14046  
    2828using HeuristicLab.Parameters;
    2929using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
    30 using HeuristicLab.Problems.BinPacking.Interfaces;
     30using HeuristicLab.Problems.BinPacking;
     31
    3132
    3233namespace HeuristicLab.Encodings.PackingEncoding.PackingSequence {
  • branches/HeuristicLab.BinPacking/HeuristicLab.Problems.BinPacking/3.3/Encodings/PackingSequence/Moves/Insertion/InsertionMove.cs

    r13032 r14046  
    2626using HeuristicLab.Encodings.PermutationEncoding;
    2727using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
    28 using HeuristicLab.Problems.BinPacking.Interfaces;
     28using HeuristicLab.Problems.BinPacking;
     29
    2930
    3031namespace HeuristicLab.Encodings.PackingEncoding.PackingSequence {
     
    102103        } else
    103104          if (Index1 == attr.Index1 && Index2 == attr.Index2)
    104             return true;
     105          return true;
    105106      }
    106107      return false;
     
    108109
    109110    public override string ToString() {
    110       return "IM(i1="+Index1 + ", i2=" + Index2  +")";
     111      return "IM(i1=" + Index1 + ", i2=" + Index2 + ")";
    111112    }
    112113  }
  • branches/HeuristicLab.BinPacking/HeuristicLab.Problems.BinPacking/3.3/Encodings/PackingSequence/Moves/Insertion/InsertionMoveGenerator.cs

    r13032 r14046  
    2727using HeuristicLab.Parameters;
    2828using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
    29 using HeuristicLab.Problems.BinPacking.Interfaces;
     29using HeuristicLab.Problems.BinPacking;
     30
    3031
    3132namespace HeuristicLab.Encodings.PackingEncoding.PackingSequence {
  • branches/HeuristicLab.BinPacking/HeuristicLab.Problems.BinPacking/3.3/Encodings/PackingSequence/Moves/SequenceMove.cs

    r13032 r14046  
    2525using HeuristicLab.Core;
    2626using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
    27 using HeuristicLab.Problems.BinPacking.Interfaces;
     27using HeuristicLab.Problems.BinPacking;
    2828
    2929namespace HeuristicLab.Encodings.PackingEncoding.PackingSequence {
  • branches/HeuristicLab.BinPacking/HeuristicLab.Problems.BinPacking/3.3/Encodings/PackingSequence/Moves/SequenceTabuMaker.cs

    r13032 r14046  
    2626using HeuristicLab.Parameters;
    2727using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
    28 using HeuristicLab.Problems.BinPacking.Interfaces;
     28using HeuristicLab.Problems.BinPacking;
    2929
    3030namespace HeuristicLab.Encodings.PackingEncoding.PackingSequence {
    3131  [Item("Sequence tabu maker", "Declares a given Sequence move as tabu, by adding its attributes to the tabu list and also store the solution quality or the move quality (whichever is better).")]
    3232  [StorableClass]
    33   public class SequenceTabuMaker : TabuMaker, IPackingSequenceMoveOperator{
     33  public class SequenceTabuMaker : TabuMaker, IPackingSequenceMoveOperator {
    3434    public ILookupParameter<IPackingMove> PackingMoveParameter {
    3535      get { return (ILookupParameter<IPackingMove>)Parameters["PackingMove"]; }
     
    4444    public SequenceTabuMaker()
    4545      : base() {
    46         Parameters.Add(new LookupParameter<IPackingMove>("PackingMove", "The move to evaluate."));
     46      Parameters.Add(new LookupParameter<IPackingMove>("PackingMove", "The move to evaluate."));
    4747      Parameters.Add(new LookupParameter<PackingSequenceEncoding>("PackingSequence", "The solution to evaluate."));
    4848    }
     
    5454    protected override IItem GetTabuAttribute(bool maximization, double quality, double moveQuality) {
    5555      IPackingMove move = PackingMoveParameter.ActualValue;
    56       PackingSequenceEncoding PackingSequence = PackingSequenceParameter.ActualValue;   
     56      PackingSequenceEncoding PackingSequence = PackingSequenceParameter.ActualValue;
    5757      double baseQuality = moveQuality;
    58       if (maximization && quality > moveQuality || !maximization && quality < moveQuality) 
     58      if (maximization && quality > moveQuality || !maximization && quality < moveQuality)
    5959        baseQuality = quality; // we make an uphill move, the lower bound is the solution quality
    6060
  • branches/HeuristicLab.BinPacking/HeuristicLab.Problems.BinPacking/3.3/Encodings/PackingSequence/Moves/Swap2/Swap2Move.cs

    r13032 r14046  
    2626using HeuristicLab.Encodings.PermutationEncoding;
    2727using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
    28 using HeuristicLab.Problems.BinPacking.Interfaces;
     28using HeuristicLab.Problems.BinPacking;
     29
    2930
    3031namespace HeuristicLab.Encodings.PackingEncoding.PackingSequence {
  • branches/HeuristicLab.BinPacking/HeuristicLab.Problems.BinPacking/3.3/Encodings/PackingSequence/Moves/Swap2/Swap2MoveGenerator.cs

    r13032 r14046  
    2727using HeuristicLab.Parameters;
    2828using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
    29 using HeuristicLab.Problems.BinPacking.Interfaces;
     29using HeuristicLab.Problems.BinPacking;
    3030
    3131namespace HeuristicLab.Encodings.PackingEncoding.PackingSequence {
Note: See TracChangeset for help on using the changeset viewer.