distancePermutationInterchange {CEGO} | R Documentation |

## Interchange Distance for Permutations

### Description

The interchange distance is an edit-distance, counting how many edit operation (here: interchanges, i.e., transposition of two arbitrary elements) have to be performed to transform permutation x into permutation y.

### Usage

```
distancePermutationInterchange(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)

### References

Schiavinotto, Tommaso, and Thomas Stuetzle. "A review of metrics on permutations for search landscape analysis." Computers & operations research 34.10 (2007): 3143-3153.

### Examples

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

[Package

*CEGO*version 2.4.3 Index]