[592] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
| 3 | * Copyright (C) 2002-2008 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;
|
---|
[583] | 23 | using System.Collections.Generic;
|
---|
| 24 | using System.Text;
|
---|
| 25 | using HeuristicLab.Core;
|
---|
| 26 | using HeuristicLab.Data;
|
---|
| 27 | using HeuristicLab.Operators;
|
---|
| 28 | using HeuristicLab.Random;
|
---|
| 29 | using HeuristicLab.Evolutionary;
|
---|
| 30 |
|
---|
| 31 | namespace HeuristicLab.SimOpt {
|
---|
| 32 | public class SimOptSinglePointCrossover : CrossoverBase {
|
---|
| 33 |
|
---|
| 34 | public override string Description {
|
---|
| 35 | get { return @"This operator applies a single point crossover on the variables defined"; }
|
---|
| 36 | }
|
---|
| 37 |
|
---|
| 38 | public SimOptSinglePointCrossover()
|
---|
| 39 | : base() {
|
---|
| 40 | AddVariableInfo(new VariableInfo("Item", "The item list to be crossed", typeof(ConstrainedItemList), VariableKind.In));
|
---|
| 41 | }
|
---|
| 42 |
|
---|
| 43 | protected override void Cross(IScope scope, IRandom random, IScope parent1, IScope parent2, IScope child) {
|
---|
| 44 | ICollection<IConstraint> violated;
|
---|
| 45 | ConstrainedItemList p1 = parent1.GetVariableValue<ConstrainedItemList>("Item", false);
|
---|
| 46 | ConstrainedItemList p2 = parent2.GetVariableValue<ConstrainedItemList>("Item", false);
|
---|
| 47 |
|
---|
| 48 | if (p1.Count != p2.Count) throw new InvalidOperationException("ERROR: the lists do not contain the same number of items");
|
---|
| 49 |
|
---|
| 50 | ConstrainedItemList childList = (ConstrainedItemList)p1.Clone();
|
---|
| 51 | if (childList.Count > 1) {
|
---|
| 52 | int iter = 0;
|
---|
| 53 | do {
|
---|
| 54 | childList.BeginCombinedOperation();
|
---|
| 55 | int crossPoint = random.Next(1, childList.Count);
|
---|
| 56 | for (int i = crossPoint; i < childList.Count; i++) {
|
---|
| 57 | childList.TrySetAt(i, (IItem)p2[i].Clone(), out violated);
|
---|
| 58 | }
|
---|
| 59 | } while (!childList.EndCombinedOperation(out violated) && ++iter < 100);
|
---|
| 60 | if (violated.Count == 0) {
|
---|
| 61 | child.AddVariable(new Variable(parent1.TranslateName("Item"), childList));
|
---|
| 62 | }
|
---|
| 63 | }
|
---|
| 64 | }
|
---|
| 65 | }
|
---|
| 66 | } |
---|