distancePermutationChebyshev: Chebyshev Distance for Permutations

In CEGO: Combinatorial Efficient Global Optimization

Chebyshev Distance for Permutations

Description

Chebyshev distance for permutations. Specific to permutations is only the scaling to values of 0 to 1:

d(x,y) = \frac{max(|x - y|) }{ (n-1) }

where n is the length of the permutations x and y.

Usage

distancePermutationChebyshev(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)
distancePermutationChebyshev(x,y)
p <- replicate(10,sample(1:5),simplify=FALSE)
distanceMatrix(p,distancePermutationChebyshev)

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