Skip to main navigation Skip to search Skip to main content

A hybrid genetic algorithm for a type of nonlinear programming problem

    Research output: Journal Publications and ReviewsRGC 21 - Publication in refereed journalpeer-review

    Abstract

    Based on the introduction of some new concepts of semifeasible direction, Feasible Degree (FD1) of semifeasible direction, feasible degree (FD2) 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 (HGA) 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 show that this method is effective. © 1998 Elsevier Science Ltd. All rights reserved.
    Original languageEnglish
    Pages (from-to)11-21
    JournalComputers and Mathematics with Applications
    Volume36
    Issue number5
    DOIs
    Publication statusPublished - Sept 1998

    Research Keywords

    • Feasible degree
    • Hybrid genetic algorithm
    • Nonlinear programming
    • Semifeasible direction
    • Weighted gradient direction

    Fingerprint

    Dive into the research topics of 'A hybrid genetic algorithm for a type of nonlinear programming problem'. Together they form a unique fingerprint.

    Cite this