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)

• Heuristics for the facility location and design \((1|1)\)-centroid problem on the plane
• Beam-ACO for the travelling salesman problem with time windows
• Scheduling just-in-time part supply for mixed-model assembly lines
• Facility location with tree topology and radial distance constraints
• Two new algorithms for UMTS access network topology design
• An improved simulated annealing algorithm for bandwidth minimization
• Global and local real-coded genetic algorithms based on parent-centric crossover operators
• An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem
• Local search algorithms for political districting
• A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints
• An investigation of mating and population maintenance strategies in hybrid genetic heuristics for product line designs
• Genetic local search for multi-objective flowshop scheduling problems
• A quantum inspired gravitational search algorithm for numerical function optimization
• Selecting machines and buffers in unreliable series-parallel production lines
• Production/distribution system design with inventory considerations
• Interacting particle systems in time-dependent geometries
• A genetic algorithm methodology for complex scheduling problems
• A nested simulated annealing algorithm
• Heuristic algorithms for the maximum diversity problem
• Hybrid simulated annealing and direct search method for nonlinear unconstrained global optimization
• Parameter estimation for chaotic systems using a hybrid adaptive cuckoo search with simulated annealing algorithm
• Linguistic-based meta-heuristic optimization model for flexible job shop scheduling
• Single‐machine scheduling problem with resource dependent release dates to minimise total resource‐consumption
• Do multipartite correlations speed up adiabatic quantum computation or quantum annealing?
• Computing the maximum violation of a Bell inequality is an NP-problem
• Aerodynamic shape optimization in aeronautics: a fast and effective multi-objective approach
• Minimizing variable selection criteria by Markov chain Monte Carlo
• Cooperative twin-crane scheduling
• Monte Carlo methods used in inverted hexagonal lipid phase and in simulations of thermally fluctuating lipid vesicles
• A scheduling problem in blocking hybrid flow shop robotic cells with multiple robots
• Applying two efficient hybrid heuristics for hub location problem with fully interconnected backbone and access networks
• Makespan minimization flowshop with position dependent job processing times -- computational complexity and solution algorithms
• Minimising maximum response time
• Effect of solution representations on tabu search in scheduling applications
• A hybrid vendor managed inventory and redundancy allocation optimization problem in supply chain management: an NSGA-II with tuned parameters
• Nested simulated annealing approach to periodic routing problem of a retail distribution system
• A global optimisation approach for parameter estimation of a mixture of double Pareto lognormal and lognormal distributions
• A bi-objective integrated procurement, production, and distribution problem of a multi-echelon supply chain network design: a new tuned MOEA
• Combining simulated annealing with Lagrangian relaxation and weighted Dantzig-Wolfe decomposition for integrated design decisions in wireless sensor networks
• A simulated annealing heuristic for the open location-routing problem
• Hybrid approach for buffer allocation in open serial production lines
• Stochastic resource allocation using a predictor-based heuristic for optimization via simulation
• Heuristics and simulated annealing procedures for the accessibility windows assembly line problem level 1 (AWALBP-L1)
• Variable neighborhood search based algorithms for high school timetabling
• Simulation-based optimization for housekeeping in a container transshipment terminal
• BIM-enabled structural design: impacts and future developments in structural modelling, analysis and optimisation processes
• Fast machine reassignment
• Simulated annealing for the machine reassignment problem
• Variable selection by ensembles for the Cox model
• Multi-neighborhood local search optimization for machine reassignment problem
• A PERCENTILE SEARCH HEURISTIC FOR GENERALIZED ASSIGNMENT PROBLEMS WITH A VERY LARGE NUMBER OF JOBS
• On single processor scheduling problems with learning dependent on the number of processed jobs
• A new class of hybrid global optimization algorithms for peptide structure prediction: integrated hybrids
• A general VNS heuristic for the traveling salesman problem with time windows
• Quantum annealing of the graph coloring problem
• Experiments on the minimum linear arrangement problem
• Simulated annealing for financing cost distribution based project payment scheduling from a joint perspective
• Computing sparse representation in a highly coherent dictionary based on difference of \(L_1\) and \(L_2\)
• Cooperation in the snowdrift game on directed small-world networks under self-questioning and noisy conditions
• Two-agent scheduling with position-based deteriorating jobs and learning effects
• Computing the viability kernel in large state dimension
• Cellular network configuration with co-channel and adjacent-channel interference constraints
• Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem
• Why adiabatic quantum annealing is unlikely to yield speed-up
• A real coded genetic algorithm for solving integer and mixed integer optimization problems
• A robust and efficient algorithm for planar competitive location problems
• Algodesk: An experimental comparison of eight evolutionary heuristics applied to the quadratic assignment problem
• Bayesian approach to global optimization and application to multiobjective and constrained problems
• Global optimization and simulated annealing
• Nested annealing: A provable improvement to simulated annealing
• Genetic algorithms, function optimization, and facility layout design
• Global optimization methods for multimodal inverse problems
• Nonlinear integer programming by Darwin and Boltzmann mixed strategy
• Application of the simulated annealing algorithm to the combinatorial optimization problem with permutation property: An investigation of generation mechanism
• Terminal repeller unconstrained subenergy tunneling (TRUST) for fast global optimization
• Simulated annealing and tabu search in the long run: A comparison on QAP tasks
• Multiple-type, two-dimensional bin packing problems: Applications and algorithms
• Guidelines for the use of meta-heuristics in combinatorial optimization.
• Solving the continuous flow-shop scheduling problem by metaheuristics.
• The optimal packing of arbitrarily-shaped polygons using simulated annealing and polynomial-time cooling schedules
• A model and methodologies for the location problem with logistical components
• Annealed replication: A new heuristic for the maximum clique problem
• A quality and distance guided hybrid algorithm for the vertex separator problem
• A three-phase algorithm for flowshop scheduling with blocking to minimize makespan
• Active guided evolution strategies for large-scale vehicle routing problems with time windows
• Hybrid heuristics for examination timetabling problem
• Two simulated annealing-based heuristics for the job shop scheduling problem
• The concave cost supply problem.
• Quantum stochastic optimization
• Hybrid metaheuristics: an introduction
• A weighted difference of anisotropic and isotropic total variation model for image processing
• Minimization of \(\ell_{1-2}\) for compressed sensing
• Application of chaos in simulated annealing
• Easily searched encodings for number partitioning
• Genetic algorithms for the traveling salesman problem
• A stone resource assignment model under the fuzzy environment
• Simulated annealing algorithms for continuous global optimization: Convergence conditions
• Modeling and solving the uncapacitated \(r\)-allocation \(p\)-hub median problem under congestion
• Rescheduling problems with allowing for the unexpected new jobs arrival
• Clustering as a dual problem to colouring

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)