A review of metrics on permutations for search landscape analysis
From MaRDI portal
Publication:878593
DOI10.1016/j.cor.2005.11.022zbMath1185.90115OpenAlexW2063894623MaRDI QIDQ878593
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
permutationsdistancemetricsperformance of stochastic local search algorithmssearch landscape analysis
Stochastic programming (90C15) Search theory (90B40) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (26)
In and out forests on combinatorial landscapes ⋮ Sorting on graphs by adjacent swaps using permutation groups ⋮ A two-stage flow-shop scheduling problem with incompatible job families and limited waiting time ⋮ Taking advantage of a diverse set of efficient production schedules: a two-step approach for scheduling with side concerns ⋮ Fitness landscape analysis and metaheuristics efficiency ⋮ A review of distances for the Mallows and generalized Mallows estimation of distribution algorithms ⋮ Unnamed Item ⋮ Discovering the suitability of optimisation algorithms by learning from evolved instances ⋮ A data-driven \textit{meta}-learning recommendation model for multi-mode resource constrained project scheduling problem ⋮ 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 ⋮ A GRASP with evolutionary path relinking for the truck and trailer routing problem ⋮ A hybrid DBH-VNS for high-end equipment production scheduling with machine failures and preventive maintenance activities ⋮ An enhanced differential evolution algorithm with fast evaluating strategies for TWT-NFSP with SSTs and RTs ⋮ An Experimental Comparison of Algebraic Crossover Operators for Permutation Problems ⋮ Fast robust optimization using bias correction applied to the mean model ⋮ Coarse-Graining Large Search Landscapes Using Massive Edge Collapse ⋮ Mallows and generalized Mallows model for matchings ⋮ An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers ⋮ Fitness landscape analysis for the no-wait flow-shop scheduling problem ⋮ Variable neighborhood algebraic differential evolution: an application to the linear ordering problem with cumulative costs ⋮ Measuring instance difficulty for combinatorial optimization problems ⋮ The effect of the asymmetry of road transportation networks on the traveling salesman problem ⋮ A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems ⋮ Clusters of Non-dominated Solutions in Multiobjective Combinatorial Optimization: An Experimental Analysis ⋮ Aggregation over Metric Spaces: Proposing and Voting in Elections, Budgeting, and Legislation
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Enumerating longest increasing subsequences and patience sorting
- Problem difficulty for tabu search in job-shop scheduling
- Correlated and uncorrelated fitness landscapes and how to tell the difference
- The complexity of finding minimum-length generator sequences
- An algorithm for the determination of longest increasing subsequence in a sequence
- Preserving order in a forest in less than logarithmic time and linear space
- Sorting by bounded block-moves
- Landscapes, operators and heuristic search
- A new adaptive multi-start technique for combinatorial global optimizations
- Sorting by short block-moves
- The analysis of evolutionary algorithms on sorting and shortest paths problems
- Complex systems and binary networks. Guanajuato lectures held at Guanajuato, México, 16-22 January 1995
- Combinatorial Landscapes
- Sorting Permutations by Reversals Through Branch-and-Price
- Contrasting Structured and Random Permutation Flow-Shop Scheduling Problems: Search-Space Topology and Algorithm Performance
- A Simpler 1.5-Approximation Algorithm for Sorting by Transpositions
- Algorithms and Data Structures
This page was built for publication: A review of metrics on permutations for search landscape analysis
