正交文化算法及其在布局优化问题中的应用  

Orthogonal cultural algorithm and its application in layout optimization

作　　者：李霞[1] 张敬敏[1] 李瑞华 刘坤起[1,3] 

机构地区：[1]石家庄经济学院信息工程学院,石家庄050031 [2]阳泉师范高等专科学校,山西阳泉045200 [3]中国地质大学计算机学院,武汉430074

出　　处：《计算机工程与应用》2012年第12期239-243,共5页Computer Engineering and Applications

基　　金：国家自然科学基金(No.40772196);河北省科技计划项目(No.11203525D)

摘　　要：布局优化问题是工程应用中普遍存在的一种组合优化问题,属于NP完备问题。针对布局优化问题,将差异演化算法和郭涛算法融入文化算法的框架,利用正交设计方法初始化种群,提出了一种正交文化算法。通过对一个带约束的和一个较大规模的不带约束的布局优化问题进行性能比较,验证了该算法的可行性和有效性。Layout optimization problems arise widely in engineering applications and are now recognized as an important category of combinatorial optimization problems.They are NP-Complete.To sovle the layout optimization problem,an orthogonal cultural algorithm is proposed by integrating the differential evolution algorithm and Guotao algorithm into the culture algorithm framework.The algorithm uses the orthogonal design to generate initial population.They compare the performance of the system on a constrained layout optimization and on a large-scale unconstrained test case.Experimental results demonstrate a dramatic improvement on the precision of layout result,and the algorithm efficiency has been demonstrated.

关 键 词：布局优化 正交设计 差异演化算法 郭涛算法 文化算法 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]