[8161] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
| 3 | * Copyright (C) 2002-2012 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 worst.
|
---|
| 33 | /// </summary>
|
---|
| 34 | [Item("WorstSelector", "A selection operator which considers a single double quality value and selects the worst.")]
|
---|
| 35 | [StorableClass]
|
---|
| 36 | public sealed class WorstSelector : SingleObjectiveSelector, ISingleObjectiveSelector {
|
---|
| 37 | [StorableConstructor]
|
---|
| 38 | private WorstSelector(bool deserializing) : base(deserializing) { }
|
---|
| 39 | private WorstSelector(WorstSelector original, Cloner cloner) : base(original, cloner) { }
|
---|
| 40 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
| 41 | return new WorstSelector(this, cloner);
|
---|
| 42 | }
|
---|
| 43 | public WorstSelector() : base() { }
|
---|
| 44 |
|
---|
| 45 | protected override IScope[] Select(List<IScope> scopes) {
|
---|
| 46 | int count = NumberOfSelectedSubScopesParameter.ActualValue.Value;
|
---|
| 47 | bool copy = CopySelectedParameter.Value.Value;
|
---|
| 48 | bool maximization = MaximizationParameter.ActualValue.Value;
|
---|
| 49 | ItemArray<DoubleValue> qualities = QualityParameter.ActualValue;
|
---|
| 50 | IScope[] selected = new IScope[count];
|
---|
| 51 |
|
---|
| 52 | // create a list for each scope that contains the scope's index in the original scope list
|
---|
| 53 | var temp = qualities.Select((x, index) => new { index, x.Value });
|
---|
| 54 | if (maximization)
|
---|
| 55 | temp = temp.OrderBy(x => x.Value);
|
---|
| 56 | else
|
---|
| 57 | temp = temp.OrderByDescending(x => x.Value);
|
---|
| 58 | var list = temp.ToList();
|
---|
| 59 |
|
---|
| 60 | if (copy) {
|
---|
| 61 | int j = 0;
|
---|
| 62 | for (int i = 0; i < count; i++) {
|
---|
| 63 | selected[i] = (IScope)scopes[list[j].index].Clone();
|
---|
| 64 | j++;
|
---|
| 65 | if (j >= list.Count) j = 0;
|
---|
| 66 | }
|
---|
| 67 | } else {
|
---|
| 68 | for (int i = 0; i < count; i++) {
|
---|
| 69 | selected[i] = scopes[list[0].index];
|
---|
| 70 | scopes[list[0].index] = null;
|
---|
| 71 | list.RemoveAt(0);
|
---|
| 72 | }
|
---|
| 73 | scopes.RemoveAll(x => x == null);
|
---|
| 74 | }
|
---|
| 75 | return selected;
|
---|
| 76 | }
|
---|
| 77 | }
|
---|
| 78 | }
|
---|