| 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 HeuristicLab.Core;
|
|---|
| 24 | using HeuristicLab.Data;
|
|---|
| 25 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
|---|
| 26 |
|
|---|
| 27 | namespace HeuristicLab.Problems.TravelingSalesman {
|
|---|
| 28 |
|
|---|
| 29 | /// <summary>
|
|---|
| 30 | /// A class for storing details of population diversity analysis results.
|
|---|
| 31 | /// </summary>
|
|---|
| 32 | [Item("TSPPopulationDiversityAnalysisDetails", "A class for storing details of population diversity analysis results.")]
|
|---|
| 33 | [StorableClass]
|
|---|
| 34 | public class TSPPopulationDiversityAnalysisDetails : Item {
|
|---|
| 35 |
|
|---|
| 36 | [Storable]
|
|---|
| 37 | private IList<double> averageSimilarities;
|
|---|
| 38 | public IList<double> AverageSimilarities {
|
|---|
| 39 | get { return averageSimilarities; }
|
|---|
| 40 | }
|
|---|
| 41 | [Storable]
|
|---|
| 42 | private IList<double> averageMaximumSimilarities;
|
|---|
| 43 | public IList<double> AverageMaximumSimilarities {
|
|---|
| 44 | get { return averageMaximumSimilarities; }
|
|---|
| 45 | }
|
|---|
| 46 |
|
|---|
| 47 | [Storable]
|
|---|
| 48 | private IList<double[,]> similarities;
|
|---|
| 49 | public IList<double[,]> Similarities {
|
|---|
| 50 | get { return similarities; }
|
|---|
| 51 | }
|
|---|
| 52 | [Storable]
|
|---|
| 53 | private IList<double[]> maximumSimilarities;
|
|---|
| 54 | public IList<double[]> MaximumSimilarities {
|
|---|
| 55 | get { return maximumSimilarities; }
|
|---|
| 56 | }
|
|---|
| 57 |
|
|---|
| 58 | public TSPPopulationDiversityAnalysisDetails()
|
|---|
| 59 | : base() {
|
|---|
| 60 | averageSimilarities = new List<double>();
|
|---|
| 61 | averageMaximumSimilarities = new List<double>();
|
|---|
| 62 | similarities = new List<double[,]>();
|
|---|
| 63 | maximumSimilarities = new List<double[]>();
|
|---|
| 64 | }
|
|---|
| 65 |
|
|---|
| 66 | }
|
|---|
| 67 |
|
|---|
| 68 | }
|
|---|
