首页> 外文期刊>International Journal of Information Technology & Decision Making >Solving Dynamic Multi-Criteria Resource-Target Allocation Problem Under Uncertainty: A Comparison of Decomposition and Myopic Approaches
【24h】

Solving Dynamic Multi-Criteria Resource-Target Allocation Problem Under Uncertainty: A Comparison of Decomposition and Myopic Approaches

机译:解决不确定性下的动态多标准资源 - 目标分配问题:分解和近视方法的比较

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

摘要

This paper is concerned with multi-criteria and dynamic resource allocation problem in a naval engagement context. The scenario under investigation considers air threats directed towards a ship that has to plan its engagement by efficiently allocating the available weapons against the threats to maximize its survivability. This dynamic and multi-criteria decision-making problem is modeled using a multi-criteria decision tree and solved with two approaches: the multi-criteria decomposition approach and the multi-criteria myopic approach. We propose a novel metric for comparing two strategies within a multi-criteria decision tree and have developed a testbed in order to simulate the engagements. The results show that, when sufficient decomposition conditions are verified, the decomposition approach produces superior decision-making strategies compared to the myopic approach. Conversely, when the multi-criteria decision aid (MCDA) method does not satisfy the decomposition conditions (e.g., TOPSIS), there is no guarantee that decomposition will provide the best compromise strategies. From a military perspective, this work will help develop tactics, procedures and training packages for such a highly complex and dynamic decision-making problem. The plans generated by the approach presented here can also serve as a reference for assessment of the quality of the engagement plans yielded by real-time planning algorithms.
机译:None

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号