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 template-based adaptive large neighborhood search for the consistent vehicle routing problem
• A hybrid simulated annealing for capacitated vehicle routing problems with the independent route length
• A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows
• Parallel-machine scheduling to minimize makespan with fuzzy processing times and learning effects
• Search with evolutionary ruin and stochastic rebuild: a theoretic framework and a case study on exam timetabling
• A heuristic two-phase solution approach for the multi-objective dial-a-ride problem
• Using simulated annealing to schedule a flowshop manufacturing cell with sequence-dependent family setup times
• Heuristic unidirectional flowpath design approaches for automated guided vehicle systems
• A simulated annealing algorithm for allocating space to manufacturing cells
• CLASS: Computerized LAyout Solutions using Simulated annealing
• Level scheduling of mixed-model assembly lines under storage constraints
• An extended likelihood framework for modelling discretely observed credit rating transitions
• Genetic algorithms and applications to finance
• Large neighborhood search for the pickup and delivery traveling salesman problem with multiple stacks
• Coulomb, Landau and maximally abelian gauge fixing in lattice QCD with multi-gpus
• Proposal of a checking parameter in the simulated annealing method applied to the spin Glass model
• Stratified sampling for the Ising model: A graph-theoretic approach
• A new hybrid differential evolution with simulated annealing and self-adaptive immune operation
• Optimizing mining complexes with multiple processing and transportation alternatives: an uncertainty-based approach
• Resource allocation in multi-class dynamic PERT networks with finite capacity
• A simulated annealing for multi-criteria network path problems
• Single machine group scheduling with family setups to minimize total tardiness
• Permutation flow shop scheduling with order acceptance and weighted tardiness
• Optimizing reserve capacity of urban road networks in a discrete network design problem
• Cyclic-order neighborhoods with application to the vehicle routing problem with stochastic demand
• A graph-pair representation and MIP-model-based heuristic for the unequal-area facility layout problem
• A survey on optimization metaheuristics
• Design of automated negotiation mechanisms for decentralized heterogeneous machine scheduling
• Joint optimal determination of process mean, production quantity, pricing, and market segmentation with demand leakage
• Classical simulated annealing using quantum analogues
• A two-stage solution method for the annual dairy transportation problem
• Hybrid metaheuristics for the accessibility windows assembly line balancing problem level 2 (AWALBP-L2)
• Meta-heuristics for placing strategic safety stock in multi-echelon inventory with differentiated service times
• Parallel ant colony optimization for resource constrained job scheduling
• Optimizing of bullwhip effect and net stock amplification in three-echelon supply chains using evolutionary multi-objective metaheuristics
• A memetic algorithm for the capacitated location-routing problem with mixed backhauls
• Hybrid bee colony optimization for examination timetabling problems
• Two-agent singe-machine scheduling with release times to minimize the total weighted completion time
• A hybridized Lagrangian relaxation and simulated annealing method for the course timetabling problem
• A new capacitated vehicle routing problem with split service for minimizing fleet cost by simulated annealing
• Using simulated annealing to optimize the feature selection problem in marketing applications
• Design of multiplier-less nonuniform filter bank transmultiplexer using genetic algorithm
• Bi-objective resource-constrained project scheduling with robustness and makespan criteria
• A methodology for developing Bayesian networks: an application to information technology (IT) implementation
• ACFlow: an open source toolkit for analytic continuation of quantum Monte Carlo data
• Methods for the one-dimensional space allocation problem
• A global optimization heuristic for estimating agent based models
• A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria
• Biological invasions: Deriving the regions at risk from partial measurements
• Metaheuristics for scheduling a non-permutation flowline manufacturing cell with sequence dependent family setup times
• Good solutions to discrete noxious location problems via metaheuristics
• A new class of hybrid global optimization algorithms for peptide structure prediction: integrated hybrids
• A two-machine flowshop problem with two agents
• Simulation-based optimization for discharge/loading operations at a maritime container terminal
• An ALNS-based matheuristic algorithm for a multi-product many-to-many maritime inventory routing problem
• Optimization of red blood cell inventory: a blood‐type compatibility‐preference and emergency model
• Competitive facility location on decentralized supply chains
• DSS for multiobjective project scheduling
• Hybridizing exact methods and metaheuristics: a taxonomy
• Decreasing energy functions as a tool for studying threshold networks
• A model for designing callable bonds and its solution using tabu search
• Simulated annealing for complex portfolio selection problems.
• Heuristics for cardinality constrained portfolio optimization
• Multivariate methods using mixtures: correspondence analysis, scaling and pattern-detection
• Global optimization requires global information
• The obnoxious \(p\) facility network location problem with facility interaction
• Interactive analysis of multiple-criteria project scheduling problems
• Routeing winter gritting vehicles
• Simulated annealing: Practice versus theory
• Job-shop scheduling: Computational study of local search and large-step optimization methods
• Product line selection and pricing under a share-of-surplus choice model.
• Applying the threshold accepting metaheuristic to~curriculum based course timetabling
• The over-constrained airport gate assignment problem
• Metaheuristics -- the metaphor exposed
• Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches
• Some new results on simulated annealing applied to the job shop scheduling problem
• Semi-greedy heuristics: An empirical study
• A multipopulation cultural algorithm for the electrical generator scheduling problem
• Cardinality versus \(q\)-norm constraints for index tracking
• Comparison of metaheuristic algorithms for examination timetabling problem
• Metaheuristics: A bibliography
• Mid-term and short-term planning support for home health care services
• Two personification strategies for solving circles packing problem
• Heuristics for an assembly flow-shop with non-identical assembly machines and sequence dependent setup times to minimize sum of holding and delay costs
• Determining semantic valences of ontology concepts by means of nonnegative factorization of tensors of large text corpora
• Variable neighbourhood search for the minimum labelling Steiner tree problem
• Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
• Routing and scheduling in a flexible job shop by tabu search
• A tutorial on adaptive design optimization
• Designing a sustainable closed-loop supply chain network based on triple bottom line approach: a comparison of metaheuristics hybridization techniques
• Tabu-enhanced iterated greedy algorithm: a case study in the quadratic multiple knapsack problem
• A critical-shaking neighborhood search for the yard allocation problem
• A multi-attribute extension of the secretary problem: theory and experiments
• Optimal batting orders in one-day cricket
• A dynamic clustering based differential evolution algorithm for global optimization
• A very fast TS/SA algorithm for the job shop scheduling problem
• An effective hybrid algorithm for the problem of packing circles into a larger containing circle
• Derivative-free optimization: a review of algorithms and comparison of software implementations
• Solving a real-life, large-scale energy management problem
• Optimization of transit route network, vehicle headways and timetables for large-scale transit networks

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)