...
首页> 外文期刊>International Journal of Pattern Recognition and Artificial Intelligence >COMPETITIVE ANALYSIS FOR THE MOST RELIABLE PATH PROBLEM WITH ONLINE AND FUZZY UNCERTAINTIES
【24h】

COMPETITIVE ANALYSIS FOR THE MOST RELIABLE PATH PROBLEM WITH ONLINE AND FUZZY UNCERTAINTIES

机译:具有在线和模糊不确定性的最可靠路径问题的竞争分析

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

摘要

Based on some results of the fuzzy network computation and competitive analysis, the Online Fuzzy Most Reliable Path Problem (OFRP), which is one of the most important problems in network optimization with uncertainty, has been originally proposed by our team. In this paper, the preliminaries about fuzzy and the most reliable path and competitive analysis are given first. Following that, the mathematical model of OFRP, in which two kinds of uncertainties, namely online and fuzzy, are combined to be considered at the same time, is established. Then some online fuzzy algorithms are developed to address the OFRP and the rigorous proofs of the competitive analysis are given in detail. Finally, some possible research directions of the OFRP are discussed and the conclusions are drawn.
机译:基于模糊网络计算和竞争分析的一些结果,我们的团队最初提出了在线模糊最可靠路径问题(OFRP),它是不确定性网络优化中最重要的问题之一。本文首先给出了模糊,最可靠路径和竞争分析的初步信息。随后,建立了将在线和模糊两种不确定性同时考虑的OFRP数学模型。然后开发了一些在线模糊算法来解决OFRP问题,并给出了竞争分析的严格证明。最后,讨论了OFRP的一些可能的研究方向并得出结论。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号