Constrained genetic algorithms and their applications in nonlinear constrained optimization

Authors:
Affiliations:
Venue:
ICTAI '00 Proceedings of the 12th IEEE International Conference on Tools with Artificial Intelligence
Year:
2000

Citing 0
Cited 5

Combining Meta-Heuristics to Effectively Solvethe Vehicle Routing Problems with Time Windows

Artificial Intelligence Review
Efficient synthesis of out-of-core algorithms using a nonlinear optimization solver

Journal of Parallel and Distributed Computing - Special issue: 18th International parallel and distributed processing symposium
A distributed cross-layer optimization method for multicast in interference-limited multihop wireless networks

EURASIP Journal on Wireless Communications and Networking
Violation-guided learning for constrained formulations in neural-network time-series predictions

IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 2
Repeated weighted boosting search for discrete or mixed search space and multiple-objective optimisation

Applied Soft Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Abstract: The paper presents a problem-independent framework that unifies various mechanisms for solving discrete constrained nonlinear programming (NLP) problems whose functions are not necessarily differentiable and continuous. The framework is based on the first-order necessary and sufficient conditions in the theory of discrete constrained optimization using Lagrange multipliers. It implements the search for discrete-neighborhood saddle points (SP/sub dn/) by performing ascents in the original-variable subspace and descents in the Lagrange-multiplier subspace. Our study on the various mechanisms shows that CSAGA, a combined constrained simulated annealing and genetic algorithm, performs well. Finally, we apply iterative deepening to determine the optimal number of generations in CSAGA.