首页> 外文期刊>Mathematical Problems in Engineering: Theory, Methods and Applications >Chaotic Charged System Search with a Feasible-Based Method for Constraint Optimization Problems
【24h】

Chaotic Charged System Search with a Feasible-Based Method for Constraint Optimization Problems

机译:约束优化问题的基于可行方法的混沌带电系统搜索

获取原文
           

摘要

Recently developed chaotic charged system search was combined to feasible-based method to solve constraint engineering optimization problems. Using chaotic maps into the CSS increases the global search mobility for a better global optimization. In the present method, an improved feasible-based method is utilized to handle the constraints. Some constraint design examples are tested using the new chaotic-based methods, and the results are compared to recognize the most efficient and powerful algorithm.
机译:将最近开发的混沌收费系统搜索与基于可行方法的方法相结合,以解决约束工程优化问题。在CSS中使用混沌映射可以增加全局搜索的移动性,从而实现更好的全局优化。在本方法中,利用改进的基于可行性的方法来处理约束。使用新的基于混沌的方法测试了一些约束设计示例,并对结果进行了比较以识别出最有效和强大的算法。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号