Free cookie consent management tool by TermsFeed Policy Generator

source: branches/PersistenceReintegration/HeuristicLab.Problems.Orienteering/3.3/Interfaces/IOrienteeringEvaluator.cs @ 14929

Last change on this file since 14929 was 14929, checked in by gkronber, 7 years ago

#2520 fixed unit tests for new persistence: loading & storing all samples

File size: 1.7 KB
Line 
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
22using HeuristicLab.Core;
23using HeuristicLab.Data;
24using HeuristicLab.Encodings.IntegerVectorEncoding;
25using HeuristicLab.Optimization;
26using HeuristicLab.Persistence;
27
28namespace HeuristicLab.Problems.Orienteering {
29  [StorableType("3c81aa2c-4c98-46d6-9668-6a6a0c93566a")]
30  public interface IOrienteeringEvaluator : ISingleObjectiveEvaluator {
31    ILookupParameter<IntegerVector> IntegerVectorParameter { get; }
32    ILookupParameter<DoubleArray> ScoresParameter { get; }
33    ILookupParameter<DistanceMatrix> DistanceMatrixParameter { get; }
34    ILookupParameter<DoubleValue> MaximumDistanceParameter { get; }
35    ILookupParameter<DoubleValue> PointVisitingCostsParameter { get; }
36    ILookupParameter<DoubleValue> PenaltyParameter { get; }
37
38    OrienteeringEvaluationResult Evaluate(IntegerVector solution, DoubleArray scores,
39      DistanceMatrix distances, double maximumDistance, double pointVisitingCosts);
40  }
41}
Note: See TracBrowser for help on using the repository browser.