Constrained Simulated Annealing with Applications in Nonlinear Continuous Constrained Global Optimization

Authors:
Benjamin W. Wah;Tao Wang
Affiliations:
-;-
Venue:
ICTAI '99 Proceedings of the 11th IEEE International Conference on Tools with Artificial Intelligence
Year:
1999

Citing 10
Cited 4

Minimizing multimodal functions of continuous variables with the “simulated annealing” algorithm: Corrigenda for this article is available here

ACM Transactions on Mathematical Software (TOMS)
A collection of test problems for constrained global optimization algorithms

A collection of test problems for constrained global optimization algorithms
Cycle Decompositions and Simulated Annealing

SIAM Journal on Control and Optimization
An SQP method for general nonlinear programs using only equality constrained subproblems

Mathematical Programming: Series A and B
A Discrete Lagrangian-Based Global-SearchMethod for Solving Satisfiability Problems

Journal of Global Optimization
Simulated Annealing with Asymptotic Convergence for Nonlinear Constrained Global Optimization

CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
The Theory of Discrete Lagrange Multipliers for Nonlinear Discrete Optimization

CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
Global optimization of nonconvex nonlinear programs using parallel branch and bound

Global optimization of nonconvex nonlinear programs using parallel branch and bound
Evolutionary algorithms, homomorphous mappings, and constrained parameter optimization

Evolutionary Computation
Evolutionary algorithms for constrained parameter optimization problems

Evolutionary Computation

A dual sequence simulated annealing algorithm for constrained optimization

MATH'06 Proceedings of the 10th WSEAS International Conference on APPLIED MATHEMATICS
Solving nonlinearly constrained global optimization problem via an auxiliary function method

Journal of Computational and Applied Mathematics
Simulated annealing based algorithm for smooth robot path planning with different kinematic constraints

Proceedings of the 2010 ACM Symposium on Applied Computing
A revised particle swarm optimization based discrete Lagrange multipliers method for nonlinear programming problems

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper improves constrained simulated annealing (CSA), a discrete global minimization algorithm with asymptotic convergence to discrete constrained global minima with probability one. The algorithm is based on the necessary and sufficient conditions for discrete constrained local minima in the theory of discrete Lagrange multipliers. We extend CSA to solve nonlinear continuous constrained optimization problems whose variables take continuous values. We evaluate many heuristics, such as dynamic neighborhoods, gradual resolution of nonlinear equality constraints and reannealing, in order to greatly improve the efficiency of solving continuous problems. We report much better solutions than the best-known solutions in the literature on two sets of continuous optimization benchmarks.