Module org.cicirello.jpt
Package org.cicirello.permutations.distance

Class CyclicRTypeDistance

java.lang.Object
org.cicirello.permutations.distance.CyclicRTypeDistance
All Implemented Interfaces:
NormalizedPermutationDistanceMeasurer, NormalizedPermutationDistanceMeasurerDouble, PermutationDistanceMeasurer, PermutationDistanceMeasurerDouble
public final class CyclicRTypeDistance extends Object implements NormalizedPermutationDistanceMeasurer
Cyclic RType distance treats the permutations as if they represent sets of directed edges, and counts the number of edges that differ. It treats the last to the first element as an edge.

Consider the example permutation: [1, 5, 2, 4, 0, 3]. Cyclic RType distance treats this as equivalent to the set of directed edges: {(1,5), (5,2), (2,4), (4,0), (0,3), (3,1)}.

E.g., distance between [1, 5, 2, 4, 0, 3] and [ 5, 1, 4, 0, 3, 2] is 4. Why? Well, the first permutation has the directed edges: {(1,5), (5,2), (2,4), (4,0), (0,3), (3,1)}. The second has 2 of these (4,0), and (0,3), but does not include 4 of the edges: (1,5), (5,2), (2,4), (3,1)

Runtime: O(n), where n is the permutation length.

Cyclic RType distance was introduced in:
V.A. Cicirello, "The Permutation in a Haystack Problem and the Calculus of Search Landscapes," IEEE Transactions on Evolutionary Computation, 20(3):434-446, June 2016.

  • Constructor Details

    • CyclicRTypeDistance

      public CyclicRTypeDistance()
      Constructs the distance measurer as specified in the class documentation.

  • Method Details