[2] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[3356] | 3 | * Copyright (C) 2002-2010 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
[2] | 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.Collections.Generic;
|
---|
[3376] | 23 | using HeuristicLab.Common;
|
---|
[2] | 24 | using HeuristicLab.Core;
|
---|
[3356] | 25 | using HeuristicLab.Operators;
|
---|
| 26 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
[2] | 27 |
|
---|
[3356] | 28 | namespace HeuristicLab.Optimization.Operators {
|
---|
[881] | 29 | /// <summary>
|
---|
[3356] | 30 | /// Operator that migrates the selected sub scopes in each subscope in an unidirectional ring.
|
---|
[881] | 31 | /// </summary>
|
---|
[3356] | 32 | [Item("UnidirectionalRingMigrator", "Migrates the selected sub scopes in each subscope in an unidirectional ring.")]
|
---|
| 33 | [StorableClass]
|
---|
| 34 | public class UnidirectionalRingMigrator : SingleSuccessorOperator, IMigrator {
|
---|
[881] | 35 | /// <summary>
|
---|
| 36 | /// Migrates every first sub scope of each child to its left neighbour (like a ring).
|
---|
| 37 | /// <pre>
|
---|
[3356] | 38 | /// __ scope __ __ scope __
|
---|
| 39 | /// / | \ / | \
|
---|
| 40 | /// Pop1 Pop2 Pop3 => Pop1 Pop2 Pop3
|
---|
| 41 | /// / \ / \ / \ / \ / \ / \
|
---|
| 42 | /// R S R S R S R S R S R S
|
---|
| 43 | /// /|\ | /|\ | /|\ | /|\ | /|\ | /|\ |
|
---|
| 44 | /// ABC A DEF D GHI G ABC G DEF A GHI D
|
---|
[881] | 45 | /// </pre>
|
---|
| 46 | /// </summary>
|
---|
[3356] | 47 | /// <returns>The next operation.</returns>
|
---|
| 48 | public override IOperation Apply() {
|
---|
| 49 | IScope scope = ExecutionContext.Scope;
|
---|
| 50 | List<IScope> emigrantsList = new List<IScope>();
|
---|
[2] | 51 |
|
---|
| 52 | for (int i = 0; i < scope.SubScopes.Count; i++) {
|
---|
| 53 | IScope emigrants = scope.SubScopes[i].SubScopes[1];
|
---|
[3356] | 54 | scope.SubScopes[i].SubScopes.Remove(emigrants);
|
---|
[2] | 55 | emigrantsList.Add(emigrants);
|
---|
| 56 | }
|
---|
| 57 |
|
---|
| 58 | // shift first emigrants to end of list
|
---|
| 59 | emigrantsList.Add(emigrantsList[0]);
|
---|
| 60 | emigrantsList.RemoveAt(0);
|
---|
| 61 |
|
---|
| 62 | for (int i = 0; i < scope.SubScopes.Count; i++)
|
---|
[3356] | 63 | scope.SubScopes[i].SubScopes.Add(emigrantsList[i]);
|
---|
[2] | 64 |
|
---|
[3356] | 65 | return base.Apply();
|
---|
[2] | 66 | }
|
---|
| 67 | }
|
---|
| 68 | }
|
---|