Revisiting simulated annealing: a component-based analysis
From MaRDI portal
Publication:1725612
DOI10.1016/j.cor.2018.12.015zbMath1458.90646OpenAlexW2903754058WikidataQ128777729 ScholiaQ128777729MaRDI QIDQ1725612
Thomas Stützle, Alberto Franzin
Publication date: 14 February 2019
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://dipot.ulb.ac.be/dspace/bitstream/2013/283834/5/sa.pdf
metaheuristicssimulated annealingexperimental analysisstochastic local searchautomatic algorithm design
Numerical mathematical programming methods (65K05) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
A landscape-based analysis of fixed temperature and simulated annealing, Two-stage multi-neighborhood simulated annealing for uncapacitated examination timetabling, Minimum penalty perturbation heuristics for curriculum-based timetables subject to multiple disruptions, Capping methods for the automatic configuration of optimization algorithms, Task design in complex crowdsourcing experiments: item assignment optimization, Exposing the grey wolf, moth‐flame, whale, firefly, bat, and antlion algorithms: six misleading optimization techniques inspired by bestial metaphors, A signomial programming-based approach for multi-echelon supply chain disruption risk assessment with robust dynamic Bayesian network, Evaluating the impact of grammar complexity in automatic algorithm design, Adaptive large variable neighborhood search for a multiperiod vehicle and technician routing problem, Fixed set search applied to the clique partitioning problem, Multi-neighborhood simulated annealing for the minimum interference frequency assignment problem, Simulated annealing is a polynomial-time approximation scheme for the minimum spanning tree problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- New hard benchmark for flowshop scheduling problems minimising makespan
- 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
- Comparative performance of tabu search and simulated annealing heuristics for the quadratic assignment problem
- An improved annealing scheme for the QAP
- Algorithms for the maximum satisfiability problem
- Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
- A thermodynamically motivated simulation procedure for combinatorial optimization problems
- The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem
- Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
- Modified simulated annealing algorithms for the flow shop sequencing problem
- New optimization heuristics. The great deluge algorithm and the record- to-record travel
- Simulated annealing - to cool or not
- Simulated annealing and tabu search in the long run: A comparison on QAP tasks
- QAPLIB - a quadratic assignment problem library
- The quadratic assignment problem. Theory and algorithms
- Simulated annealing for manufacturing systems layout design
- An introduction to MCMC for machine learning
- On the convergence of generalized hill climbing algorithms
- The late acceptance hill-climbing heuristic
- 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
- Automatically improving the anytime behaviour of optimisation algorithms
- Breakout local search for the quadratic assignment problem
- Benchmarks for basic scheduling problems
- Integrating and accelerating tabu search, simulated annealing, and genetic algorithms
- A unified ant colony optimization algorithm for continuous optimization
- SATenstein: automatically building local search SAT solvers from components
- Analysis of finite length annealing schedules
- Simulated Annealing With An Optimal Fixed Temperature
- Three Ideas for the Quadratic Assignment Problem
- Assignment Problems and the Location of Economic Activities
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
- ParamILS: An Automatic Algorithm Configuration Framework
- Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
- Convergence of an annealing algorithm
- Generalized Simulated Annealing for Function Optimization
- Cooling Schedules for Optimal Annealing
- Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
- A simulated annealing algorithm for allocating space to manufacturing cells
- CLASS: Computerized LAyout Solutions using Simulated annealing
- Large Cliques Elude the Metropolis Process
- The Complexity of Flowshop and Jobshop Scheduling
- Comparison of iterative searches for the quadratic assignment problem
- The Theory and Practice of Simulated Annealing
- Simulated Annealing: Searching for an Optimal Temperature Schedule
- Old Bachelor Acceptance: A New Class of Non-Monotone Threshold Accepting Methods
- Equation of State Calculations by Fast Computing Machines
- Metaheuristics—the metaphor exposed
- Manufacturing Scheduling Systems
- Techniques for Producing School Timetables on a Computer and their Application to other Scheduling Problems
- Scheduling
- Handbook of metaheuristics
- Random forests
