1  #region License Information


2  /* HeuristicLab


3  * Copyright (C) 20022012 Heuristic and Evolutionary Algorithms Laboratory (HEAL)


4  *


5  * This file is part of HeuristicLab.


6  *


7  * HeuristicLab is free software: you can redistribute it and/or modify


8  * it under the terms of the GNU General Public License as published by


9  * the Free Software Foundation, either version 3 of the License, or


10  * (at your option) any later version.


11  *


12  * HeuristicLab is distributed in the hope that it will be useful,


13  * but WITHOUT ANY WARRANTY; without even the implied warranty of


14  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the


15  * GNU General Public License for more details.


16  *


17  * You should have received a copy of the GNU General Public License


18  * along with HeuristicLab. If not, see <http://www.gnu.org/licenses/>.


19  */


20  #endregion


21 


22  using System;


23  using System.Collections.Generic;


24  using HeuristicLab.Common;


25  using HeuristicLab.Core;


26  using HeuristicLab.Optimization;


27  using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;


28 


29  namespace HeuristicLab.Encodings.PackingEncoding.PackingSequence {


30  [Item("Exhaustive Insertion Move Generator", "Generates all possible Swap Sequence moves from a given PackingSequence.")]


31  [StorableClass]


32  public class ExhaustiveInsertionMoveGenerator : InsertionMoveGenerator, IExhaustiveMoveGenerator {


33  [StorableConstructor]


34  protected ExhaustiveInsertionMoveGenerator(bool deserializing) : base(deserializing) { }


35  protected ExhaustiveInsertionMoveGenerator(ExhaustiveInsertionMoveGenerator original, Cloner cloner) : base(original, cloner) { }


36  public ExhaustiveInsertionMoveGenerator() : base() { }


37 


38  public override IDeepCloneable Clone(Cloner cloner) {


39  return new ExhaustiveInsertionMoveGenerator(this, cloner);


40  }


41  public static IEnumerable<InsertionMove> Generate(PackingSequenceEncoding PackingSequence, int nrOfBins) {


42  for (int i = 0; i < PackingSequence.PackingSequence.Length  1; i++)


43  for (int j = i + 1; j < PackingSequence.PackingSequence.Length; j++) {


44  if (j != i)


45  yield return new InsertionMove(i, j, PackingSequence);


46  }


47  }


48 


49  public static InsertionMove[] Apply(PackingSequenceEncoding PackingSequence) {


50  int nrOfBins = 0;


51  foreach (int binNr in PackingSequence.PackingSequence) {


52  if (binNr > nrOfBins)


53  nrOfBins = binNr;


54  }


55  nrOfBins++;


56 


57  int totalMoves = (PackingSequence.PackingSequence.Length * (PackingSequence.PackingSequence.Length  1)) / 2;


58  InsertionMove[] moves = new InsertionMove[totalMoves];


59  int count = 0;


60  foreach (InsertionMove move in Generate(PackingSequence, nrOfBins)) {


61  moves[count++] = move;


62  }


63  return moves;


64  }


65 


66  protected override InsertionMove[] GenerateMoves(PackingSequenceEncoding PackingSequence) {


67  return Apply(PackingSequence);


68  }


69  }


70  }

