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 |
|
---|
22 | using System.Collections.Generic;
|
---|
23 | using System.Linq;
|
---|
24 | using HeuristicLab.Common;
|
---|
25 | using HeuristicLab.Core;
|
---|
26 | using HeuristicLab.Data;
|
---|
27 | using HeuristicLab.Optimization;
|
---|
28 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
29 |
|
---|
30 | namespace HeuristicLab.Selection {
|
---|
31 | /// <summary>
|
---|
32 | /// A selection operator which considers a single double quality value and selects the best.
|
---|
33 | /// </summary>
|
---|
34 | [Item("BestSelector", "A selection operator which considers a single double quality value and selects the best.")]
|
---|
35 | [StorableClass]
|
---|
36 | public sealed class BestSelector : SingleObjectiveSelector, ISingleObjectiveSelector {
|
---|
37 | public BestSelector() : base() { }
|
---|
38 |
|
---|
39 | protected override IScope[] Select(List<IScope> scopes) {
|
---|
40 | int count = NumberOfSelectedSubScopesParameter.ActualValue.Value;
|
---|
41 | bool copy = CopySelectedParameter.Value.Value;
|
---|
42 | bool maximization = MaximizationParameter.ActualValue.Value;
|
---|
43 | ItemArray<DoubleValue> qualities = QualityParameter.ActualValue;
|
---|
44 | IScope[] selected = new IScope[count];
|
---|
45 |
|
---|
46 | // create a list for each scope that contains the scope's index in the original scope list
|
---|
47 | var temp = qualities.Select((x, index) => new { index, x.Value });
|
---|
48 | if (maximization)
|
---|
49 | temp = temp.OrderByDescending(x => x.Value);
|
---|
50 | else
|
---|
51 | temp = temp.OrderBy(x => x.Value);
|
---|
52 | var list = temp.ToList();
|
---|
53 |
|
---|
54 | if (copy) {
|
---|
55 | int j = 0;
|
---|
56 | for (int i = 0; i < count; i++) {
|
---|
57 | selected[i] = (IScope)scopes[list[j].index].Clone();
|
---|
58 | j++;
|
---|
59 | if (j >= list.Count) j = 0;
|
---|
60 | }
|
---|
61 | } else {
|
---|
62 | for (int i = 0; i < count; i++) {
|
---|
63 | selected[i] = scopes[list[0].index];
|
---|
64 | scopes[list[0].index] = null;
|
---|
65 | list.RemoveAt(0);
|
---|
66 | }
|
---|
67 | scopes.RemoveAll(x => x == null);
|
---|
68 | }
|
---|
69 | return selected;
|
---|
70 | }
|
---|
71 | }
|
---|
72 | }
|
---|