Region-Reduction Division Criteria-based hybrid constrained optimisation
by S.D. Jabeen
International Journal of Artificial Intelligence and Soft Computing (IJAISC), Vol. 3, No. 2, 2012

Abstract: This paper presents a new hybrid Genetic Algorithm (GA) that can be applied to solve the non-linear constrained optimisation problems by penalty function technique. In this hybrid method initially, the constrained optimisation problem has been converted into an unconstrained optimisation problem by considering different existing penalty function technique. Then, to solve the transformed problem, the proposed hybrid algorithm has been applied. The developed algorithm is based on Region-Reduction Division Criteria (RRDC) and Advanced Real-Coded Genetic Algorithm (ARCGA). The efficiency of this algorithm has been tested over several standard test problems available in the literature. The result has confirmed that this hybrid GA can produce high-quality solutions.

Online publication date: Sat, 29-Nov-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Artificial Intelligence and Soft Computing (IJAISC):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com