NEW SIMULATED ANNEALING ALGORITHMS FOR CONSTRAINED OPTIMIZATION

DOI10.1142/S0217595910002740zbMath1200.90170OpenAlexW2145100271MaRDI QIDQ3580201

Chandra Sekhar Pedamallu, Linet Özdamar

Publication date: 11 August 2010

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0217595910002740

zbMATH Keywords

constrained optimizationsimulated annealingpenalty and non-penalty methods

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Approximation methods and heuristics in mathematical programming (90C59)

Uses Software

• Genocop

Cites Work

• Unnamed Item
• Optimization by Simulated Annealing
• An improved simulated annealing for solving the linear constrained optimization problems
• Global optimization and simulated annealing
• An analytical approach to global optimization
• An efficient constraint handling method for genetic algorithms
• A set of geometric programming test problems and their solutions
• Parallel simulated annealing for structural optimization
• Single and multiobjective structural optimization in discrete‐continuous variables using simulated annealing

This page was built for publication: NEW SIMULATED ANNEALING ALGORITHMS FOR CONSTRAINED OPTIMIZATION