...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>International journal of systems assurance engineering and management >Troop search optimization algorithm for constrained problems
【24h】

Troop search optimization algorithm for constrained problems

机译：约束问题的部队搜索优化算法

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Troop search optimization (TSO) algorithm is motivated by the dynamic controls of commander/captain over the troops before (during) each combat operation to concoct (active) a bravery battalion force. The attempt is focused to maintain the proper balance between exploration and exploitation in the search space during simulation. The inclusion of operators like ‘swapping crossover’ and ‘cut and fill’ provides additional features in TSO algorithm to make it more robust. The efficiency of TSO is tested over a set of constrained optimization problem test suite CEC 2010. Apart from that, TSO is also employed to solve five real life constrained engineering optimization problems. The empirical results, comparative statistical and graphical analysis concludes with the superiority of TSO over the state-of-art algorithms in solving constrained optimization problems.
机译：部队/司令部的动态控制是在每次战斗行动之前（期间）炮制（活跃）英勇的营力来推动部队搜索优化（TSO）算法的。尝试着重在模拟过程中在搜索空间中的探索和开发之间保持适当的平衡。包括“交换分频器”和“剪切和填充”之类的运算符，在TSO算法中提供了其他功能，使其更加强大。在一组受限优化问题测试套件CEC 2010上测试了TSO的效率。除此之外，TSO还用于解决五个现实生活中受限的工程优化问题。实验结果，比较统计和图形分析得出的结论是，TSO在解决约束优化问题方面优于最新算法。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号