Computer Engineering and Applications ›› 2008, Vol. 44 ›› Issue (7): 57-59.

• 学术探讨 • Previous Articles     Next Articles

Bionic algorithm for solving nonlinear integer programming

LUO Wei-qiang,YU Jian-tao,HUANG Jia-dong   

  1. North China Electric Power University,Baoding,Hebei 071003,China
  • Received:2007-06-25 Revised:2007-09-03 Online:2008-03-01 Published:2008-03-01
  • Contact: LUO Wei-qiang

一种求非线性整数规划最优解的仿生算法

罗伟强,于建涛,黄家栋   

  1. 华北电力大学 电气工程学院,河北 保定 071003
  • 通讯作者: 罗伟强

Abstract: Be inspired from natural plant growth,this paper proposes a bionic algorithm for solving the global optimization of nonlinear integer programming.By simulating the process of plant growth and growth mode,the algorithm can rapidly access to the optimal solution.The process which solved varies types of nonlinear integer programming shows that the algorithm is very effective.

摘要: 从大自然植物生长中得到启发,提出了一种求解非线性整数规划全局最小解的仿生算法。该算法将植物生长过程及生长模式应用到非线性整数规划问题的求解,能够快速得到最优解。通过对各种不同类型非线性整数规划问题的具体求解,表明了该方法十分有效。