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)

• Title not available (Why is that?)
• Neuronized Priors for Bayesian Sparse Linear Regression
• Optimisation of gravity-fed water distribution network design: a critical review
• Local stationarity in small area estimation models
• ParadisEO-MO: from fitness landscape analysis to efficient local search algorithms
• A rolling optimisation model of the UK natural gas market
• Solving the \(p\)-hub median problem under intentional disruptions using simulated annealing
• Sidelobe level reduction in linear array pattern synthesis using particle swarm optimization
• A comparison of general-purpose optimization algorithms for finding optimal approximate experimental designs
• DSLC-FOA: improved fruit fly optimization algorithm for application to structural engineering design optimization problems
• Scheduling of unrelated parallel manufacturing cells with limited human resources
• Statistical mechanics of neocortical interactions: training and testing canonical momenta indicators of EEG
• Cofolga: a genetic algorithm for finding the common folding of two RNAs
• Constraint programming and local search heuristic: a matheuristic approach for routing and scheduling feeder vessels in multi-terminal ports
• KGSA: a gravitational search algorithm for multimodal optimization based on K-means niching technique and a novel elitism strategy
• Bayesian non-parametric simultaneous quantile regression for complete and grid data
• A hybrid setup for a hybrid scenario: combining heuristics for the home health care problem
• The linear ordering problem: instances, search space analysis and algorithms
• Selective inference for latent block models
• An Invitation to Sequential Monte Carlo Samplers
• The generation of random equilateral polygons
• A threshold accepting approach to the Open Vehicle Routing problem
• Solving irregular strip packing problems by hybridising simulated annealing and linear program\-ming
• Traveling solitary waves for doubly-resonant media: computation via simulated annealing
• Applying the attribute based hill climber heuristic to the vehicle routing problem
• Pseudo-Boolean optimization
• The SIMCLAS model: simultaneous analysis of coupled binary data matrices with noise heterogeneity between and within data blocks
• Selected topics on assignment problems
• Simulation optimization: a review of algorithms and applications
• A genetic algorithm for the problem of configuring a hub-and-spoke network for a LTL trucking company in Brazil
• Honey badger algorithm: new metaheuristic algorithm for solving optimization problems
• Allocation search methods for a generalized class of location-allocation problems
• Complex networks: structure and dynamics
• A hybrid evolution strategy for the open vehicle routing problem
• Learning in noise: dynamic decision-making in a variable environment
• Simulated annealing via Sobolev inequalities
• A new meta-heuristic algorithm for continuous engineering optimization: harmony search theory and practice
• Future paths for integer programming and links to artificial intelligence
• Computing the minimum covariance determinant estimator (MCD) by simulated annealing
• Variable neighborhood tabu search and its application to the median cycle problem.
• On an approximate optimality criterion for the design of field experiments under spatial dependence
• Locating service facilities whose reliability is distance dependent.
• A method to reduce the rejection rate in Monte Carlo Markov chains
• Computational advances for and from Bayesian analysis
• A theoretical framework for simulated annealing
• Small-world MCMC and convergence to multi-modal distributions: from slow mixing to fast mixing
• Modelling the Spread in Space and Time of An Airborne Plant Disease
• A dynamic programming approach to efficient sampling from Boltzmann distributions
• Colloquium: Quantum annealing and analog quantum computation
• Understanding cyclical thrombocytopenia: a mathematical modeling approach
• A multi-start local search algorithm for the vehicle routing problem with time windows
• Black-box search by unbiased variation
• Effective loading in combined vehicle routing and container loading problems
• Simulated annealing: An initial application in econometrics
• Egonet: A Genetic Algorithm Model For The Optimisation Of Telephone Networks
• GSA: A gravitational search algorithm
• Complexities and algorithms for synchronized scheduling of parallel machine assembly and air transportation in consumer electronics supply chain
• A survey of local search methods for graph coloring
• Deconstructing Nowicki and Smutnicki's \(i\)-TSAB tabu search algorithm for the job-shop scheduling problem
• Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
• The multiobjective equilibrium network design problem revisited: A simulated annealing approach
• Ant colony optimization theory: a survey
• Heuristics for urban road network design: lane layout and signal settings
• Analysis of finite length annealing schedules
• Application of imperialist competitive algorithm to find minimax and standardized maximin optimal designs
• Simulated annealing in convex bodies and an \(O^{*}(n^{4}\)) volume algorithm
• Automated reverse engineering of nonlinear dynamical systems
• Heuristics for the maximum outerplanar subgraph problem
• Title not available (Why is that?)
• On the identifiability of Bayesian factor analytic models
• A differential evolution algorithm for finding the median ranking under the Kemeny axiomatic approach
• BGSA: Binary gravitational search algorithm
• \texttt{XtalOpt}: an open-source evolutionary algorithm for crystal structure prediction
• Global optimization of statistical functions with simulated annealing
• LGMS-FOA: an improved fruit fly optimization algorithm for solving optimization problems
• A library of local search heuristics for the vehicle routing problem
• MinFinder: locating all the local minima of a function
• FEADS: a framework for exploring the application design space on network processors
• Structure-based hyperparameter selection with Bayesian optimization in multidimensional scaling
• ROptimus
• EmiR
• Sampling Algorithms for Discrete Markov Random Fields and Related Graphical Models
• HEPAPS: A PCB automatic placement system
• A defensive maximal covering problem on a network
• A Monte Carlo simulated annealing approach to optimization over continuous variables
• Convergence of an annealing algorithm
• Random-link matching problems on random regular graphs
• Reconstruction of polycrystalline structures: a new application of combinatorial optimization
• Robust designs for binary data: applications of simulated annealing
• Combinatorial optimization and small polytopes
• Optimised simulated annealing for Ising spin glasses
• Fitting ordinary differential equations to short time course data
• \(\alpha BB\): A global optimization method for general constrained nonconvex problems
• Extraction of analytical potential function parameters from ab initio potential energy surfaces and analytical forces.
• Irreversible Monte Carlo algorithms for efficient sampling
• Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: A survey of the state-of-the-art
• MDPCluster: a swarm-based community detection algorithm in large-scale graphs
• A variational inference for the Lévy adaptive regression with multiple kernels
• Parsimonious phylogenetic trees in metric spaces and simulated annealing
• Some simple algorithms for structural comparison

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)