English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 49064/83169 (59%)
造访人次 : 6959708      在线人数 : 65
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻


    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/109394


    题名: Reliability Evaluation of a Multicommodity Capacitated-Flow Network in Terms of Minimal Pathsets
    作者: Lin, jsen-shung
    关键词: Reliability;capacitated-flow network;d-MP
    日期: 2016
    上传时间: 2017-02-13 16:09:46 (UTC+8)
    出版者: 淡江大學出版中心
    摘要: Many real-world systems such as transportation systems, logistics/distribution systems, and manufacturing systems can be regarded as multicommodity flow networks whose arcs
    have independent, finite and multi-valued random capacities. Such a flow network is a
    multistate system with multistate components and its reliability for level d = (d1, d2, . . . , dk), i.e., the probability that k different types of commodity can be transmitted from the source node to the sink node in the way that the demand level d = (d1, d2, . . . , dk) is satisfied, can be computed in terms of minimal path vectors to level d (named d-MPs here). The main objective of this paper is to present a simple algorithm to generate all d-MPs of such a flow network for each level d = (d1, d2, . . . , dk) in terms of minimal pathsets. Three examples are given to illustrate how all d-MPs are generated by our algorithm and then the reliability of one example is computed.
    關聯: International Journal of Information and Management Sciences 27(3), pp.269-281
    DOI: 10.6186/IJIMS.2016.27.3.4
    显示于类别:[資訊與管理科學期刊] 第27卷第3期

    文件中的档案:

    档案 描述 大小格式浏览次数
    index.html全文連結0KbHTML27检视/开启

    在機構典藏中所有的数据项都受到原著作权保护.

    TAIR相关文章

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - 回馈