Skip to content
Research Article Open access CC BY 4.0

A Combined Genetic Algorithms-local Search Engine (GAs–LCE) in Constrained Nonlinear Programming

Faiz A. El-Qorashy, Hossam A. Nabwey, A. A. Mousa

Current Journal of Applied Science and Technology · pp. 324–333 · Published 10 Apr 2015

10.9734/BJAST/2015/17059

Abstract

Evolutionary optimization provides robust and efficient techniques for solving complex real-world problems. The aim of this paper is to present an enhanced evolutionary algorithm for solving constraint nonlinear programming problems NLPPs, which based on concept of co-evolution and repair algorithm for handling nonlinear constraints. Our proposed approach is made of two phases, firstly, phase I is a classical genetic algorithm, which based on the ideas of repair strategy and co-evolution. Secondly in phase II, Based on the k-means cluster algorithm, the search space is shrunk after phase I to the generated rectangular-atom with highly rate and concentrating the optimal solution region, so local search techniques will implemented in order to get more accurate optimal solution. Finally, the results of various experimental studies using a suite of benchmark functions have demonstrated the superiority of the proposed algorithm to finding the global optimal solution for constraint nonlinear programming problems.

Nonlinear programming genetic algorithms local search k-means

Cited by 2

Article metrics

Real usage data collected on this platform.

0

Page views

0

PDF downloads

0

Outbound clicks

2

Citations

Views by country

Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".

No views recorded yet.

Traffic sources

Referring site, by host.

No traffic recorded yet.

Views and downloads exclude known bots/crawlers. Citations combines this platform's own DOI-resolved index with each external source's own reported total — see Cited by above for individually listed citing works. Last refreshed 0 seconds ago.