Fitness Distance Correlation and Search Space Analysis for Permutation Based Problems

Abstract. The fitness distance correlation (FDC) as a measure for problem difficulty was first introduced by Forrest and Jones. It was applied to many binary coded problems. This method is now applied to permutation based problems. As demanded by Schiavinotto and St¨utzle, the distance in a search space is calculated by regarding the steps of the (neighborhood) operator. In this paper the five most common operators for permutations are analyzed on symmetric and asymmetric TSP instances. In addition a local quality measure, the point quality (PQ) is proposed as a supplement to the global FDC. With this local measure more characteristics and differences can be investigated. Some experimental results are illustrating these concepts.

• Type: Conference
• Year: 2010
• Where: EVOW
• Authors: Botond Draskoczy
• Keywords: Artificial Intelligence, Binary Coded Problems, EVOW 2010, Permutation Based Problems, fitness Distance Correlation