A systematic procedure for setting parameters in simulated annealing algorithms
From MaRDI portal
Publication:1389193
DOI10.1016/S0305-0548(97)00054-3zbMath0904.90142OpenAlexW2087301741WikidataQ127443698 ScholiaQ127443698MaRDI QIDQ1389193
Publication date: 11 June 1998
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0305-0548(97)00054-3
simulated annealingsimplex methodgraph partitioningpermutation flowshop schedulingshort-term production scheduling
Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)
Related Items
A simulated annealing algorithm for the restricted stochastic traveling salesman problem with exponentially distributed arc lengths ⋮ 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 ⋮ Bottleneck machine identification method based on constraint transformation for job shop scheduling with genetic algorithm ⋮ 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
Cites Work
- Optimization by Simulated Annealing
- An improved annealing scheme for the QAP
- Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
- The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem
- Simulated annealing: A tool for operational research
- A note on the effect of neighborhood structure in simulated annealing
- Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process
- Simulated annealing and genetic algorithms for scheduling products with multi-level product structure
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
- Convergence of an annealing algorithm
- Simulated annealing methods with general acceptance probabilities
- Job Shop Scheduling by Simulated Annealing
- Sequential Application of Simplex Designs in Optimisation and Evolutionary Operation
This page was built for publication: A systematic procedure for setting parameters in simulated annealing algorithms
