A review of metrics on permutations for search landscape analysis
From MaRDI portal
Publication:878593
DOI10.1016/J.COR.2005.11.022zbMATH Open1185.90115OpenAlexW2063894623MaRDI QIDQ878593FDOQ878593
Authors: Tommaso Schiavinotto, Thomas Stützle 
Publication date: 26 April 2007
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2005.11.022
Recommendations
permutationsdistancemetricsperformance of stochastic local search algorithmssearch landscape analysis
Approximation methods and heuristics in mathematical programming (90C59) Search theory (90B40) Stochastic programming (90C15)
Cites Work
- Introduction to algorithms
- Problem difficulty for tabu search in job-shop scheduling
- Preserving order in a forest in less than logarithmic time and linear space
- Combinatorial landscapes
- Stochastic local search. Foundations and applications.
- Contrasting structured and random permutation flow-shop scheduling problems: search-space topology and algorithm performance
- Enumerating longest increasing subsequences and patience sorting
- Title not available (Why is that?)
- A new adaptive multi-start technique for combinatorial global optimizations
- Landscapes, operators and heuristic search
- Title not available (Why is that?)
- Correlated and uncorrelated fitness landscapes and how to tell the difference
- The analysis of evolutionary algorithms on sorting and shortest paths problems
- Sorting circular permutations by reversal.
- A simpler 1.5-approximation algorithm for sorting by transpositions
- Title not available (Why is that?)
- Sorting by bounded block-moves
- Sorting by short block-moves
- Title not available (Why is that?)
- The complexity of finding minimum-length generator sequences
- An algorithm for the determination of longest increasing subsequence in a sequence
- Complex systems and binary networks. Guanajuato lectures held at Guanajuato, México, 16-22 January 1995
- Sorting permutations by reversals through branch-and-price
Cited In (27)
- A review of distances for the Mallows and generalized Mallows estimation of distribution algorithms
- Title not available (Why is that?)
- An enhanced differential evolution algorithm with fast evaluating strategies for TWT-NFSP with SSTs and RTs
- Fast robust optimization using bias correction applied to the mean model
- Variable neighborhood algebraic differential evolution: an application to the linear ordering problem with cumulative costs
- A GRASP with evolutionary path relinking for the truck and trailer routing problem
- Mallows and generalized Mallows model for matchings
- Clusters of non-dominated solutions in multiobjective combinatorial optimization: an experimental analysis
- In and out forests on combinatorial landscapes
- The effect of the asymmetry of road transportation networks on the traveling salesman problem
- A hybrid DBH-VNS for high-end equipment production scheduling with machine failures and preventive maintenance activities
- Coarse-Graining Large Search Landscapes Using Massive Edge Collapse
- An experimental comparison of algebraic crossover operators for permutation problems
- An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers
- Taking advantage of a diverse set of efficient production schedules: a two-step approach for scheduling with side concerns
- Discovering the suitability of optimisation algorithms by learning from evolved instances
- Landscape properties of the very large-scale and the variable neighborhood search metaheuristics for the multidimensional assignment problem
- Finding Antimagic Labelings of Trees by Evolutionary Search
- Measuring instance difficulty for combinatorial optimization problems
- Emergence of new local search algorithms with neuro-evolution
- Aggregation over metric spaces: proposing and voting in elections, budgeting, and legislation
- A two-stage flow-shop scheduling problem with incompatible job families and limited waiting time
- A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems
- Fitness landscape analysis and metaheuristics efficiency
- A data-driven \textit{meta}-learning recommendation model for multi-mode resource constrained project scheduling problem
- Sorting on graphs by adjacent swaps using permutation groups
- Fitness landscape analysis for the no-wait flow-shop scheduling problem
Uses Software
This page was built for publication: A review of metrics on permutations for search landscape analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q878593)
