New simulated annealing algorithms for constrained optimization
From MaRDI portal
Recommendations
- Simulated annealing with asymptotic convergence for nonlinear constrained optimization
- scientific article; zbMATH DE number 854915
- Annealing a genetic algorithm for constrained optimization
- Comparison of Simulated Annealing, Interval Partitioning and Hybrid Algorithms in Constrained Global Optimization
- Constrained multi-global optimization using a penalty stretched simulated annealing framework
Cites work
- scientific article; zbMATH DE number 1100792 (Why is no real title available?)
- A set of geometric programming test problems and their solutions
- An analytical approach to global optimization
- An efficient constraint handling method for genetic algorithms
- An improved simulated annealing for solving the linear constrained optimization problems
- Global optimization and simulated annealing
- Optimization by simulated annealing
- Parallel simulated annealing for structural optimization
- Single and multiobjective structural optimization in discrete‐continuous variables using simulated annealing
Cited in
(6)- Constrained multi-global optimization using a penalty stretched simulated annealing framework
- An improved simulated annealing for solving the linear constrained optimization problems
- Simulated annealing with asymptotic convergence for nonlinear constrained optimization
- scientific article; zbMATH DE number 2080323 (Why is no real title available?)
- Comparison of Simulated Annealing, Interval Partitioning and Hybrid Algorithms in Constrained Global Optimization
- Simulated annealing for constrained global optimization
This page was built for publication: New simulated annealing algorithms for constrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3580201)
