Simulated annealing for constrained global optimization

DOI10.1007/BF01100688zbMath0819.90103OpenAlexW2123037532MaRDI QIDQ1337127

H. Edwin Romeijn, Robert L. Smith

Publication date: 30 October 1994

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01100688

zbMATH Keywords

global optimizationMonte Carlo optimizationrandom searchadaptive coolingcontinuous simulated annealing algorithmHide-and-Seek

Mathematics Subject Classification ID

Nonlinear programming (90C30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

A parallel implementation of an \(O^\ast(n^4)\) volume algorithm ⋮ On application of the ray-shooting method for LQR via static-output-feedback ⋮ Towards pure adaptive search ⋮ The combination of continuous network design and route guidance ⋮ Metaheuristics: A bibliography ⋮ Empirical working time distribution-based line balancing with integrated simulated annealing and dynamic programming ⋮ A flexible sequential Monte Carlo algorithm for parametric constrained regression ⋮ Airfreight forwarder's shipment planning: shipment consolidation and containerization ⋮ A characterization of probabilities with full support and the Laplace method ⋮ Sequential Monte Carlo simulated annealing ⋮ Inventory models with managerial policy independent of demand ⋮ A randomized approximation algorithm for the minimal-norm static-output-feedback problem ⋮ Computational results of an \(O^{\ast }(n^{4})\) volume algorithm ⋮ On the generation of metric TSP instances with a large integrality gap by branch-and-cut ⋮ Pattern hit-and-run for sampling efficiently on polytopes ⋮ Pattern discrete and mixed hit-and-run for global optimization ⋮ Unnamed Item ⋮ Parameter identification in dynamic systems using the homotopy optimization approach ⋮ A derivative-free variant called DFSA of Dekkers and Aarts' continuous simulated annealing algorithm ⋮ Gradient-Based Adaptive Stochastic Search for Simulation Optimization Over Continuous Space ⋮ Evolutionarily stable diffusive dispersal ⋮ Simulated annealing algorithms for continuous global optimization: Convergence conditions ⋮ Derivative-free filter simulated annealing method for constrained continuous global optimization ⋮ An analytically derived cooling schedule for simulated annealing ⋮ Pure Random Search with exponential rate of convergency ⋮ Parameter identification for a nonlinear enzyme-catalytic dynamic system with time-delays ⋮ Adaptive search with stochastic acceptance probabilities for global optimization ⋮ A new multiobjective simulated annealing algorithm ⋮ A systematic approach for examining the impact of calibration uncertainty in disease modeling ⋮ Simulation optimization of risk measures with adaptive risk levels ⋮ A Hit‐and‐Run approach for generating scale invariant Small World networks ⋮ Annealing adaptive search, cross-entropy, and stochastic approximation in global optimization ⋮ A local exploration-based differential evolution algorithm for constrained global optimization ⋮ A reduction method for semi-infinite programming by means of a global stochastic approach† ⋮ STOCHASTIC MODEL OF LAKE SYSTEM INVASION AND ITS OPTIMAL CONTROL: NEURODYNAMIC PROGRAMMING AS A SOLUTION METHOD ⋮ Comparative analysis of the cutting angle and simulated annealing methods in global optimization ⋮ Convergence of the simulated annealing algorithm for continuous global optimization ⋮ New reflection generator for simulated annealing in mixed-integer/continuous global optimization ⋮ A randomized algorithm for optimal PID controllers ⋮ Recent developments and trends in global optimization ⋮ Matching stochastic algorithms to objective function landscapes ⋮ A numerical evaluation of several stochastic algorithms on selected continuous global optimization test problems

Uses Software

• simannf90

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Global optimization and stochastic differential equations
• Pure adaptive search in Monte Carlo optimization
• Laplace's method revisited: Weak convergence of probability measures
• Global optimization and simulated annealing
• Pure adaptive search in global optimization
• Improving hit-and-run for global optimization
• A method of unconstrained global optimization
• Direction Choice for Accelerated Convergence in Hit-and-Run Sampling
• Hit-and-run algorithms for the identification of nonredundant linear inequalities
• Stochastic Methods for Global Optimization
• General Irreducible Markov Chains and Non-Negative Operators
• Efficient Monte Carlo Procedures for Generating Points Uniformly Distributed over Bounded Regions
• Generalized Simulated Annealing for Function Optimization
• Minimizing multimodal functions of continuous variables with the “simulated annealing” algorithm—Corrigenda for this article is available here
• Stochastic global optimization methods part I: Clustering methods
• Stochastic global optimization methods part II: Multi level methods
• Cooling Schedules for Optimal Annealing
• Simulated annealing: An introduction
• Estimation of the Minimum of a Function Using Order Statistics
• Shake-and-Bake Algorithms for Generating Uniform Points on the Boundary of Bounded Polyhedra
• Convergence theorems for a class of simulated annealing algorithms on ℝ^d
• An algorithm for the solution of constrained generalised polynomial programming problems
• Hit-and-Run Algorithms for Generating Multivariate Distributions
• Letter to the Editor—-A Closed Form Solution of Certain Programming Problems
• Letter to the Editor—A Monte Carlo Method for the Approximate Solution of Certain Types of Constrained Optimization Problems