Study of Numerical Optimization Constraint Problems Based on Genetic Algorithm
DOI:
CSTR:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    For numerical optimization constraints appear in the large-scale, multi-function polymorphism, on global opti-mization with discrete variables under such circumstances, General optimization method, convergence is slow to seek global extremum of low probability. Made with genetic algorithm of numerical optimization constraints problem solution, by numerical simulation experimental results indicates that, the algorithm performance better than existing other algorithm, it not only can processing linear equation constraints, and also can processing nonlinear equation constraints, while improve has convergence speed reconciliation of precision, is efficient sound of intelligent algorithm, has is high of global found excellent ability and soon of convergence speed, on solution complex more peak more State function of optimization constraints problem has feasibility and effectiveness.

    Reference
    Related
    Cited by
Get Citation

刘正龙,杨艳梅.基于遗传算法的数值优化约束问题的研究.计算机系统应用,2013,22(5):139-142,197

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:September 07,2012
  • Revised:March 20,2013
  • Adopted:
  • Online:
  • Published:
Article QR Code
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-3
Address:4# South Fourth Street, Zhongguancun,Haidian, Beijing,Postal Code:100190
Phone:010-62661041 Fax: Email:csa (a) iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063