1  #region License Information


2  /* HeuristicLab


3  * Copyright (C) 20022015 Joseph Helm and 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 


23  using HeuristicLab.Common;


24  using HeuristicLab.Core;


25  using HeuristicLab.Encodings.PermutationEncoding;


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


27  using HeuristicLab.Problems.BinPacking;


28 


29 


30  namespace HeuristicLab.Encodings.PackingEncoding.PackingSequence {


31  [Item("PackingSequence PMX", "An operator which crosses two PackingSequence representations using the OXstrategy.")]


32  [StorableClass]


33  public class PackingSequencePartiallyMatchedCrossover : PackingSequenceCrossover {


34 


35  [StorableConstructor]


36  protected PackingSequencePartiallyMatchedCrossover(bool deserializing) : base(deserializing) { }


37  protected PackingSequencePartiallyMatchedCrossover(PackingSequencePartiallyMatchedCrossover original, Cloner cloner) : base(original, cloner) { }


38  public PackingSequencePartiallyMatchedCrossover()


39  : base() {


40  }


41  public override IDeepCloneable Clone(Cloner cloner) {


42  return new PackingSequencePartiallyMatchedCrossover(this, cloner);


43  }


44 


45  public override Permutation Cross(IRandom random, Permutation parent1, Permutation parent2) {


46  return PartiallyMatchedCrossover.Apply(random, parent1, parent2);


47  }


48  }


49  }

