• Article
  • | |
  • Metrics
  • |
  • Reference [8]
  • |
  • Related [20]
  • |
  • Cited by
  • | |
  • Comments
    Abstract:

    In trying to solve constrained optimization problems using genetic algorithms, the method to handle the constraints is the key factor to success. In this paper, some features of GA (genetic algorithms) and a large class of constrained optimization problems are taken into account and a new method called Fixed Proportion and Direct Comparison (FPDC) is proposed, which combines direct comparison method and the strategy to keep a fixed proportion of infeasible individuals. It has been successfully integrated with the ordinary GA. Numerical results show that it is a general, effective and robust method.

    Reference
    [1] Himmelblau, D.M. Applied Nonlinear Programming. New York: McGraw-Hill, Inc., 1972.
    [2] Goldberg, D.E. Genetic Algorithms in Search, Optimization and Machine Learning. Readings, MA: Addison-Wesley Publishing Company, 1989.
    [3] Michalewicz, Z., Schoenauer, M. Evolutionary algorithms for constrained parameter optimization problems. Evolutionary Computation Journal, 1996,4(1):1~32.
    [4] Powell, D., Skolnick, M. Using genetic algorithms in engineering design optimization with nonlinear constraints. In: Forest, S., ed. Proceedings of the 5th International Conference on Genetic Algorithms. San Mateo, CA: Morgan Kaufmann Publishers, 1993. 424~430.
    [5] Deb, K., Agrawal, S. A niched-penalty approach for constraint handling in genetic algorithms. In: Montana, D., ed. Proceedings of the ICANNGA-99. Portoroz, Slovenia, 1999. 234~239.
    [6] Schoenauer, M., Michalewicz, Z. Boundary operators for constrained optimization problems. In: Baeck, T., ed. Proceedings of the 7th International Conference on Genetic Algorithms. San Mateo, CA: Morgan Kaufmann Publishers, 1997. 322~329.
    [7] Michalewicz, Z., Nazhiyath, G., Michalewicz, M. A note on usefulness of geometrical crossover for numerical optimization problems. In: Angeline, P., Baeck, T., eds. Proceedings of the 5th Annual Conference on Evolutionary Programming. Cambridge, MA: MIT Press, 1996. 325~331.
    [8] Michalewicz, Z. Genetic Algorithms+Data Structures=Evolution Programs. 3rd ed., New York: Springer\|Verlag, 1996.
    Cited by
    Comments
    Comments
    分享到微博
    Submit
Get Citation

林丹,李敏强,寇纪凇.基于遗传算法求解约束优化问题的一种算法.软件学报,2001,12(4):628-632

Copy
Share
Article Metrics
  • Abstract:5474
  • PDF: 5579
  • HTML: 0
  • Cited by: 0
History
  • Received:September 07,1999
  • Revised:June 20,2000
You are the first2032758Visitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063