Optimization by simulated annealing

DOI10.1126/SCIENCE.220.4598.671zbMATH Open1225.90162OpenAlexW2024060531WikidataQ25939004 ScholiaQ25939004MaRDI QIDQ82025FDOQ82025

Authors: S. Kirkpatrick, C. D. Gelatt, M. P. Vecchi, Scott Kirkpatrick, C. D. Jun. Gelatt, M. P. Vecchi 

Publication date: 13 May 1983

Published in: Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1126/science.220.4598.671

Recommendations

• scientific article; zbMATH DE number 4048925
• scientific article; zbMATH DE number 4085427
• Using simulated annealing to solve routing and location problems
• Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
• Statistical mechanics: a general approach to combinatorial optimization

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Cited In (only showing first 100 items - show all)

• The behavior of the spectral gap under growing drift
• Production scheduling optimization algorithm for the hot rolling processes
• CHAOS SYNTHESIS BY MEANS OF EVOLUTIONARY ALGORITHMS
• Control of quantum phenomena: past, present and future
• Search performance improvement of particle swarm optimization by second best particle information
• Applying simulated annealing using different methods for the neighborhood search in forest planning problems
• Biogeography-based optimization for optimal job scheduling in cloud computing
• Efficient search and responsiveness trade-offs in a Markov chain model of evolution in dynamic environments
• In and out forests on combinatorial landscapes
• Analysing the effects of solution space connectivity with an effective metaheuristic for the course timetabling problem
• Clustered-gravitational search algorithm and its application in parameter optimization of a low noise amplifier
• Variable neighborhood search for location routing
• Magnetic charged system search: a new meta-heuristic algorithm for optimization
• Minimizing makespan for scheduling stochastic job shop with random breakdown
• Estimating the parameters of a Gompertz-type diffusion process by means of simulated annealing
• Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints
• Flowshop-scheduling problems with makespan criterion: a review
• Unified encoding for hyper-heuristics with application to bioinformatics
• Optimization problems with fixed volume constraints and stability results related to rearrangement classes
• The impact of initial evenness on biodiversity maintenance for a four-species \textit{in silico} bacterial community
• A three-phased local search approach for the clique partitioning problem
• Dynamic patient admission scheduling with operating room constraints, flexible horizons, and patient delays
• Late acceptance hill-climbing for high school timetabling
• Biologically plausible learning in neural networks: a lesson from bacterial chemotaxis
• A hyper-heuristic approach to sequencing by hybridization of DNA sequences
• Partitioned solution of an unsteady adjoint for strongly coupled fluid-structure interactions and application to parameter identification of a one-dimensional problem
• Vehicle routing with compartments: applications, modelling and heuristics
• Truck scheduling at zero-inventory cross docking terminals
• Scheduling flow shops using differential evolution algorithm
• Delivery strategies for blood products supplies
• Estimating the parameters of Weibull distribution using simulated annealing algorithm
• On the number of local minima for the multidimensional assignment problem
• Securing home health care in times of natural disasters
• A stochastic model related to the Richards-type growth curve. Estimation by means of simulated annealing and variable neighborhood search
• 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
• Experimental evaluation of simulated annealing algorithms for the time-cost trade-off problem
• Computer Go: An AI oriented survey
• Interval branch and bound with local sampling for constrained global optimization
• On the stability of the travelling salesman problem algorithm of Hopfield and Tank
• A decision support system for cyclic master surgery scheduling with multiple objectives
• A simulated annealing algorithm for maximum likelihood pedigree reconstruction
• The gravity \(p\)-median model
• A comparison of stochastic scheduling rules for maximizing project net present value
• Combinatorial aspects of construction of competition Dutch professional football leagues
• Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem
• Neighborhood search approaches to beam orientation optimization in intensity modulated radiation therapy treatment planning
• On the constructive orbit problem
• A survey on metaheuristics for stochastic combinatorial optimization
• Clustering qualitative data based on binary equivalence relations: neighborhood search heuristics for the clique partitioning problem
• Algorithmic challenges in computational molecular biophysics
• Algorithms for approximate graph matching
• The general lotsizing and scheduling problem
• A new extension of local search applied to the Dial-A-Ride problem
• The TSP phase transition
• Tutorial on maximum likelihood estimation
• Simplicial Manifolds, Bistellar Flips and a 16-Vertex Triangulation of the Poincaré Homology 3-Sphere
• A direct stochastic algorithm for global search
• Simultaneous lotsizing and scheduling on parallel machines
• Some experiments with simulated annealing techniques for packing problems
• Single-commodity vehicle routing problem with pickup and delivery service
• Simulated annealing for constrained global optimization
• A new adaptive multi-start technique for combinatorial global optimizations
• Solving a manpower scheduling problem for airline catering using metaheuristics
• A time-dependent metaheuristic algorithm for post enrolment-based course timetabling
• Development of a fuel consumption optimization model for the capacitated vehicle routing problem
• Local search and constraint programming for the post enrolment-based course timetabling problem
• Simulated annealing for optimal ship routing
• A large step random walk for minimizing total weighted tardiness in a job shop
• Constraint ordinal optimization
• Heuristic solution approaches to operational forest planning problems
• The late acceptance hill-climbing heuristic
• Bayesian variable selection in generalized linear models using a combination of stochastic optimization methods
• Truck scheduling in cross-docking terminals with fixed outbound departures
• A novel heuristic optimization method: charged system search
• Local Procrustes for manifold embedding: a measure of embedding quality and embedding algorithms
• Fuzzy programming for multiobjective job shop scheduling with fuzzy processing time and fuzzy duedate through genetic algorithms
• Simultaneous lotsizing and scheduling by combining local search with dual reoptimization
• Record breaking optimization results using the ruin and recreate principle
• An improved algorithm for the packing of unequal circles within a larger containing circle
• An effective quasi-human based heuristic for solving the rectangle packing problem
• Application of a mixed simulated annealing-genetic algorithm heuristic for the two-dimensional orthogonal packing problem
• Exact and heuristic procedures for solving the fuzzy portfolio selection problem
• The bi-objective pollution-routing problem
• A variable neighborhood search heuristic for periodic routing problems
• Dynamic capacitated lot-sizing problems: a classification and review of solution approaches
• Optimal search efficiency of Barker's algorithm with an exponential fitness function
• Investigating a hybrid simulated annealing and local search algorithm for constrained optimization
• The Runge phenomenon and spatially variable shape parameters in RBF interpolation
• Aggregating disparate estimates of chance
• Multiple crossdocks with inventory and time windows
• Directed drift: A new linear threshold algorithm for learning binary weights on-line
• Solving the maximum clique problem using a tabu search approach
• Variable neighborhood search for the dial-a-ride problem
• Algorithms for graph partitioning on the planted partition model
• Derivative-free filter simulated annealing method for constrained continuous global optimization
• Structures and properties of Ni nanowires
• Robust surgery loading
• Heuristics for a bidding problem
• Comparing evolutionary algorithms to the (\(1+1\))-EA

This page was built for publication: Optimization by simulated annealing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q82025)