摘要
本文利用遗传算法GA处理离散非凸问的优势,提出将序列二次规划法,改进的外罚函数法与GA法结合,并提出了进行可行性调整的新策略。
In this paper, a new algorithm is proposed for optimizing large complicated structures It bases on the genetic algorithm (GA), the sequential quadratic programming algorithm and the improved outer penalty function algorithm It has the same advantage as GA in dealing with the discrete, non -convex problem At the same time, new tactics dealing with the regulation of feasibility are also proposed
出处
《燕山大学学报》
CAS
1998年第2期95-99,共5页
Journal of Yanshan University