A systematic procedure for setting parameters in simulated annealing algorithms
From MaRDI portal
Recommendations
- A parameter set design procedure for the simulated annealing algorithm under the computational time constraint
- scientific article; zbMATH DE number 4064384
- Simulated annealing: A tool for operational research
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
- scientific article; zbMATH DE number 906529
Cites work
- A note on the effect of neighborhood structure in simulated annealing
- An improved annealing scheme for the QAP
- Convergence of an annealing algorithm
- Job Shop Scheduling by Simulated Annealing
- Optimization by simulated annealing
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
- Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process
- Sequential Application of Simplex Designs in Optimisation and Evolutionary Operation
- Simulated annealing and genetic algorithms for scheduling products with multi-level product structure
- Simulated annealing methods with general acceptance probabilities
- Simulated annealing: A tool for operational research
- The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem
- Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
Cited in
(13)- A parameter set design procedure for the simulated annealing algorithm under the computational time constraint
- A performance comparison and evaluation of metaheuristics for a batch scheduling problem in a multi-hybrid cell manufacturing system with skilled workforce assignment
- The influence of problem specific neighborhood structures in metaheuristics performance
- Estimation of the parameters of the INDSCAL model using the simulated annealing model
- Downhill simplex methods for optimizing simulated annealing are effective
- Classification of Acceptance Criteria for the Simulated Annealing Algorithm
- Bottleneck machine identification method based on constraint transformation for job shop scheduling with genetic algorithm
- A simulated annealing algorithm for the restricted stochastic traveling salesman problem with exponentially distributed arc lengths
- Computational Science and Its Applications – ICCSA 2004
- Generating molecules with specific boiling points and melting points
- A simulated annealing based solution approach for the two-layered location registration and paging areas partitioning problem in cellular mobile networks
- Optimizing heuristic search in forest planning
- Heuristics for search sequencing under time-dependent probabilities of existence
This page was built for publication: A systematic procedure for setting parameters in simulated annealing algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1389193)
