Free cookie consent management tool by TermsFeed Policy Generator

Ignore:
Timestamp:
11/14/12 11:19:36 (12 years ago)
Author:
abeham
Message:

#1841:

  • Corrected best known solutions in new taillard and microarray instances
  • Improved computation of an average fitness in the QAP
File:
1 edited

Legend:

Unmodified
Added
Removed
  • trunk/sources/HeuristicLab.Problems.QuadraticAssignment/3.3/BoundsCalculators/GilmoreLawlerBoundCalculator.cs

    r8092 r8910  
    2222using System;
    2323using HeuristicLab.Data;
     24using HeuristicLab.Encodings.PermutationEncoding;
    2425using HeuristicLab.Problems.LinearAssignment;
    2526
     
    2728  public static class GilmoreLawlerBoundCalculator {
    2829    public static double CalculateLowerBound(DoubleMatrix weights, DoubleMatrix distances) {
     30      Permutation tmp;
     31      return CalculateLowerBound(weights, distances, out tmp);
     32    }
     33
     34    public static double CalculateLowerBound(DoubleMatrix weights, DoubleMatrix distances, out Permutation solution) {
    2935      int N = weights.Rows;
    3036      DoubleMatrix sortedWeights = SortEachRowExceptDiagonal(weights), sortedDistances = SortEachRowExceptDiagonal(distances);
     
    4046
    4147      double result;
    42       LinearAssignmentProblemSolver.Solve(costs, out result);
     48      solution = new Permutation(PermutationTypes.Absolute, LinearAssignmentProblemSolver.Solve(costs, out result));
    4349      return result;
    4450    }
Note: See TracChangeset for help on using the changeset viewer.