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)

• A two-stage heuristic method for balancing mixed-model assembly lines with parallel workstations
• Adaptive rejection Metropolis simulated annealing for detecting global maximum regions
• Protein structure prediction using distributed parallel particle swarm optimization
• A modified real coded genetic algorithm for constrained optimization
• MCMC maximum likelihood for latent state models
• Improving the performance of metaheuristics: an approach combining response surface methodology and racing algorithms
• Global descent method for constrained continuous global optimization
• Heuristic solutions for the vehicle routing problem with time windows and synchronized visits
• SABR/LIBOR market models: pricing and calibration for some interest rate derivatives
• A discrete meta-control procedure for approximating solutions to binary programs
• An improved simulated annealing for solving the linear constrained optimization problems
• The \(p\)-median problem: a survey of metaheuristic approaches
• GOAL solver: a hybrid local search based solver for high school timetabling
• Fairness in academic course timetabling
• An adaptive large neighborhood search for a vehicle routing problem with multiple routes
• On the Behrens-Fisher problem: a globally convergent algorithm and a finite-sample study of the Wald, LR and LM tests
• A dual latent class unfolding model for two-way two-mode preference rating data
• Solving the truck and trailer routing problem based on a simulated annealing heuristic
• A multiparametric strategy for the two step optimization of structural assemblies
• Machine learning problems from optimization perspective
• Timetable construction: the algorithms and complexity perspective
• An effective hybrid optimization strategy for job-shop scheduling problems
• Variable neighborhood search: Principles and applications
• A review of planning and scheduling systems and methods for integrated steel production
• Low temperature asymptotics of spherical mean field spin glasses
• Discrete optimisation and fast correlation attacks
• An asynchronous decomposition approach to parallel global optimization
• Computational complexity of the landscape. I.
• Multilevel minimum cross entropy threshold selection based on particle swarm optimization
• Modeling staff scheduling problems. A tutorial
• Local search and lower bounds for the patient admission scheduling problem
• The neglected pillar of material computation
• Nonlocality in pure and mixed \(n\)-qubit \(X\) states
• A latent class multidimensional scaling model for two-way one-mode continuous rating dissimilarity data
• Optimal location with equitable loads
• Scheduling technicians and tasks in a telecommunications company
• Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
• A hybrid intelligent algorithm for portfolio selection problem with fuzzy returns
• Performance analysis of cyclical simulated annealing algorithms
• When it is worthwhile to work with the stochastic RCPSP?
• A filled function method applied to nonsmooth constrained global optimization
• A survey for the quadratic assignment problem
• Building cyclic master surgery schedules with leveled resulting bed occupancy
• The traveling salesman problem: An overview of exact and approximate algorithms
• A simulated annealing approach to the traveling tournament problem
• Locality and classicality: role of entropic inequalities
• A one-parameter filled function method applied to nonsmooth constrained global optimization
• On discrete inhomogeneous exit problems
• Robust optimization - a comprehensive survey
• How easy is local search?
• Approximate counting, uniform generation and rapidly mixing Markov chains
• On simultaneous optimisation of smart structures. I: Theory. II: Algorithms and examples
• Simulated minimum Hellinger distance estimation of stochastic volatility models
• Timetable construction with Markovian neural network
• The CHIC model: a global model for coupled binary data
• A genetic algorithm for flowshop sequencing
• The Metropolis algorithm for graph bisection
• Cost analysis of alternative formulations for personnel scheduling in continuously operating organizations
• Improvement heuristics for the vehicle routing problem based on simulated annealing
• Generating quasi-random sequences from semi-random sources
• Adaptive predictions of the Euro/Złoty currency exchange rate using state space wavelet networks and forecast combinations
• Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem
• Discrete-time semiclassical Szegedy quantum walks
• Computational optimization: an overview
• Symmetric quadrature rules on a triangle
• Surrogate time series.
• A novel hybrid differential evolution and particle swarm optimization algorithm for unconstrained optimization
• General local search methods
• Vendor managed inventory for environments with stochastic product usage
• Covering a rectangle with six and seven circles
• Monte Carlo hyper-heuristics for examination timetabling
• Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling
• Embedding a sequential procedure within an evolutionary algorithm for coloring problems in graphs
• Simulated annealing metaheuristics for the vehicle routing problem with time windows
• A possibilistic mean-semivariance-entropy model for multi-period portfolio selection with transaction costs
• From simulated annealing to stochastic continuation: a new trend in combinatorial optimization
• Very fast simulated re-annealing
• Global optimization by an improved differential evolutionary algorithm
• Spatial sampling design for parameter estimation of the covariance function
• Solving the multiple competitive facilities location problem
• A machine learning approach to algorithm selection for \(\mathcal{NP}\)-hard optimization problems: a case study on the MPE problem
• The designs of S-boxes by simulated annealing
• An effective hybrid PSOSA strategy for optimization and its application to parameter estimation
• Hybrid metaheuristics for the vehicle routing problem with stochastic demands
• ITC2007 solver description: a hybrid approach
• Balancing stochastic two-sided assembly lines: a chance-constrained, piecewise-linear, mixed integer program and a simulated annealing algorithm
• Heuristic algorithms for the cardinality constrained efficient frontier
• An efficient implementation of parallel simulated annealing algorithm in GPUs
• Solving the multi-objective nurse scheduling problem with a weighted cost function
• Data mining with a simulated annealing based fuzzy classification system
• A survey of metaheuristic-based techniques for university timetabling problems
• A simulated annealing and hill-climbing algorithm for the traveling tournament problem
• Neighborhood portfolio approach for local search applied to timetabling problems
• A new class of improved convex underestimators for twice continuously differentiable constrained NLPs
• A SA-VNS approach for the high school timetabling problem
• A Bayesian regression approach to terrain mapping and an application to legged robot locomotion
• Renormalization group for Markov chains and application to metastability
• Development of a hybrid metaheuristic to minimise earliness and tardiness in a hybrid flowshop with sequence-dependent setup times
• Adaptive Prediction of Stock Exchange Indices by State Space Wavelet Networks
• Solving large-scale uncapacitated facility location problems with evolutionary simulated annealing

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)