An adaptive simulated annealing algorithm for global optimization over continuous variables

DOI10.1007/BF01106604zbMath0827.90129OpenAlexW2078305591MaRDI QIDQ1890943

G. W. Forbes, Andrew E. W. Jones

Publication date: 28 May 1995

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

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

zbMATH Keywords

global optimizationMonte Carlo optimizationadaptive simulated annealing

Mathematics Subject Classification ID

Nonlinear programming (90C30) Parallel numerical computation (65Y05)

Related Items (8)

Metaheuristics: A bibliography ⋮ Lens design using iterative random selection of constructional parameters ⋮ A limited-memory BFGS-based differential evolution algorithm for optimal control of nonlinear systems with mixed control variables and probability constraints ⋮ A new adaptive mutation simulated annealing algorithm: application to the study of pure and mixed Pt-Pd clusters ⋮ On the natural merit function for solving complementarity problems ⋮ Simulated annealing algorithms for continuous global optimization: Convergence conditions ⋮ Proposal adaptation in simulated annealing for continuous optimization problems ⋮ Comparative analysis of the cutting angle and simulated annealing methods in global optimization

Uses Software

• simannf90

Cites Work

• Unnamed Item
• Optimization by Simulated Annealing
• Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
• A Monte Carlo simulated annealing approach to optimization over continuous variables
• Generalized Simulated Annealing for Function Optimization
• Minimizing multimodal functions of continuous variables with the “simulated annealing” algorithm—Corrigenda for this article is available here
• Letter to the Editor—-A Closed Form Solution of Certain Programming Problems

This page was built for publication: An adaptive simulated annealing algorithm for global optimization over continuous variables