Optimization by Simulated Annealing

DOI10.1126/science.220.4598.671zbMath1225.90162WikidataQ25939004 ScholiaQ25939004MaRDI QIDQ82025

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

Mathematics Subject Classification ID

90C59: Approximation methods and heuristics in mathematical programming

90C27: Combinatorial optimization

Related Items

Incorporating kin selection in simulated annealing algorithm and its performance evaluation, On the distance function approach to color image enhancement, On convergence of minimization methods: Attraction, repulsion, and selection, Simulated annealing with threshold accepting or Tsallis statistics, A heuristic to minimax absolute regret for linear programs with interval objective function coefficients, Determination of optimal path under approach and exit constraints, 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 heuristic methods for conformance test selection, Solving the multiple competitive facilities location problem, Algorithms of maximum likelihood data clustering with applications, Glassy behavior in neural network models of associative memory, A multipopulation cultural algorithm for the electrical generator scheduling problem, The time-dependent traveling salesman problem, An information-based neural approach to generic constraint satisfaction., Case injected genetic algorithms for traveling salesman problems, Reconstruction and segmentation of underwater acoustic images combining confidence information in MRF models, Annealed chaotic neural network with nonlinear self-feedback and its application to clustering problem, Structural pattern recognition using genetic algorithms, A hybrid global optimization method: The one-dimensional case, Threshold accepting as limit case for a modified Tsallis statistics, Extraction of analytical potential function parameters from ab initio potential energy surfaces and analytical forces., Optimization and self-organized criticality in a magnetic system, Genetic search over probability spaces, Application of a mixed simulated annealing-genetic algorithm heuristic for the two-dimensional orthogonal packing problem, A correlation and heuristic approach for obtaining production sequences requiring a minimum of tool replacements, Estimating the city-block two-dimensional scaling model with simulated annealing, Additive chaotic forcing scheme for determination of the global minimum of functions, Application of chaos in simulated annealing, MBMUDs: A combinatorial extension of BIBDs showing good optimality behaviour, On approximating weighted sums with exponentially many terms, A stochastic approach to global optimization of nonlinear programming problem with many equality constraints, Determinstic VLSI block placement algorithm using less flexibility first principle, Comparison of metaheuristic algorithms for examination timetabling problem, An intelligent control system with a multi-objective self-exploration process, A list-based compact representation for large decision tables management, An improved simulated annealing simulation optimization method for discrete parameter stochastic systems, Joint determination of machine cells and linear intercell layout, Adaptive temperature control for simulated annealing: a comparative study, Simulated annealing heuristics for managing resources during planned outages at electric power plants, Embedded local search approaches for routing optimization, A multi-start local search algorithm for the vehicle routing problem with time windows, An adaptive simulated annealing algorithm., An adaptive simulated annealing algorithm for global optimization over continuous variables, An analog Hopfield network to overcome excessive smoothing in shape from shading, Packing 16, 17 or 18 circles in an equilateral triangle, Determining functional relationships from trained neural networks, Some mathematical and computer modelling of neural networks, Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches, Strategies with memories: Local search in an application oriented environment. Applied local search -- a prologue, Local search with memory: Benchmarking RTS, Heuristic solution approaches to operational forest planning problems, A modification of threshold accepting and its application to the quadratic assignment problem, Open-loop simulations of the primate saccadic system using burst cell discharge from the superior colliculus, \(\alpha BB\): A global optimization method for general constrained nonconvex problems, Parallel genetic algorithms with local search, Easily searched encodings for number partitioning, Some directions and results of research in mathematical programming and system analysis, Continuous optimization by a variant of simulated annealing, Divide and conquer strategies for parallel TSP heuristics, Simulated annealing metaheuristics for the vehicle routing problem with time windows, Generalized speculative computation of parallel simulated annealing, Combining simulated annealing with local search heuristics, Focused simulated annealing search: An application to job shop scheduling, A comparison of two methods for solving 0-1 integer programs using a general purpose simulated annealing algorithm, The continuous reactive tabu search: Blending combinatorial optimization and stochastic search for global optimization, Tabu search for graph partitioning, Genetic algorithms for the traveling salesman problem, A comparison of local search methods for flow shop scheduling, Metaheuristics: A bibliography, Statistical mechanics of nonlinear nonequilibrium financial markets: Applications to optimized trading, Parallel local search, Embedding a sequential procedure within an evolutionary algorithm for coloring problems in graphs, The construction of antipodal triple systems by simulated annealing, Limited communication control, Reactive local search techniques for the maximum \(k\)-conjunctive constraint satisfaction problem \((MAX-k-CCSP)\), Towards long-term prediction, Covering a rectangle with six and seven circles, Critical phenomena in a collective computation algorithm for combinatorial optimization problems, Nonlinear optimization simplified by hypersurface deformation., A quantitative analysis of the simulated annealing algorithm: A case study for the traveling salesman problem., An improved annealing method and its large-time behavior, The method of global equilibrium search, Simultaneous lotsizing and scheduling by combining local search with dual reoptimization, Fuzzy programming for multiobjective job shop scheduling with fuzzy processing time and fuzzy duedate through genetic algorithms, On constrained simulation and optimization by Metropolis chains, A two-phased approach to the supply network reconfiguration problem, Simulated annealing algorithms for continuous global optimization: Convergence conditions, Two personification strategies for solving circles packing problem, Results of an experimental investigation of the efficiency of the global-equilibrium-search method, Record breaking optimization results using the ruin and recreate principle, Optimal experimental design for combinatorial problems, An application of mapping neural networks and a digital signal processor for cochlear neuroprostheses, Directed drift: A new linear threshold algorithm for learning binary weights on-line, An introduction to population approaches for optimization and hierarchical objective functions: A discussion on the role of tabu search, Routing and scheduling in a flexible job shop by tabu search, Tabu search for a class of scheduling problems, Solving the maximum clique problem using a tabu search approach, Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem, Multi-way graph partition by stochastic probe, Tutorial on maximum likelihood estimation, Evolutionary optimization and the estimation of search distributions with applications to graph bipartitioning., Computational abilities of a chaotic neural network, Computing elastic moduli of two-dimensional random networks of rigid and nonrigid bonds by simulated annealing, Simulated annealing for complex portfolio selection problems., Product line selection and pricing under a share-of-surplus choice model., Using global search heuristics for the capacity vehicle routing problem., A composite heuristic for the single machine early/tardy job scheduling problem., A local search template., Hysteretic optimization for the traveling salesman problem, Placement by thermodynamic simulated annealing, Guidelines for the use of meta-heuristics in combinatorial optimization., Variable neighborhood tabu search and its application to the median cycle problem., A variable neighborhood search for graph coloring., Solving the continuous flow-shop scheduling problem by metaheuristics., A simulated annealing approach for manufacturing cell formation with multiple identical machines., SSTT: Efficient local search for GSI global routing, A direct stochastic algorithm for global search, Improved algorithm for geometry optimisation using damped molecular dynamics, Optimization of real-time multiserver system with two different channels and shortage of maintenance facilities., FACOPT: A user friendly FACility layout OPTimization system., Locating service facilities whose reliability is distance dependent., A hybrid algorithm for identifying global and local minima when optimizing functions with many minima., A quadratic approximation for protein sequence to structure mapping., On robust control of uncertain chaotic systems: A sliding-mode synthesis via chaotic optimization, Experiments with new stochastic global optimization search techniques, Analysis of solution space-dependent performance of simulated annealing: The case of the multi-level capacitated lot sizing problem, On simultaneous optimisation of smart structures. I: Theory. II: Algorithms and examples, Convergence of the simulated annealing algorithm for continuous global optimization, A perspective on the foundation and evolution of the linkage learning genetic algorithms, Continuum structural topology design with genetic algorithms, Nature's way of optimizing, The discrete lot-sizing and scheduling problem: Complexity and modification for batch availability, The optimal packing of arbitrarily-shaped polygons using simulated annealing and polynomial-time cooling schedules, A large step random walk for minimizing total weighted tardiness in a job shop, Airline crew scheduling using Potts mean field techniques, Fast high precision decision rules for valuing manufacturing flexibility, Almost surely convergent global optimziation algorithm using noise-corrupted observations, Heuristics for cardinality constrained portfolio optimization, Surrogate time series., On the properties of the subsets of a discrete domain defined by the local optimae of a function endowed with some geometrical properties, A framework for structured quantum search., PhysComp96. Proceedings of the 4th workshop on physics and computation, Boston, MA, USA, November 22--24, 1996, A Lagrangian reconstruction of GENET, Identification of multilayered particles from scattering data by a clustering method., Local search algorithms for the multiprocessor flow shop scheduling problem, Techniques of replica symmetry breaking and the storage problem of the McCulloch-Pitts neuron, Method to solve the travelling salesman problem using the inverse of diffusion process, Modeling distributed concept representation in Hopfield neural networks., Real-time multiserver and multichannel systems with shortage of maintenance crews., The efficiency of hybrid mutation genetic algorithm for the travelling salesman problem., Statistical mechanics of financial markets: exponential modifications to Black-Scholes., A novel chaotic search for quadratic assignment problems, Stochastic tunneling minimization by molecular dynamics: an application to heteropolymer models, An experimental study about the search mechanism in the SLAVE learning algorithm: Hill-climbing methods versus genetic algorithms, A model and methodologies for the location problem with logistical components, Real-time system with homogeneous servers and nonidentical channels in steady-state, Simultaneous lotsizing and scheduling on parallel machines, Optimal annealing schedules for a modified Tsallis statistics, A random close packing based algorithm for the generation of continuous random networks, A note on global optimization in adaptive control, econometrics and macroeconomics., On the analysis of the \((1+1)\) evolutionary algorithm, The GST load balancing algorithm for parallel and distributed systems, Optimal exact experimental designs with correlated errors through a simulated annealing algorithm, Simulated annealing with a potential function with discontinuous gradient on \(\mathbb R^d\), Solution of large weighted equicut problems, An efficient tabu search approach for the 0-1 multidimensional knapsack problem, Simulated annealing for discrete optimization with estimation, Annealed replication: A new heuristic for the maximum clique problem, Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling, Active guided evolution strategies for large-scale vehicle routing problems with time windows, Computational advances for and from Bayesian analysis, Computational discovery of gene regulatory binding motifs: a Bayesian perspective, Simulated annealing and tabu search for multi-mode resource-constrained project scheduling with positive discounted cash flows and different payment models, Simplex sliding mode control for nonlinear uncertain systems via chaos optimization, The linear ordering problem: instances, search space analysis and algorithms, Hybrid heuristics for examination timetabling problem, Generalized extremal optimization: an application in heat pipe design, The over-constrained airport gate assignment problem, Analysis of random restart and iterated improvement for global optimization with application to the traveling salesman problem, A theoretical study on the behavior of simulated annealing leading to a new cooling schedule, Solution quality of random search methods for discrete stochastic optimization, Bounding the probability of success of stochastic methods for global optimization, A distributed genetic algorithm for deterministic and stochastic labor scheduling problems, Two simulated annealing-based heuristics for the job shop scheduling problem, Some new results on simulated annealing applied to the job shop scheduling problem, Formulating and solving production planning problems, Probabilistic local search algorithms for concave cost transportation network problems, Guided local search and its application to the traveling salesman problem, Adaptive schedules for ensemble-based threshold accepting, Constraint ordinal optimization, The concave cost supply problem., A parallel optimization approach for controlling allele diversity in conservation schemes, A genetic-based framework for solving (multi-criteria) weighted matching problems., On efficient use of simulated annealing in complex structural optimization problems, A hybrid global optimization method: The multi-dimensional case, Computational consequences of agreement and ambiguity in natural language, Combinatorial optimization and small polytopes, A study of subadmissible simulated annealing algorithms, Symmetric quadrature rules on a triangle, A tabu search approach to optimal structuring element extraction for mst- based shapes description, Decision tree design by simulated annealing, Mobile manipulator path planning by a genetic algorithm, An Improved Simulated Annealing Algorithm with Genetic Characteristics and the Traveling Salesman Problem, Logarithmic Sobolev inequalities and Langevin algorithms inRⁿ, Learning in Boltzmann Trees, Low autocorrelation binary sequences: exact enumeration and optimization by evolutionary strategies, Estimation of non-stationary spectra by simulated annealing, GLOBAL OPTIMIZATION STUDIES ON THE ID PHASE PROBLEM, A nested simulated annealing algorithm, Dynamic weighting in Monte Carlo and optimization, On the alleviation of the problem of local minima in back-propagation, Function evaluation with feedforward neural networks, Analytic constant thermodynamic speed-cooling strategies in simulated annealing, Quantitative measures for self-organizing topographic maps, Stochastic assembly line balancing using simulated annealing, Determining the number of kanbans and lotsizes in a generic kanban system: a simulated annealing approach, Heuristic algorithms for the maximum diversity problem, Determination of turret configuration and hit sequence for optimization of NC turret punch press operation, Fractional cell formation in group technology, A genetic algorithm for facility layout, Hybrid simulated annealing and direct search method for nonlinear unconstrained global optimization, Individual learning of coordination knowledge, Iterative Fourier transform algorithm: comparison of various approaches, Optimization of multipass turning operations with genetic algorithms, Design of manufacturing systems by a hybrid approach with neural network metamodelling and stochastic local search, Computing probability intervals with simulated annealing and probability trees, Parameter Estimation of Sigmoid Superpositions: Dynamical System Approach, A superior random number generator for visiting distribution in GSA, Comparative analysis of the cutting angle and simulated annealing methods in global optimization, Integrated design of the block layout and aisle structure by simulated annealing, Multicriteria facility layout problem: An integrated approach, On the number of local maxima in quadratic 0-1 programs, Global optimization for molecular conformation problems, The multiobjective equilibrium network design problem revisited: A simulated annealing approach, Spatial sampling design for parameter estimation of the covariance function, Layout design for flexible manufacturing systems considering single-loop directional flow patterns, Two new algorithms for UMTS access network topology design, An effective hybrid algorithm for the problem of packing circles into a larger containing circle, Multi-modal topological optimization of structure using immune algorithm, A novel technique of object ranking and classification under ignorance: an application to the corporate failure risk problem, Variable programming: a generalized minimax problem. II: Algorithms, Computing the minimum covariance determinant estimator (MCD) by simulated annealing, Simulated annealing and genetic algorithms for scheduling products with multi-level product structure, Multiple crossdocks with inventory and time windows, Generating efficient schedules for identical parallel machines involving flow-time and tardy jobs, Genetic local search for multi-objective flowshop scheduling problems, An investigation of mating and population maintenance strategies in hybrid genetic heuristics for product line designs, Hybrid ant systems for the dynamic facility layout problem, Hybrid meta-heuristics algorithms for task assignment in heterogeneous computing systems, Developing interval global optimzation algorithms on the basis of branch-and-bound and constraint propagation methods, Scatter search in software testing, comparison and collaboration with estimation of distribution algorithms, A simulated annealing applied for optimizing a voice-multihop radio network, A fuzzy vector quantization approach to image compression, A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows, Efficient hybrid methods for global continuous optimization based on simulated annealing, An asymptotical study of combinatorial optimization problems by means of statistical mechanics, Simulated annealing and object point processes: Tools for analysis of spatial patterns, Heuristics for the maximum outerplanar subgraph problem, Solving a dynamic cell formation problem using metaheuristics, A new class of improved convex underestimators for twice continuously differentiable constrained NLPs, Ant colony optimization theory: a survey, A multi-attribute extension of the secretary problem: theory and experiments, Optimal batting orders in one-day cricket, Unnamed Item, Unnamed Item, Unnamed Item, Solving optimisation problems using neucomp-a neural network compiler, OPTIMIZATION OF PRODUCTION PLANNING PROBLEMS — A CASE STUDY FOR ASSEMBLY LINES, Obtaining functional form for chaotic time series evolution using genetic algorithm, FINITE SIZE SCALING AND CRITICAL TRANSITION IN CONSTRAINED TRAVELING SALESMAN PROBLEM, Simplicial Manifolds, Bistellar Flips and a 16-Vertex Triangulation of the Poincaré Homology 3-Sphere, Localist Attractor Networks, Stochastic Organization of Output Codes in Multiclass Learning Problems, Resource allocation in a mobile telephone network: A constructive repair algorithm, Investigation of maintenance float problem using genetic algorithms, Random Embedding Machines for Pattern Recognition, Minimization of an energy function with robust features for image segmentation, Spatial patterns and scale freedom in Prisoner’s Dilemma cellular automata with Pavlovian strategies, Decoding a Temporal Population Code, Unnamed Item, Hierarchical algorithm for a partition problem using simulated annealing: application to placement in VLSI layout, The demon algorithm, A genetic approach for network partitioning, A simulated annealing algorithm for allocating space to manufacturing cells, CLASS: Computerized LAyout Solutions using Simulated annealing, Simulated annealing with extended neighbourhood, Simulated annealing: An initial application in econometrics, Spatial designs when the observations are correlated, Bayesian methods and optimal experimental design for gene mapping by radiation hybrids, GENETIC ALGORITHMS: WHAT FITNESS SCALING IS OPTIMAL?, On the resources allocation problem, Unnamed Item, Unnamed Item, Bayesian object matching, A new simulated annealing algorithm for the facility layout problem, A simulated annealing approach for optimization of multi-pass turning operations, Unnamed Item, Advanced solution methods in structural optimization based on evolution strategies, Evolutionary Algorithms for Aerofoil Design, The obnoxious \(p\) facility network location problem with facility interaction, A neural network approach to the vessel dispatching problem, An empirical study of a new metaheuristic for the traveling salesman problem, Some personal views on the current state and the future of locational analysis, Nonlinear integer programming by Darwin and Boltzmann mixed strategy, Discrete-continuous scheduling to minimize the makespan for power processing rates of jobs, New algorithm to investigate neural networks, Improved exploration in Hopfield network state-space through parameter perturbation driven by simulated annealing, Interactive analysis of multiple-criteria project scheduling problems, On the problem of exit from cycles for simulated annealing processes. A backward equation approach, Piecewise constant triangular cooling schedules for generalized simulated annealing algorithms, Simulated annealing for the unconstrained quadratic pseudo-Boolean function, Finding tracks detected by a drift tube system, Hybrid heuristics for the capacitated lot sizing and loading problem with setup times and overtime decisions, Fuzzy rule base learning through simulated annealing, Algorithmic challenges in computational molecular biophysics, \textit{Ab initio} folding of peptides by the optimal-bias Monte Carlo minimization procedure, Application of the simulated annealing algorithm to the combinatorial optimization problem with permutation property: An investigation of generation mechanism, Simulated annealing for data modeling in scientific images, Some experiments with simulated annealing techniques for packing problems, Timetable construction with Markovian neural network, Optimization by hierarchical mutant production, Genetic algorithms for the traveling salesman problem based on a heuristic crossover operation, New properties and computational improvement of the GOP algorithm for problems with quadratic objective functions and constraints, Isotropic effective energy simulated annealing searches for low energy molecular cluster states, Rate monotonic scheduling in hard real-time systems, Routeing winter gritting vehicles, Simulated annealing and the mapping problem: A computational study, Nonlinear filtering structure for image smoothing in mixed-noise environments, Asymptotic behaviour of time-inhomogeneous evolutions on von Neumann algebras, Optimization methods for computing global minima of nonconvex potential energy functions, A parallel build-up algorithm for global energy minimizations of molecular clusters using effective energy simulated annealing, Molecular conformation on the CM-5 by parallel two-level simulated annealing, Conformational searches for the global minimum of protein models, Simulated annealing with time-dependent energy function, Best-so-far vs. where-you-are: Implications for optimal finite-time annealing, On the efficiency of Gaussian adaption, Terminal repeller unconstrained subenergy tunneling (TRUST) for fast global optimization, Simulated annealing: Practice versus theory, Bin-packing by simulated annealing, A two-dimensional mapping for the traveling salesman problem, The pin redistribution problem in multi-chip modules, Parallel physical optimization algorithms for allocating data to multicomputer nodes, A fast optimization method based on a hierarchical strategy for the travelling salesman problem, New upper bounds for the football pool problem for 11 and 12 matches, A review of combinatorial problems arising in feedforward neural network design, A randomized algorithm for \(k\)-colorability, Simulated annealing procedures for forming machine cells in group technology, Simulated annealing and tabu search in the long run: A comparison on QAP tasks, Simulated annealing for constrained global optimization, Large-scale layout of facilities using a heuristic hybrid algorithm, The invisible hand algorithm: solving the assignment problem with statistical physics, Simulated annealing and tabu search approaches to unidirectional flowpath design for automated guided vehicle systems, Multiple-type, two-dimensional bin packing problems: Applications and algorithms, Homogeneous grouping of nuclear fuel cans through simulated annealing and tabu search, Combinations of simulation and evolutionary algorithms in management science and economics, An attraction-repulsion mesh adaption model for flow solution on unstructured grids, DSS for multiobjective project scheduling, Exploiting the deep structure of constraint problems, A new adaptive multi-start technique for combinatorial global optimizations, A genetic algorithm for flowshop sequencing, Global estimation of feedforward networks with a priori constraints, The depth and width of local minima in discrete solution spaces, A recurrent neural network controller and learning algorithm for the on- line learning control of autonomous underwater vehicles, Construction of Bayesian network structures from data: A brief survey and an efficient algorithm, Semiparametric inference for the accelerated life model with time- dependent covariates, Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: A survey of the state-of-the-art, Solving optimization problems with variable-constraint by an extended Cohen-Grossberg model, A unified constructive network model for problem-solving, A hypergraph model for constraint logic programming and applications to bus drivers' scheduling, On discrete inhomogeneous exit problems, Neural networks and heuristic search, Boolean query optimization and the 0-1 hyperbolic sum problem, Algorithms for approximate graph matching, Chaos and asymptotical stability in discrete-time neural networks, Scaling features in complex optimization problems, Machining condition optimization by genetic algorithms and simulated annealing, Constructing efficient simulated annealing algorithms, A simulated annealing based algorithm for eigenvalue problems, A retrofit based methodology for the fast generation and optimization of large-scale mesh partitions: Beyond the minimum interface size criterion, Stochastic simulations of two-dimensional composite packings, The general lotsizing and scheduling problem, A semi-infinite programming model for earliness/tardiness production planning with simulated annealing, An analysis of parallel heuristics for task allocation in multicomputers, New upper bounds for binary covering codes, The Metropolis algorithm for graph bisection, Modelling constant weight codes using tabu search, Heuristics for biquadratic assignment problems and their computational comparison, Job-shop scheduling: Computational study of local search and large-step optimization methods, Stochastic annealing for synthesis under uncertainty, Simulated annealing for manufacturing systems layout design, A new extension of local search applied to the Dial-A-Ride problem, A systematic procedure for setting parameters in simulated annealing algorithms, Cost analysis of alternative formulations for personnel scheduling in continuously operating organizations, A double annealing algorithm for discrete location/allocation problems, Improvement heuristics for the vehicle routing problem based on simulated annealing, Thermostatistical persistency: A powerful improving concept for simulated annealing algorithms, A model for designing callable bonds and its solution using tabu search, The TSP phase transition, Developments in structural-acoustic optimization for passive noise control, Global optimization of statistical functions with simulated annealing, ROptimus, EmiR, When a genetic algorithm outperforms hill-climbing, Modeling staff scheduling problems. A tutorial, Performance of a genetic algorithm for the graph partitioning problem, A local search approximation algorithm for \(k\)-means clustering, Identification of multivariate AR-models by threshold accepting, A theory of even functionals and their algorithmic applications, Simulated annealing simulated, Mesh partitioning algorithms for the parallel solution of partial differential equations, Single machine scheduling with flow time and earliness penalties, Good solutions to discrete noxious location problems via metaheuristics, Avoiding local optima in the \(p\)-hub location problem using tabu search and GRASP, Generalized evolutionary programming with Lévy-type mutation, Pseudo-Boolean optimization, Selected topics on assignment problems, Computational intelligence: From mathematical point of view, Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search, Single-point stochastic search algorithms for the multi-level lot-sizing problem, A co-operative parallel heuristic for mixed zero--one linear programming: Combining simulated annealing with branch and bound, An application of neurofuzzy modeling: The vehicle assignment problem, An application of simulated annealing to the cutting stock problem, A comparison of stochastic scheduling rules for maximizing project net present value, Minimizing makespan for flow shop scheduling by combining simulated annealing with sequencing knowledge, A method of spatial reasoning based on qualitative trigonometry, Modified simulated annealing algorithms for the flow shop sequencing problem, Algodesk: An experimental comparison of eight evolutionary heuristics applied to the quadratic assignment problem, Global optimization and simulated annealing, Bayesian approach to global optimization and application to multiobjective and constrained problems, On the convergence of ``threshold accepting, A simulated annealing channel routing algorithm, Nonlinear dynamics and stability of analog neural networks, Image segmentation using a neural network, Trends in systolic and cellular computation, A note on the effect of neighborhood structure in simulated annealing, Combinatorial aspects of construction of competition Dutch professional football leagues, Singular perturbed Markov chains and exact behaviors of simulated annealing processes, A stochastic probing algorithm for global optimization, HEPAPS: A PCB automatic placement system, Use of the Gibbs sampler in expert systems, An artificial maximum neural network: A winner-take-all neuron model forcing the state of the system in a solution domain, Nested annealing: A provable improvement to simulated annealing, The traveling salesman problem: An overview of exact and approximate algorithms, Homeochaos: Dynamic stability of a symbiotic network with population dynamics and evolving mutation rates, Analysis of chaotic population dynamics using artificial neural networks, Composite stock cutting through simulated annealing, Simulated annealing for machine layout problems in the presence of zoning constraints, Application of statistical mechanics methodology to term-structure bond- pricing models, Statistical mechanics of combat with human factors, Optimal design of LAN-WAN internetworks: An approach using simulated annealing, Large-step Markov chains for the TSP incorporating local search heuristics, The afforestation problem: A heuristic method based on simulated annealing, Simulated annealing applied to the process allocation problem, Local search in coding theory, Binary periodic synchronizing sequences, Performance of a neural network method with set partitioning, Neural network methods in combinatorial optimization, Scheduling with neural networks -- the case of the Hubble Space Telescope, A connectionist approach to the quadratic assignment problem, Recurrent neural networks for linear programming: Analysis and design principles, A computational procedure for part design, Restricted neighborhood in the tabu search for the flowshop problem, A data parallel finite element method for computational fluid dynamics on the Connection Machine system, Genetic algorithms, function optimization, and facility layout design, Genetic algorithms and very fast simulated reannealing: A comparison, Global optimization methods for multimodal inverse problems, A hybrid simulated annealing approach for single machine scheduling problems with non-regular penalty functions, Phase retrieval problem in quantum chaos and its relation to the origin of irreversibility. I, Cell formation in manufacturing systems through simulated annealing: An experimental evaluation, Some extensions of radial basis functions and their applications in artificial intelligence, New evolutionary genetic algorithms for NP-complete combinatorial optimization problems, Global optimization requires global information, Asymptotic behavior of some linear differential systems, Solution for the constrained Guillotine cutting problem by simulated annealing, Local search heuristics for single-machine scheduling with batching to minimize the number of late jobs, Scheduling programs with repetitive projects: A comparison of a simulated annealing, a genetic and a pair-wise swap algorithm, An SA/TS mixture algorithm for the scheduling tardiness problem, A simulated annealing heuristic for the one-dimensional cutting stock problem, Traditional heuristic versus Hopfield neural network approaches to a car sequencing problem, A simulated annealing approach for the one-machine mean tardiness scheduling problem, Optimizing simulated annealing schedules with genetic programming, General local search methods, Determining dominant wind directions, A beam search algorithm for PFSA inference, Simulated annealing with time-dependent energy function via Sobolev inequalities, Approximating MAPs for belief networks is NP-hard and other theorems, A feedback algorithm for determining search parameters for Monte Carlo optimization, The life span method -- a new variant of local search, Path optimization for graph partitioning problems, A graph theoretical approach for the yield enhancement of reconfigurable VLSI/WSI arrays, Scheduling projects to maximize net present value -- the case of time-dependent, contingent cash flows, Parallel simulated annealing by mixing of states, Searching for backbones -- an efficient parallel algorithm for the traveling salesman problem, Simulated annealing using hybrid Monte Carlo, Exploration of NP-hard enumeration problems by simulated annealing -- the spectrum values of permanents, A neighbourhood scheme with a compressed solution space for the early/tardy scheduling problem, Heuristics for unrelated machine scheduling with precedence constraints, An integer linear programming model and a modified branch and bound algorithm for the project material requirements planning problem, CLUSTERING PANEL DATA VIA PERTURBED ADAPTIVE SIMULATED ANNEALING AND GENETIC ALGORITHMS, A multi-echelon integrated JIT inventory model using the time buffer and emergency borrowing policies to deal with random delivery lead times, Modelling and analysis of wafer fabrication scheduling via generalized stochastic Petri net and simulated annealing, Fixed-point attractors in analog neural computation, New Monitoring Parameter for the Traveling Salesman Problem, Entropy of theK-Satisfiability Problem, Stochastic Tunneling Approach for Global Minimization of Complex Potential Energy Landscapes, Parallel continuous simulated annealing for global optimization simulated annealing^∗, A new stochastic algorithm of global optimization—Region’s walk and contraction, Improvement of pure random search in global optimization, An evolutionary tabu search approach to optimal structuring element extraction for mst-Based shapes description, État de l'art des méthodes “d'optimisation globale”, A behavioural modelling technique for visual microprocessor mixed‐signal VLSI chips, LAND USE OPTIMIZATION USING SELF-ORGANIZING ALGORITHMS, Unnamed Item, METAHEURISTICS FOR THE MIXED SHOP SCHEDULING PROBLEM, APPLYING METAHEURISTICS TO FEEDER BUS NETWORK DESIGN PROBLEM, TRACKING CONTROL OF NONLINEAR SYSTEMS: A SLIDING MODE DESIGN VIA CHAOTIC OPTIMIZATION, Heuristic pattern search and its hybridization with simulated annealing for nonlinear global optimization, Heuristic optimization system for the determination of index positions on CNC magazines with the consideration of cutting tool duplications, An optimization model for selective inspection in serial manufacturing systems, A new multi-objective optimization method for master production scheduling problems using simulated annealing, Packing of convex polytopes into a parallelepiped, Implementation and Comparison of Three Neural Network Learning Algorithms, A two-stage heuristic method for balancing mixed-model assembly lines with parallel workstations, Hybrid GA and SA dynamic set-up planning optimization, Linguistic-based meta-heuristic optimization model for flexible job shop scheduling, A Comparative Study Of Global Optimization Approaches To Meg Source Localization, A cybernetic approach to the multiscale minimization of energy function: Grey level image segmentation, Optimal Prediction in Molecular Dynamics, A Decision-Theoretic Approach to Summarising Posterior Information in a Sample of step Functions, Egonet: A Genetic Algorithm Model For The Optimisation Of Telephone Networks, Comparative study of simulated annealing, genetic algorithms and tabu search for solving binary and comprehensive machine-grouping problems, REPAIRING NON-MANIFOLD TRIANGLE MESHES USING SIMULATED ANNEALING, Improved bounds for the large-time behaviour of simulated annealing, AN EFFECTIVE APPROACH FOR DISTRIBUTED PROGRAM ALLOCATION, THE ANNEALING EVOLUTION ALGORITHM, COMBINING HELPFUL SETS AND PARALLEL SIMULATED ANNEALING FOR THE GRAPH-PARTITIONING PROBLEM∗, A STUDY OF MASSIVELY PARALLEL SIMULATED ANNEALING ALGORITHMS FOR CHROMOSOME RECONSTRUCTION VIA CLONE ORDERING, Adaptive Hybrid Learning for Neural Networks, Optimal path for automated drilling operations by a new heuristic approach using particle swarm optimization, A study on hybrid random signal-based learning and its applications, Incorporating data mining and computer graphics for modeling of neural networks, Probabilistic and deterministic local search for solving the binary multiknapsack problem, Dynamical Neural Network Approach to the Job-shop Scheduling, Haploid and diploid algorithms, a new approach for global optimization: compared performances, A new simulated annealing algorithm, Hnbue property in a shock model with cumulative damage threshold, A PERCENTILE SEARCH HEURISTIC FOR GENERALIZED ASSIGNMENT PROBLEMS WITH A VERY LARGE NUMBER OF JOBS, METAHEURISTIC APPROACHES FOR THE MULTILEVEL RESOURCE-CONSTRAINED LOT-SIZING PROBLEM WITH SETUP AND LEAD TIMES, Scaling and universality in continuous length combinatorial optimization, Experiments on the minimum linear arrangement problem, Flowshop-scheduling problems with makespan criterion: a review, A threshold accepting approach to the Open Vehicle Routing problem, Multiobjective optimal design of three‐phase induction motor using simulated annealing technique, FINDING MINIMA IN COMPLEX LANDSCAPES: ANNEALED, GREEDY AND RELUCTANT ALGORITHMS, Comparing descent heuristics and metaheuristics for the vehicle routing problem, Improved methods of assembly sequence determination for automatic assembly systems, An effective hybrid optimization strategy for job-shop scheduling problems, Variable neighborhood search: Principles and applications, Cost functions for pairwise data clustering, A robust solution for object recognition by mean field annealing techniques, Estimation of unknown parameters in nonlinear and non-Gaussian state-space models, A review of planning and scheduling systems and methods for integrated steel production, An efficient mean field approach to the set covering problem, Partial abductive inference in Bayesian belief networks by simulated annealing, [SMMP A modern package for simulation of proteins], Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem, The shortest path computation in MOSPF protocol using an annealed Hopfield neural network with a new cooling schedule, Quantum optimization, Optimization design of biorthogonal filter banks for image compression, Approximating an optimal feedback control law by a generalized Sugeno controller, A homotopy approach to improving PEM identification of ARMAX models, Pixon-based image denoising with Markov random fields, Parallel dynamic load balancing strategies for adaptive irregular applications, Analog computers in stochastic phenomena, Artificial intelligence search methods for multi-machine two-stage scheduling with due date penalty, inventory, and machining costs, A direct search variant of the simulated annealing algorithm for optimization involving continuous variables, Local search heuristics for two-stage flow shop problems with secondary criterion, Fast parallel heuristics for the job shop scheduling problem, Stochastic networks for constraint satisfaction and optimization., Real-world extensions to scheduling algorithms based on Lagrangian relaxation, Some results characterizing the finite time behaviour of the simulated annealing algorithm., A simulated annealing algorithm for dynamic layout problem, Protein folding simulations and structure predictions, Molecular dynamics study of structure formation of a single polymer chain by cooling, Faster Monte Carlo simulations at low temperatures. The waiting time method, Large scale structural optimization: Computational methods and optimization algorithms., Bargaining with limited computation: Deliberation equilibrium, Computer Go: An AI oriented survey, Statistical mechanics methods and phase transitions in optimization problems, A physicist's approach to number partitioning, Simulation-based optimization using simulated annealing with ranking and selection, An efficient two-staged approach for generating block layouts, Pattern recogniton using Markov random field models, A surface-based approach to 3-D object recognition using a mean field annealing neural network, Heuristic unidirectional flowpath design approaches for automated guided vehicle systems