Volume 8 Number 2 (Feb. 2013)
Home > Archive > 2013 > Volume 8 Number 2 (Feb. 2013) >
JCP 2013 Vol.8(2): 272-278 ISSN: 1796-203X
doi: 10.4304/jcp.8.2.272-278

A Hybrid Genetic Algorithm for Constrained Optimization Problems

Da-lian Liu1, Xiao-hua Chen2, and Jin-ling Du2
1 Department of Basic Course Teaching, Beijing Union University, Beijing, China
2 Tourism Institute, Beijing Union University, Beijing, China School of Management Engineering, Shan Dong Jianzhu University, Jinan, China


Abstract—Genetic algorithm (GA) is a powerful method to solve constrained optimization problems (COPs). In this paper, a new fitness function based hybrid genetic optimization algorithm (NFFHGA) for COPs is proposed, in which a new crossover operator based on Union Design is presented, and inspired by the smooth function technique, a new fitness function is designed to automatically search for potential solutions. Furthermore, in order to make the fitness function work well, a special technique which keeps a certain number of feasible solutions is also used. Experiments on 6 benchmark problems are performed and the compared results with the best known solutions reported in literature show that NFFHGA can not only quickly converge to the optimal or near-optimal solutions, but also have a high performance.

Index Terms—Constrained optimization, genetic algorithm, fitness function, Uniform Design

[PDF]

Cite: Da-lian Liu, Xiao-hua Chen, and Jin-ling Du, " A Hybrid Genetic Algorithm for Constrained Optimization Problems," Journal of Computers vol. 8, no. 2, pp. 272-278, 2013.

General Information

ISSN: 1796-203X
Abbreviated Title: J.Comput.
Frequency: Bimonthly
Editor-in-Chief: Prof. Liansheng Tan
Executive Editor: Ms. Nina Lee
Abstracting/ Indexing: DBLP, EBSCO,  ProQuest, INSPEC, ULRICH's Periodicals Directory, WorldCat,etc
E-mail: jcp@iap.org
  • Nov 14, 2019 News!

    Vol 14, No 11 has been published with online version   [Click]

  • Mar 20, 2020 News!

    Vol 15, No 2 has been published with online version   [Click]

  • Dec 16, 2019 News!

    Vol 14, No 12 has been published with online version   [Click]

  • Sep 16, 2019 News!

    Vol 14, No 9 has been published with online version   [Click]

  • Aug 16, 2019 News!

    Vol 14, No 8 has been published with online version   [Click]

  • Read more>>