摘要
为提高蚁群优化算法的求解性能,在分析了处理连续变量的蚁群优化算法的基础上,给出了两种混沌映射的映射规则,并构建了基于Logistic映射的混沌蚁群优化方法(LM-ACO)以及基于Henon映射的混沌蚁群优化方法(HM-ACO),给出了k次均方根包络函数简化及平滑多约束条件的处理方法。采用LM-ACO、HM-ACO以及蚁群处理连续变量的优化方法分别对机械有约束优化实例进行求解,在求解过程中,从各种方法获得的最优解、成功率指标、平均有效迭代数、迭代占用时间等方面作对比。比较结果表明:采用基于Henon映射的蚁群混合优化方法具有求解精度高、优化效率高等优点。
In order to improve the solving performance of Ant Colony Optimization（ACO）,firstly the ACO method which deals with the optimal problem with continuous variable is analyzed and mapping rules for two types of chaos map are given.Next,ACO based on Logistic Map（LM-ACO） and Henon Map（HM-ACO） are constructed,and the method which adopts k mean-square-root envelope function to reduce and smooth multi-constraints is given.To compare the performance of LM-ACO,HM-ACO and the ACO,the three methods are used to solve the pressure vessel constrained optimal problem.Their performances are compared in terms of optimal solution,success ratio,average valid evaluation number,iterative occupancy hours and so on.Comparison results indicate that the HM-ACO has many advantages such as higher solution accuracy and higher computational efficiency
出处
《计算机工程与应用》
CSCD
北大核心
2011年第13期42-45,102,共5页
Computer Engineering and Applications
基金
河南省科技计划项目(No.112300410234)
河南省教育厅青年骨干教师计划项目(No.2009GGJS-075)
河南省教育厅自然基础计划资助项目(No.2010A520034)
