[12566] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[14185] | 3 | * Copyright (C) 2002-2016 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
[12566] | 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.Linq;
|
---|
[8083] | 23 | using HeuristicLab.Common;
|
---|
[7128] | 24 | using HeuristicLab.Core;
|
---|
[8083] | 25 | using HeuristicLab.Encodings.BinaryVectorEncoding;
|
---|
[7128] | 26 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
| 27 |
|
---|
| 28 | namespace HeuristicLab.Problems.NK {
|
---|
| 29 | [Item("Median Bit Binary Vector Comparer", "Compares two binary vectors by the median positive bit location")]
|
---|
| 30 | [StorableClass]
|
---|
[12582] | 31 | public sealed class MedianBitBinaryVectorComparer : Item, IBinaryVectorComparer {
|
---|
[7128] | 32 | [StorableConstructor]
|
---|
[8083] | 33 | private MedianBitBinaryVectorComparer(bool deserializing) : base(deserializing) { }
|
---|
| 34 | private MedianBitBinaryVectorComparer(MedianBitBinaryVectorComparer original, Cloner cloner)
|
---|
[12582] | 35 | : base(original, cloner) { }
|
---|
[7128] | 36 | public MedianBitBinaryVectorComparer() { }
|
---|
| 37 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
| 38 | return new MedianBitBinaryVectorComparer(this, cloner);
|
---|
| 39 | }
|
---|
| 40 |
|
---|
[12582] | 41 | private static int MedianBit(BinaryVector x) {
|
---|
[8083] | 42 | var activeIndices = x.Select((b, i) => new { b, i }).Where(v => v.b).ToList();
|
---|
| 43 | if (activeIndices.Count > 0)
|
---|
| 44 | return activeIndices[activeIndices.Count / 2].i;
|
---|
[7128] | 45 | else
|
---|
| 46 | return 0;
|
---|
| 47 | }
|
---|
[12582] | 48 |
|
---|
| 49 | public int Compare(BinaryVector x, BinaryVector y) {
|
---|
[7128] | 50 | return MedianBit(x) - MedianBit(y);
|
---|
| 51 | }
|
---|
[8083] | 52 | }
|
---|
[7128] | 53 | }
|
---|