李伟勤, 李新献, 施岱松. 多约束天线阵列遗传优化中的初始群体构造方法[J]. 微电子学与计算机, 2012, 29(2): 133-137.
引用本文: 李伟勤, 李新献, 施岱松. 多约束天线阵列遗传优化中的初始群体构造方法[J]. 微电子学与计算机, 2012, 29(2): 133-137.
LI Wei-qin, LI Xin-xian, SHI Dai-song. A Scheme to Construct Genetic Feasible Group for the Plane Arrays Optimization[J]. Microelectronics & Computer, 2012, 29(2): 133-137.
Citation: LI Wei-qin, LI Xin-xian, SHI Dai-song. A Scheme to Construct Genetic Feasible Group for the Plane Arrays Optimization[J]. Microelectronics & Computer, 2012, 29(2): 133-137.

多约束天线阵列遗传优化中的初始群体构造方法

A Scheme to Construct Genetic Feasible Group for the Plane Arrays Optimization

  • 摘要: 针对运用遗传算法进行圆形口径的平面稀布天线阵列的优化设计, 提出了一种有效的初始群体构造方法, 它能满足多个实际工程设计的约束条件.由此方法构造的初始可行解可作为遗传算法的个体, 从而组建初始群体, 它为多约束遗传优化算法的运用提供了可行性.该方法的正确性和有效性也得以认证.

     

    Abstract: For the problem of optimum design of the sparse circular aperture arrays with multiple constraints, an new approach to build the initial feasible solution which meet multiple design constraints are presented in this paper.This approach can meet the multiple design constrains of the engineering design.The initial group formed by this method is always feasible group for the genetic algorithms.It has provided the necessity and the feasibility for the application of GA, at last, the correctness and effectiveness of the algorithm are verified.

     

/

返回文章
返回