Free cookie consent management tool by TermsFeed Policy Generator

source: trunk/sources/HeuristicLab.Algorithms.NSGA2/3.3/RankAndCrowdingSorter.cs @ 4068

Last change on this file since 4068 was 4068, checked in by swagner, 12 years ago

Sorted usings and removed unused usings in entire solution (#1094)

File size: 3.8 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2010 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
22using HeuristicLab.Core;
23using HeuristicLab.Data;
24using HeuristicLab.Operators;
25using HeuristicLab.Parameters;
26using HeuristicLab.Selection;
27
28namespace HeuristicLab.Algorithms.NSGA2 {
29  public class RankAndCrowdingSorter : AlgorithmOperator {
30    public ValueLookupParameter<BoolArray> MaximizationParameter {
31      get { return (ValueLookupParameter<BoolArray>)Parameters["Maximization"]; }
32    }
33    public ScopeTreeLookupParameter<DoubleArray> QualitiesParameter {
34      get { return (ScopeTreeLookupParameter<DoubleArray>)Parameters["Qualities"]; }
35    }
36    public ScopeTreeLookupParameter<IntValue> RankParameter {
37      get { return (ScopeTreeLookupParameter<IntValue>)Parameters["Rank"]; }
38    }
39    public ScopeTreeLookupParameter<DoubleValue> CrowdingDistanceParameter {
40      get { return (ScopeTreeLookupParameter<DoubleValue>)Parameters["CrowdingDistance"]; }
41    }
42
43    public RankAndCrowdingSorter()
44      : base() {
45      Parameters.Add(new ValueLookupParameter<BoolArray>("Maximization", "For each objective a value that is true if that objective should be maximized, or false if it should be minimized."));
46      Parameters.Add(new ScopeTreeLookupParameter<DoubleArray>("Qualities", "The vector of quality values."));
47      Parameters.Add(new ScopeTreeLookupParameter<IntValue>("Rank", "The rank of a solution (to which front it belongs)."));
48      Parameters.Add(new ScopeTreeLookupParameter<DoubleValue>("CrowdingDistance", "The crowding distance of a solution in a population."));
49
50      FastNonDominatedSort fastNonDominatedSort = new FastNonDominatedSort();
51      UniformSubScopesProcessor subScopesProcessor = new UniformSubScopesProcessor();
52      CrowdingDistanceAssignment crowdingDistanceAssignment = new CrowdingDistanceAssignment();
53      CrowdedComparisonSorter crowdedComparisonSorter = new CrowdedComparisonSorter();
54      MergingReducer mergingReducer = new MergingReducer();
55
56      fastNonDominatedSort.MaximizationParameter.ActualName = MaximizationParameter.Name;
57      fastNonDominatedSort.QualitiesParameter.ActualName = QualitiesParameter.Name;
58      fastNonDominatedSort.RankParameter.ActualName = RankParameter.Name;
59
60      crowdingDistanceAssignment.CrowdingDistanceParameter.ActualName = CrowdingDistanceParameter.Name;
61      crowdingDistanceAssignment.QualitiesParameter.ActualName = QualitiesParameter.Name;
62
63      crowdedComparisonSorter.CrowdingDistanceParameter.ActualName = CrowdingDistanceParameter.Name;
64      crowdedComparisonSorter.RankParameter.ActualName = RankParameter.Name;
65
66      OperatorGraph.InitialOperator = fastNonDominatedSort;
67      fastNonDominatedSort.Successor = subScopesProcessor;
68      subScopesProcessor.Operator = crowdingDistanceAssignment;
69      crowdingDistanceAssignment.Successor = crowdedComparisonSorter;
70      crowdedComparisonSorter.Successor = null;
71      subScopesProcessor.Successor = mergingReducer;
72      mergingReducer.Successor = null;
73    }
74  }
75}
Note: See TracBrowser for help on using the repository browser.