A hybrid genetic algorithm for a type of nonlinear programming problem

A hybrid genetic algorithm for a type of nonlinear programming problem

0.00 Avg rating0 Votes
Article ID: iaor19991478
Country: United Kingdom
Volume: 36
Issue: 5
Start Page Number: 11
End Page Number: 21
Publication Date: Sep 1998
Journal: Computers & Mathematics with Applications
Authors: , , ,
Keywords: artificial intelligence
Abstract:

Based on the introduction of some new concepts of semifeasible direction, Feasible Degree of semifeasible direction, feasible degree of illegal points ‘belonging to’ feasible domain, etc., this paper proposed a new fuzzy method for formulating and evaluating illegal points and three new kinds of evaluation functions and developed a special Hybrid Genetic Algorithm with penalty function and gradient direction search for nonlinear programming problems. It uses mutation along the weighted gradient direction as its main operator and uses arithmetic combinatorial crossover only in the later generation process. Simulation of some examples shows that this method is effective.

Reviews

Required fields are marked *. Your email address will not be published.