[14512] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
| 3 | * Copyright (C) 2002-2016 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.Linq;
|
---|
| 25 | using HeuristicLab.Common;
|
---|
| 26 | using HeuristicLab.Core;
|
---|
| 27 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
| 28 |
|
---|
| 29 | namespace HeuristicLab.Problems.SurrogateProblem {
|
---|
| 30 | [StorableClass]
|
---|
| 31 | [Item("ManhattenDistance", "A distance function that uses Block distance")]
|
---|
| 32 | public class ManhattenDistance : DistanceBase<IReadOnlyList<double>> {
|
---|
| 33 |
|
---|
| 34 | #region HLConstructors
|
---|
| 35 | [StorableConstructor]
|
---|
| 36 | protected ManhattenDistance(bool deserializing) : base(deserializing) { }
|
---|
| 37 | protected ManhattenDistance(ManhattenDistance original, Cloner cloner)
|
---|
| 38 | : base(original, cloner) { }
|
---|
| 39 | public ManhattenDistance() { }
|
---|
| 40 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
| 41 | return new ManhattenDistance(this, cloner);
|
---|
| 42 | }
|
---|
| 43 | #endregion
|
---|
| 44 |
|
---|
| 45 | public static double GetDistance(IReadOnlyList<double> point1, IReadOnlyList<double> point2) {
|
---|
| 46 | if (point1.Count != point2.Count) throw new ArgumentException("Manhatten distance not defined on vectors of different length");
|
---|
| 47 | return point1.Zip(point2, (a1, b1) => Math.Abs(a1 - b1)).Sum();
|
---|
| 48 | }
|
---|
| 49 |
|
---|
| 50 | public static double GetDistance(IEnumerable<double> a, IEnumerable<double> b, double threshold) {
|
---|
| 51 | double sum = 0;
|
---|
| 52 | var it1 = a.GetEnumerator();
|
---|
| 53 | var it2 = b.GetEnumerator();
|
---|
| 54 | while (sum > threshold && it1.MoveNext() && it2.MoveNext()) {
|
---|
| 55 | sum += Math.Abs(it1.Current - it2.Current);
|
---|
| 56 | }
|
---|
| 57 | it1.Dispose();
|
---|
| 58 | it2.Dispose();
|
---|
| 59 | return sum;
|
---|
| 60 | }
|
---|
| 61 |
|
---|
| 62 | public override double Get(IReadOnlyList<double> a, IReadOnlyList<double> b) {
|
---|
| 63 | return GetDistance(a, b);
|
---|
| 64 | }
|
---|
| 65 |
|
---|
| 66 | public override double Get(IReadOnlyList<double> a, IReadOnlyList<double> b, double threshold) {
|
---|
| 67 | return GetDistance(a, b, threshold);
|
---|
| 68 | }
|
---|
| 69 |
|
---|
| 70 |
|
---|
| 71 | }
|
---|
| 72 | }
|
---|