Skip to main navigation Skip to search Skip to main content

Evolutionary algorithm for zero-one constrained optimization problems based on objective penalty function

    Research output: Chapters, Conference Papers, Creative and Literary WorksRGC 32 - Refereed conference paper (with host publication)peer-review

    Abstract

    In many evolutionary algorithms, it is very important way to use penalty function as a fitness function in order to solve many integer optimization problems. In this paper, we first define a new objective penalty function and give its some properties for integer constrained optimization problems. Then, we present an algorithm with global convergence for integer constrained optimization problems in theory. Moreover, based on the objective penalty function, a simple novel evolutionary algorithm to solve the zero-one constrained optimization problems is developed. Finally, numerical results of several examples show that the proposed evolutionary algorithm has a good performance for some zero-one optimization problems. © 2010 IEEE.
    Original languageEnglish
    Title of host publicationProceedings - 2010 International Conference on Computational Intelligence and Security, CIS 2010
    Pages132-136
    DOIs
    Publication statusPublished - 2010
    Event2010 International Conference on Computational Intelligence and Security, CIS 2010 - Nanning, China
    Duration: 11 Dec 201014 Dec 2010

    Conference

    Conference2010 International Conference on Computational Intelligence and Security, CIS 2010
    PlaceChina
    CityNanning
    Period11/12/1014/12/10

    Research Keywords

    • Evolutionary algorithm
    • Fitness function
    • Objective penalty function
    • Zero-one optimization problems

    Fingerprint

    Dive into the research topics of 'Evolutionary algorithm for zero-one constrained optimization problems based on objective penalty function'. Together they form a unique fingerprint.

    Cite this