A landscape-based analysis of fixed temperature and simulated annealing
From MaRDI portal
Publication:2171587
Recommendations
Cites work
- A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime
- A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation
- An adaptive Metropolis algorithm
- An improved annealing scheme for the QAP
- Analysis of static simulated annealing algorithms
- Approximation algorithms for NP-hard problems.
- Assignment Problems and the Location of Economic Activities
- Automata, Languages and Programming
- Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems
- Benchmarks for basic scheduling problems
- Comparison of iterative searches for the quadratic assignment problem
- Computing in combinatorial optimization
- Contrasting structured and random permutation flow-shop scheduling problems: search-space topology and algorithm performance
- Convergence of an annealing algorithm
- Cooling Schedules for Optimal Annealing
- Effect of transformations of numerical parameters in automatic algorithm configuration
- Equation of state calculations by fast computing machines
- Handbook of heuristics
- scientific article; zbMATH DE number 1302195 (Why is no real title available?)
- Local search methods for the flowshop scheduling problem with flowtime minimization
- Manufacturing Scheduling Systems
- On the convergence of generalized hill climbing algorithms
- On the use of fitness landscape features in meta-learning based algorithm selection for the quadratic assignment problem
- Optimization by simulated annealing
- Optimizing heuristic search in forest planning
- QAPLIB - a quadratic assignment problem library
- Rapid determination of the critical temperature in simulated annealing inversion
- Revisiting simulated annealing: a component-based analysis
- Scheduling. Theory, algorithms, and systems.
- Simulated annealing - to cool or not
- Simulated annealing versus Metropolis for a TSP instance
- Simulated annealing with an optimal fixed temperature
- Simulated Annealing: Searching for an Optimal Temperature Schedule
- Stochastic local search. Foundations and applications.
- Tabu search vs. simulated annealing as a function of the size of quadratic assignment problem instances
- The Complexity of Flowshop and Jobshop Scheduling
- The Metropolis algorithm for graph bisection
- Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
- Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
Cited in
(5)- scientific article; zbMATH DE number 828008 (Why is no real title available?)
- Re-use of samples in stochastic annealing
- On the integration of reinforcement learning and simulated annealing for the parallel batch scheduling problem with setups
- An integrated operating room and physician scheduling problem solved by a hybrid variable neighborhood search-based algorithm
- A causal framework for stochastic local search optimization algorithms
This page was built for publication: A landscape-based analysis of fixed temperature and simulated annealing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2171587)
