首页> 外文会议>IEEE International Conference on Computer-Aided Design and Computer Graphics >Generalized Dynamic Constraint Satisfaction Based on Extension Particle Swarm Optimization Algorithm for Collaborative Simulation
【24h】

Generalized Dynamic Constraint Satisfaction Based on Extension Particle Swarm Optimization Algorithm for Collaborative Simulation

机译:基于扩展粒子群优化算法进行协作仿真的广义动态约束满意度

获取原文

摘要

A novel Adaptive Mutation Particle Swarm Optimization (AMPSO) algorithm based on Fuzzy matter-element analysis for Generalized Dynamic Constraints Satisfaction (GDCS) was presented to resolve the coupling domain level and knowledge level constraints introduced by collaborative simulation results. Firstly, the Fuzzy Relation-element Optimization Method (FREOM) was used to change the solution space into the optimization space by establishing the formalized model of fuzzy relation-element for GDCS, and the regulated correlation function was regarded as the fitness function judging the stand and fall of particle; Then, in the implementation process of PSO algorithm, the mutation mechanics was introduced to mutate the inactive particle and the particle with the smallest fitness according to mutation probability, which is intended to make the algorithm converge faster and respond better to changes in dynamic optimization problems; Finally, a design example is illustrated to show effectiveness of this proposed method.
机译:提出了一种基于模糊物质 - 元素分析的新型自适应突变粒子群优化(AMPSO)算法,用于广义的动态约束满足(GDC)来解决通过协作仿真结果引入的耦合域级和知识水平约束。首先,通过建立GDC的模糊关系元件的形式化模型来使用模糊关系元素优化方法(Freom)将解决方案空间改变为优化空间,并且将调节的相关函数被认为是判断架子的健身功能和颗粒的堕落;然后,在PSO算法的实施过程中,引入突变力学以根据突变概率将突变力学与最小的适应性突变,这旨在使算法更快地收敛并更好地响应动态优化问题的变化;最后,示出了设计示例以显示出这种方法的有效性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号