[1558] | 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;
|
---|
| 23 | using System.Collections.Generic;
|
---|
| 24 | using System.Text;
|
---|
| 25 | using System.Linq;
|
---|
| 26 | using HeuristicLab.Core;
|
---|
| 27 | using HeuristicLab.Data;
|
---|
| 28 | using HeuristicLab.Permutation;
|
---|
| 29 | using HeuristicLab.Evolutionary;
|
---|
| 30 | using HeuristicLab.Operators;
|
---|
| 31 | using HeuristicLab.Routing.TSP;
|
---|
| 32 | using HeuristicLab.Selection;
|
---|
| 33 | using System.Collections;
|
---|
| 34 |
|
---|
[1646] | 35 | namespace HeuristicLab.FixedOperators {
|
---|
[1558] | 36 | class CreateReplacement : OperatorBase {
|
---|
| 37 | LeftSelector ls;
|
---|
| 38 | RightReducer rr;
|
---|
| 39 | RightSelector rs;
|
---|
| 40 | LeftReducer lr;
|
---|
| 41 | MergingReducer mr;
|
---|
| 42 | Sorter sorter;
|
---|
| 43 |
|
---|
| 44 | public override string Description {
|
---|
| 45 | get { return @"Implements the control structures of CreateReplacement hard wired. Operators are delegated."; }
|
---|
| 46 | }
|
---|
| 47 |
|
---|
| 48 | public CreateReplacement()
|
---|
| 49 | : base() {
|
---|
| 50 | ls = new LeftSelector();
|
---|
| 51 | rr = new RightReducer();
|
---|
| 52 | rs = new RightSelector();
|
---|
| 53 | lr = new LeftReducer();
|
---|
| 54 | mr = new MergingReducer();
|
---|
| 55 | sorter = new Sorter();
|
---|
| 56 |
|
---|
| 57 | sorter.GetVariableInfo("Descending").ActualName = "Maximization";
|
---|
| 58 | sorter.GetVariableInfo("Value").ActualName = "Quality";
|
---|
| 59 |
|
---|
| 60 | ls.GetVariableInfo("Selected").ActualName = "Elites";
|
---|
| 61 | rs.GetVariableInfo("Selected").ActualName = "Elites";
|
---|
| 62 | }
|
---|
| 63 |
|
---|
| 64 | public override IOperation Apply(IScope scope) {
|
---|
| 65 | // SequentialSubScopesProcessor
|
---|
| 66 | ls.Execute(scope.SubScopes[0]);
|
---|
| 67 | rr.Execute(scope.SubScopes[0]);
|
---|
[1661] | 68 |
|
---|
[1558] | 69 | rs.Execute(scope.SubScopes[1]);
|
---|
| 70 | lr.Execute(scope.SubScopes[1]);
|
---|
| 71 |
|
---|
| 72 | mr.Execute(scope);
|
---|
| 73 | sorter.Execute(scope);
|
---|
| 74 |
|
---|
| 75 | return null;
|
---|
| 76 | } // Apply
|
---|
| 77 | } // class CreateReplacement
|
---|
[1646] | 78 | } // namespace HeuristicLab.FixedOperators |
---|