Package es.urjc.etsii.grafo.algorithms.scattersearch

Class SolutionDistance<S extends Solution<S,I>,I extends Instance>

java.lang.Object
es.urjc.etsii.grafo.algorithms.scattersearch.SolutionDistance<S,I>
Type Parameters:
S - Solution class
I - Instance class
public abstract class SolutionDistance<S extends Solution<S,I>,I extends Instance> extends Object
Calculate the distance (for example, the minimum number of moves to apply to transform solution A in solution B) between any two given solutions for the current problem. Solution distance MUST follow the reflective constraint: distance(a, b) == distance(b, a)

  • Constructor Details

    • SolutionDistance

      public SolutionDistance()

  • Method Details

    • distances

      public abstract double distances(S sa, S sb)
      Calculate distances between given solutions
      Parameters:
      sa - first solution
      sb - second solution
      Returns:
      distance matrix with distances between any two solutions

    • toString

      public String toString()
      Overrides:
      toString in class Object