distancePermutationHamming: Hamming Distance for Permutations

In CEGO: Combinatorial Efficient Global Optimization

Hamming Distance for Permutations

Description

Hamming distance for permutations, scaled to values between 0 and 1. That is, the number of unequal elements of two permutations, divided by the permutations length.

Usage

distancePermutationHamming(x, y)

Arguments

x	first permutation (integer vector)
y	second permutation (integer vector)

Value

numeric distance value

d(x,y)

, scaled to values between 0 and 1 (based on the maximum possible distance between two permutations)

Examples

x <- 1:5
y <- c(5,1,2,3,4)
distancePermutationHamming(x,y)
p <- replicate(10,sample(1:5),simplify=FALSE)
distanceMatrix(p,distancePermutationHamming)

CEGO documentation built on May 29, 2024, 3:35 a.m.