Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

HEURISTICS
2007

favoriteEmaildiscussreport

103views more HEURISTICS 2007»

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

13 years 4 months ago

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

Download wifo1.bwl.uni-mannheim.de

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.

Kenneth Sörensen

Real-time Traffic

Distance Measures | Edit Distance | HEURISTICS 2007 | Problems |

claim paper

Related Content

» Bipartite Graph Matching for Computing the Edit Distance of Graphs

» OperatorBased Distance for Genetic Programming Subtree Crossover Distance

» A Probabilistic Approach to Learning Costs for Graph Edit Distance

» Weighted SymbolsBased Edit Distance for StringStructured Image Classification

» Data Editing Techniques to Allow the Application of DistanceBased Outlier Detection to Str...

» Distance Based Indexing for String Proximity Search

» Extending QGrams to Estimate Selectivity of String Matching with Low Edit Distance

» A General Edit Distance between RNA Structures

» An Evaluation of the WPE Algorithm Using Tangent Distance

Post Info
More Details (n/a)

Added	14 Dec 2010
Updated	14 Dec 2010
Type	Journal
Year	2007
Where	HEURISTICS
Authors	Kenneth Sörensen

Comments (0)