期刊文献+

代理模型辅助的初始可行解产生方法

Surrogate Model-Based Initial Feasible Solution Generation Method
下载PDF
导出
摘要 采用约束保持法求解单目标约束优化问题时,初始化产生可行解的过程存在计算费时问题。因此提出了代理模型辅助的初始可行解产生方法,采用径向基函数构建代理模型,在初始解的产生过程中,预先使用代理模型估计试验粒子的约束冲突值,若满足约束才进行实际计算,从而减少粒子的评价次数以提高算法效率。采用该方法对多个标准函数进行测试,结果表明,与现有算法相比,所提算法生成相同数量的可行解评价次数会大大减少。该算法可以有效解决利用约束保持法求解单目标约束优化问题时初始解产生耗时的问题。 When the constraint-maintaining method is used to solve the single-objective constrained optimization problem,the process of initializing the feasible solution is time consuming・So the surrogate model-assisted initial feasible solution generation method is proposed.The radial basis function is used to construct the surrogate model.In the initial solution generation process,the surrogate model is firstly used to estimate the constraint conflict value of the test particle.And if the constraint is satisfied,the actual calculation is performed.Therefore,the algorithm can improve the efficiency by reducing the number of evaluations of the particles.Tests on standard functions show that compared with the existing algorithms,when the proposed algorithm produces the same number of feasible solutions,the number of evaluations is greatly reduced.The proposed algorithm can be used to effectively solve the time-consuming problem of the initial solution when solving the single-objective constrained optimization problem by the constraint preservation method.
作者 朱珂 张国晨 谭瑛 孙超利 ZHU Ke;ZHANG Guo-chen;TAN Ying;SUN Chao-li(Department of Computer Science and Technology Taiyuan University of Science and Technology,Taiyuan 030024,China)
出处 《太原科技大学学报》 2022年第1期1-6,14,共7页 Journal of Taiyuan University of Science and Technology
基金 国家自然科学基金(61876123) 山西省自然科学基金(201801D121131) 山西留学回国人员科技活动择优资助项目(201805D211028) 太原科技大学博士启动基金(20162029)。
关键词 约束保持法 单目标约束优化 计算费时问题 代理模型 径向基函数 constraint preservation method single-objective constrained optimization problem of time consuming surrogate model radial basis function
  • 相关文献

参考文献4

二级参考文献32

  • 1王俊年,申群太,沈洪远,周鲜成.基于多种群协同进化微粒群算法的径向基神经网络设计[J].控制理论与应用,2006,23(2):251-255. 被引量:19
  • 2周树德,孙增圻.分布估计算法综述[J].自动化学报,2007,33(2):113-124. 被引量:209
  • 3杨诗琴,须文波,孙俊.用于多峰函数优化的改进小生境微粒群算法[J].计算机应用,2007,27(5):1191-1193. 被引量:7
  • 4Fogel D B.An Introduction to Simulated Evolutionary Optimization[J].IEEE Trans on Neural Networks, 1994;5 (1) :3~14
  • 5Joines J A,Houck R C.On the Use of Non-stationary Penalty Functions to Solve Nonlinear Constrained Optimization Problems withGA's[C].In:Proc IEEE Int Conf of Evol Comp,1994:579~585
  • 6Kennedy J,Eberhart R C.Particule Swarm Optimization[C].In:Proc IEEE Int Conf of Neural Networks ,Piscataway ,NJ, 1995: 1942~1948
  • 7Parsopoulos K E.Stretching technique for Obtaining Global Minimizes Through Particle Swarm Optimization[C].In:Proc Particle workshop,Indianpolis ( IN ), USA, 2001: 22~29
  • 8Parsopoulos K E.Initializing the Particle Swarm Optimizer Using the Nonlinear Simplex Method[C].In:Advances in Intelligent Systems,Fuzzy Systems,Evolutionary Computation. WSEAS Press,2002:216~221
  • 9Kennedy J ,Eberhart R C.Swarm Intelligence[M].Morgan Kaufmann,2001
  • 10Parsopoulos K E,Parsopoulos M N.Modification of the particle Swarm Optimizer for Locating All the Global Minima,Artificial Neural Networks and Genetic Algorithm[M].Springer,2001:324~327

共引文献161

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部