A landscape-based analysis of fixed temperature and simulated annealing
From MaRDI portal
Publication:2171587
DOI10.1016/j.ejor.2022.04.014OpenAlexW4223938514MaRDI QIDQ2171587
Alberto Franzin, Thomas Stützle
Publication date: 9 September 2022
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2022.04.014
metaheuristicssimulated annealingstochastic local searchautomatic algorithm configurationexploratory landscape analysis
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Tabu search vs. simulated annealing as a function of the size of quadratic assignment problem instances
- A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime
- Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems
- An improved annealing scheme for the QAP
- Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
- Optimizing heuristic search in forest planning
- Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
- Simulated annealing - to cool or not
- QAPLIB - a quadratic assignment problem library
- The Metropolis algorithm for graph bisection
- On the convergence of generalized hill climbing algorithms
- Effect of transformations of numerical parameters in automatic algorithm configuration
- Revisiting simulated annealing: a component-based analysis
- A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation
- Analysis of static simulated annealing algorithms
- Local search methods for the flowshop scheduling problem with flowtime minimization
- Computing in combinatorial optimization
- On the use of fitness landscape features in meta-learning based algorithm selection for the quadratic assignment problem
- Benchmarks for basic scheduling problems
- Simulated annealing versus Metropolis for a TSP instance
- Simulated Annealing With An Optimal Fixed Temperature
- Contrasting Structured and Random Permutation Flow-Shop Scheduling Problems: Search-Space Topology and Algorithm Performance
- Rapid Determination of the Critical Temperature in Simulated Annealing Inversion
- Assignment Problems and the Location of Economic Activities
- Handbook of Heuristics
- Convergence of an annealing algorithm
- Cooling Schedules for Optimal Annealing
- The Complexity of Flowshop and Jobshop Scheduling
- Comparison of iterative searches for the quadratic assignment problem
- Simulated Annealing: Searching for an Optimal Temperature Schedule
- Equation of State Calculations by Fast Computing Machines
- Manufacturing Scheduling Systems
- Automata, Languages and Programming
- Scheduling
- An adaptive Metropolis algorithm
