Genetic algorithms with sharing for multimodal function optimization
Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application
On a cyclic string-to-string correction problem
Information Processing Letters
Sorting by reversals is difficult
RECOMB '97 Proceedings of the first annual international conference on Computational molecular biology
The String-to-String Correction Problem
Journal of the ACM (JACM)
MA|PM: memetic algorithms with population management
Computers and Operations Research
EMO '09 Proceedings of the 5th International Conference on Evolutionary Multi-Criterion Optimization
Comparison of similarity measures for the multi-objective vehicle routing problem with time windows
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Preserving population diversity for the multi-objective vehicle routing problem with time windows
Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers
An improved multi-objective evolutionary algorithm for the vehicle routing problem with time windows
Computers and Operations Research
A dual-population genetic algorithm for adaptive diversity control
IEEE Transactions on Evolutionary Computation
A GRASP with evolutionary path relinking for the truck and trailer routing problem
Computers and Operations Research
Controlled permutations for testing adaptive classifiers
DS'11 Proceedings of the 14th international conference on Discovery science
Fitness landscape analysis for the no-wait flow-shop scheduling problem
Journal of Heuristics
A scatter search algorithm for the single row facility layout problem
Journal of Heuristics
| Hi-index | 0.00 |
In this paper, we discuss distance measures for a number of different combinatorial optimization problems of which the solutions are best represented as permutations of items, sometimes composed of several permutation (sub)sets. The problems discussed include single-machine and multiple-machine scheduling problems, the traveling salesman problem, vehicle routing problems, and many others. Each of these problems requires a different distance measure that takes the specific properties of the representation into account. The distance measures discussed in this paper are based on a general distance measure for string comparison called the edit distance. We introduce several extensions to the simple edit distance, that can be used when a solution cannot be represented as a simple permutation, and develop algorithms to calculate them efficiently.