Distance measures based on the edit distance for permutation-type representations

In this paper, we develop and discuss several distance measures for permutation type representations of solutions of combinatorial optimisation problems. The problems discussed include single-machine and multiple-machine scheduling problems, the travelling salesman problem, vehicle routing problems, and many others. The distance measures are based on the edit distance. We introduce several extensions to the simple edit distance for more complex problem representations and show how each of these can be calculated.

• Type: Journal
• Year: 2007
• Where: HEURISTICS
• Authors: Kenneth Sörensen
• Keywords: Distance Measures, Edit Distance, HEURISTICS 2007, Problems