...
首页> 外文期刊>International Journal of Innovative Computing Information and Control >A PERMUTATION ALGORITHM FOR LASER ANTIMISSILE STRATEGY OPTIMIZATION
【24h】

A PERMUTATION ALGORITHM FOR LASER ANTIMISSILE STRATEGY OPTIMIZATION

机译:激光优化策略的置换算法

获取原文
获取原文并翻译 | 示例
           

摘要

This paper focuses on a dynamical laser antimissile problem in real-time application. When faced with multiple attacking targets, it is important for the laser antimissile system to determine the attacking sequence in order to destroy more targets. Conceptually, this laser antimissile problem can be seen as a dynamical traveling salesman problem, which is much harder than a pure traveling salesman problem. It is extremely difficult to find the global optimal solution, especially when the number of the targets is greater than six. This paper introduces a fast algorithm for this problem based on two exchange strategies - the adjacent exchange and the symmetric exchange. With a given initial sequence, the adjacent exchange strategy searches for a local optimal sequence among neighbors fast. The symmetric exchange will search in a larger region so as to jump out from the local optimal solution. The combination of the two exchange strategies increases the probability of finding the global optimal solution. For illustration, a case with eight attacking targets is simulated. The results show the convergence of the proposed algorithm is very fast and it is a highly practical method. Interestingly, the local optimal solution obtained is, indeed, quite close to the global one.
机译:本文重点研究实时应用中的动态激光反导问题。当面对多个攻击目标时,激光反导系统确定攻击顺序以摧毁更多目标非常重要。从概念上讲,此激光反导问题可以看作是动态的旅行推销员问题,它比单纯的旅行推销员问题难得多。很难找到全局最优解,尤其是当目标数量大于六个时。本文基于相邻交换和对称交换两种交换策略,提出了一种针对该问题的快速算法。对于给定的初始序列,相邻交换策略可在邻居之间快速搜索局部最优序列。对称交换将在更大的区域中搜索,以便从局部最优解中跳出来。两种交换策略的组合增加了找到全局最优解的可能性。为了说明,模拟了一个具有八个攻击目标的案例。结果表明,该算法的收敛速度非常快,是一种非常实用的方法。有趣的是,获得的局部最优解的确与全局解非常接近。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号