1  #region License Information


2  /* HeuristicLab


3  * Copyright (C) 20022010 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 HeuristicLab.Analysis;


24  using HeuristicLab.Common;


25  using HeuristicLab.Core;


26  using HeuristicLab.Data;


27  using HeuristicLab.Encodings.PermutationEncoding;


28  using HeuristicLab.Parameters;


29  using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;


30 


31  namespace HeuristicLab.Problems.TravelingSalesman {


32  /// <summary>


33  /// An operator for analyzing the frequency of alleles in solutions of Traveling Salesman Problems given in path representation.


34  /// </summary>


35  [Item("TSPAlleleFrequencyAnalyzer", "An operator for analyzing the frequency of alleles in solutions of Traveling Salesman Problems given in path representation.")]


36  [StorableClass]


37  public sealed class TSPAlleleFrequencyAnalyzer : AlleleFrequencyAnalyzer<Permutation> {


38  public LookupParameter<DoubleMatrix> CoordinatesParameter {


39  get { return (LookupParameter<DoubleMatrix>)Parameters["Coordinates"]; }


40  }


41  public LookupParameter<DistanceMatrix> DistanceMatrixParameter {


42  get { return (LookupParameter<DistanceMatrix>)Parameters["DistanceMatrix"]; }


43  }


44 


45  [StorableConstructor]


46  private TSPAlleleFrequencyAnalyzer(bool deserializing) : base(deserializing) { }


47  private TSPAlleleFrequencyAnalyzer(TSPAlleleFrequencyAnalyzer original, Cloner cloner) : base(original, cloner) { }


48  public TSPAlleleFrequencyAnalyzer()


49  : base() {


50  Parameters.Add(new LookupParameter<DoubleMatrix>("Coordinates", "The x and ycoordinates of the cities."));


51  Parameters.Add(new LookupParameter<DistanceMatrix>("DistanceMatrix", "The matrix which contains the distances between the cities."));


52  }


53 


54  public override IDeepCloneable Clone(Cloner cloner) {


55  return new TSPAlleleFrequencyAnalyzer(this, cloner);


56  }


57 


58  protected override Allele[] CalculateAlleles(Permutation solution) {


59  Allele[] alleles = new Allele[solution.Length];


60  DoubleMatrix coords = CoordinatesParameter.ActualValue;


61  DistanceMatrix dm = DistanceMatrixParameter.ActualValue;


62  int source, target, h;


63  double impact;


64 


65  for (int i = 0; i < solution.Length  1; i++) {


66  source = solution[i];


67  target = solution[i + 1];


68  if (source > target) { h = source; source = target; target = h; }


69  impact = dm != null ? dm[source, target] : CalculateLength(coords[source, 0], coords[source, 1], coords[target, 0], coords[target, 1]);


70  alleles[i] = new Allele(source.ToString() + "" + target.ToString(), impact);


71  }


72  source = solution[solution.Length  1];


73  target = solution[0];


74  if (source > target) { h = source; source = target; target = h; }


75  impact = dm != null ? dm[source, target] : CalculateLength(coords[source, 0], coords[source, 1], coords[target, 0], coords[target, 1]);


76  alleles[alleles.Length  1] = new Allele(source.ToString() + "" + target.ToString(), impact);


77 


78  return alleles;


79  }


80 


81  private double CalculateLength(double x1, double y1, double x2, double y2) {


82  return Math.Sqrt((x1  x2) * (x1  x2) + (y1  y2) * (y1  y2));


83  }


84  }


85  }

