The complexity of finding minimum-length generator sequences
Theoretical Computer Science
Sorting by reversals is difficult
RECOMB '97 Proceedings of the first annual international conference on Computational molecular biology
Faster and simpler algorithm for sorting signed permutations by reversals
RECOMB '97 Proceedings of the first annual international conference on Computational molecular biology
Sorting by bounded permutations
Sorting by bounded permutations
Sorting by bounded block-moves
Discrete Applied Mathematics - Special volume on computational molecular biology DAM-CMB series volume 2
Fitness landscapes and memetic algorithm design
New ideas in optimization
Future Generation Computer Systems
Enumerating longest increasing subsequences and patience sorting
Information Processing Letters
Properties of fitness functions and search landscapes
Theoretical aspects of evolutionary computing
Introduction to Algorithms
SIAM Review
Problem difficulty for tabu search in job-shop scheduling
Artificial Intelligence
Fitness Distance Correlation as a Measure of Problem Difficulty for Genetic Algorithms
Proceedings of the 6th International Conference on Genetic Algorithms
A Template for Scatter Search and Path Relinking
AE '97 Selected Papers from the Third European Conference on Artificial Evolution
1.375-Approximation Algorithm for Sorting by Reversals
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
CPM '96 Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching
Sorting Permutations by Reversals Through Branch-and-Price
INFORMS Journal on Computing
Stochastic Local Search: Foundations & Applications
Stochastic Local Search: Foundations & Applications
A simpler 1.5-approximation algorithm for sorting by transpositions
CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
Fitness landscape analysis and memetic algorithms for the quadratic assignment problem
IEEE Transactions on Evolutionary Computation
A new adaptive multi-start technique for combinatorial global optimizations
Operations Research Letters
An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers
Computers and Operations Research
A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems
Computers and Operations Research
A DE-based approach to no-wait flow-shop scheduling
Computers and Industrial Engineering
Designing and tuning SLS through animation and graphics: an extended walk-through
SLS'07 Proceedings of the 2007 international conference on Engineering stochastic local search algorithms: designing, implementing and analyzing effective heuristics
Path-guided mutation for stochastic pareto local search algorithms
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
Understanding TSP difficulty by learning from evolved instances
LION'10 Proceedings of the 4th international conference on Learning and intelligent optimization
A GRASP with evolutionary path relinking for the truck and trailer routing problem
Computers and Operations Research
Review: Measuring instance difficulty for combinatorial optimization problems
Computers and Operations Research
Local search for the surgery admission planning problem
Journal of Heuristics
Controlled permutations for testing adaptive classifiers
DS'11 Proceedings of the 14th international conference on Discovery science
Discovering the suitability of optimisation algorithms by learning from evolved instances
Annals of Mathematics and Artificial Intelligence
The effect of the asymmetry of road transportation networks on the traveling salesman problem
Computers and Operations Research
ANTS'06 Proceedings of the 5th international conference on Ant Colony Optimization and Swarm Intelligence
Fitness landscape analysis for the no-wait flow-shop scheduling problem
Journal of Heuristics
Fitness distance correlation and search space analysis for permutation based problems
EvoCOP'10 Proceedings of the 10th European conference on Evolutionary Computation in Combinatorial Optimization
Pareto autonomous local search
LION'05 Proceedings of the 5th international conference on Learning and Intelligent Optimization
Generalising algorithm performance in instance space: a timetabling case study
LION'05 Proceedings of the 5th international conference on Learning and Intelligent Optimization
EvoCOP'13 Proceedings of the 13th European conference on Evolutionary Computation in Combinatorial Optimization
Fitness Landscape Analysis and Metaheuristics Efficiency
Journal of Mathematical Modelling and Algorithms
Computers and Operations Research
Solving bi-objective flow shop problem with hybrid path relinking algorithm
Applied Soft Computing
Hi-index | 0.01 |
Search landscape analysis has become a central tool for analysing the dependency of the performance of stochastic local search algorithms on structural aspects of the spaces being searched. Central to search landscape analysis is the notion of distance between candidate solutions. This distance depends on some underlying basic operator and it is defined as the minimum number of operations that need to be applied to one candidate solution for transforming it into another one. For operations on candidate solutions that are represented by permutations, in almost all researches on search landscape analysis surrogate distance measures are applied, although efficient algorithms exist in many cases for computing the exact distances. This discrepancy is probably due to the fact that these efficient algorithms are not very widely known. In this article, we review algorithms for computing distances on permutations for the most widely applied operators and present simulation results that compare the exact distances to commonly used approximations.