In:
Journal of Advanced Computational Intelligence and Intelligent Informatics, Fuji Technology Press Ltd., Vol. 2, No. 6 ( 1998-12-20), p. 208-213
Abstract:
In this paper, a novel penalty function approach is proposed for constrained optimization problems with linear and nonlinear constraints. It is shown that by using a mapping function to "wrap" up the constraints, a constrained optimization problem can be converted to an unconstrained optimization problem. It is also proved mathematically that the best solution of the converted unconstrained optimization problem will approach the best solution of the constrained optimization problem if the tuning parameter for the wrapping function approaches zero. A tailored genetic algorithm incorporating an adaptive tuning method is then used to search for the global optimal solutions of the converted unconstrained optimization problems. Four test examples were used to show the effectiveness of the approach.
Type of Medium:
Online Resource
ISSN:
1883-8014
,
1343-0130
DOI:
10.20965/jaciii.1998.p0208
Language:
English
Publisher:
Fuji Technology Press Ltd.
Publication Date:
1998
detail.hit.zdb_id:
2740249-6
detail.hit.zdb_id:
2708994-0
Permalink