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

    In this paper, a kind of dynamic genetic algorithm based on the neural network with constraints is presented, which combines the local searching ability of neural network with the global searching ability of genetic algorithm. The dynamic algorithm is used to decide the initial point of the neural network, and the neural network is employed to decide the fitness of the dynamic genetic algorithm. The proposed algorithm has some theoretical and biological meanings. Compared with the standard genetic algorithm, it can decrease the searching scale and get the approximate solution of quadratic programming problems that are non-definite.

    Reference
    [1] Bagley, J.D. The behavior of adaptive systems which employ genetic and correlation algorithms. Dissertation Abstracts International, 1968,28(12):1~10.
    [2] Goldberg, D.E. Genetic Algorithm——in Search, Optimization and Machine Learning. New York: Addison-Wesley Publishing Company, Inc., 1989.
    [3] Koza, J.R. Genetic Programming: on the Programming of Computers by Means of Natural Selection. Cambridge, MA: MIT Press, 1992.
    [4] Koza, J.R. Genetic Programming II: Automatic Discovery of Reusable Programs. Cambridge, MA: MIT Press, 1994.
    [5] Chen, Guo-liang, Wang, Xu-hua, Zhuang, Zhen-quan, et al. Genetic Algorithm and its Applications. Beijing: People's Post & Telecommunication Publication House, 1996 (in Chinese).陈国良,王煦法,庄镇泉,等.遗传算法及其应用.北京:人民邮电出版社,1996.
    [6] Mehrotha, K., Mohan, C.K., Ranka, S. Elements of Artificial Neural Network. Cambridge: MA: MIT Press, 1997.
    [7] Kennedy, M.P., Chua, L.O. Neural networks for nonlinear programming. IEEE Transactions on Circuit and System, 1988,35(5):554~562.
    [8] Zak, S.H., Uptising, V., Hui, S. Solving linear programming problems with neural networks: a comparative study. IEEE Transactions on Neural Networks, 1995,6(6):94~104.
    [9] Xia, Y. A new neural network for solving linear and quadratic programming problems. IEEE Transactions on Neural Networks, 1996,7(6):1544~1547.
    [10] Xia, Y. New neural network for solving extended linear programming problems. IEEE Transactions on Neural Networks, 1997,8(3):803~806.
    [11] Tao, Qing, Fang, Ting-jian. A kind of neural network for solving quadratic programming problems on a closed convex set. Pattern Recognition and Artificial Intelligence, 1998,11(1):7~11 (in Chinese).陶卿,方廷健.一种求解闭凸集上二次规划问题的神经网络模型.模式识别与人工智能,1998,11(1):7~11.
    [12] Tao, Qing, Fang, Ting-jian. The neural network based on the constraints domain and is applications. Pattern Recognition and Artificial Intelligence, 1998,11(4):474~478 (in Chinese).陶卿,方廷健.基于约束区域的神经网络模型及其应用.模式识别与人工智能,1998,11(4):474~478.
    [13] Tao, Qing. The neural network based on the constraints domain and its applications in optimization and associative memory [Ph.D. Thesis]. Hefei: University of Science and Technology of China, 1999 (in Chinese).陶卿.基于约束区域的神经网络模型及其在优化和联想记忆中的应用[博士学位论文].合肥:中国科学技术大学,1999.
    [14] Li, J., Michel, A.N., Porod, W. Analysis and synthesis of a class of neural networks: linear systems operating on a closed hypercuber. IEEE Transactions on Neural Networks, 1989,36(11):1405~1422.
    [15] Tao, Qing, Fang, Ting-jian, Liu, Xin. The neural network based on the constraints domain and LSSM. Pattern Recognition and Artificial Intelligence, 2000,13(1):28~31 (in Chinese).陶卿,方廷健,刘欣.基于约束区域的神经网络模型与LSSM.模式识别与人工智能,2000,13(1):28~31.
    [16] Zhang, Qing-fu, Jiao, Li-cheng, Bao, Zheng. A kind of new neural network for linear programming. Acta Electronica Sinica, 1992,20(10):44~49 (in Chinese).张青富,焦李成,保铮.一种新的求解线性规划的神经网络.电子学报,1992,20(10):44~49.
    [17] Yang, Re-li, Wu, Cang-pu. A kind of new neural network for nonlinear programming problems. Acta Automatica Sinica, 1996,22(3):293~299 (in Chinese).杨若黎,吴仓浦.一种新的非线性规划的神经网络模型.自动化学报,1996,22(3):293~299.
    [18] Tao, Qing, Fang, Ting-jian, Sun, De-min. The continuous neural network based on the constraints domain for associative memory. Chinese Journal of Computers, 1999,22(12):1253~1258 (in Chinese).陶卿,方廷健,孙德敏.基于约束区域的连续时间联想记忆神经网络.计算机学报,1999,22(12):1253~1258.
    [19] Yun, Qing-xia, Huang, Guang-qiu, Wang, Zhan-quan. Genetic Algorithm and Genetic Programming——a Kind of Technique for Searching Optimum. Beijing: Metallurgy Industrial Publication House, 1997 (in Chinese). 云庆夏,黄光球,王战权.遗传算法和遗传规划——一种搜索寻优技术.北京:冶金工业出版社,1997.
    Comments
    Comments
    分享到微博
    Submit
Get Citation

陶卿,曹进德,孙德敏,方廷健.基于约束区域神经网络的动态遗传算法.软件学报,2001,12(3):462-467

Copy
Share
Article Metrics
  • Abstract:3618
  • PDF: 4572
  • HTML: 0
  • Cited by: 0
History
  • Received:July 20,1999
  • Revised:December 08,1999
You are the first2032800Visitors
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