The routing policy problem of a stochastic flow network

被引：0
|
作者：
Lin, Yi-Kuei [1 ]
Li, Kung-Chi [2 ]
机构：
[1] Natl Taiwan Univ Sci & Technol, Dept Ind Management, Taipei 106, Taiwan
[2] vanung Univ, Dept Int Business, Chungli 320, Taiwan
来源：
15TH ISSAT INTERNATIONAL CONFERENCE ON RELIABILITY AND QUALITY IN DESIGN, PROCEEDINGS | 2009年
关键词：
Routing policy; Optimal; Stochastic-flow network; Quickest path; System reliability; QUICKEST PATH PROBLEM; RELIABILITY EVALUATION; CONSTRAINT; ALGORITHM; TERMS; NODES;
D O I：
暂无
中图分类号：
T [工业技术];
学科分类号：
08 ;
摘要：
Under the assumption that each arc's capacity of the network is deterministic, the quickest path problem is to find a path sending a given amount of data from the source to the sink such that the transmission time is minimized. However, in a stochastic-flow network, the minimum transmission time is not fixed. We try to evaluate the system reliability that d units of data can be sent through the stochastic-flow network within the time constraint according to a routing policy. The solution procedure is presented to calculate the system reliability with respect to a routing policy. An efficient algorithm is subsequently proposed to derive the optimal routing policy.
引用
收藏
页码：470 / +
页数：2
相关论文
共 50 条
  • [1] Optimal routing policy of a stochastic-flow network
    Lin, Yi-Kuei
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2009, 56 (04) : 1414 - 1418
  • [2] A rollout policy for the vehicle routing problem with stochastic demands
    Secomandi, N
    [J]. OPERATIONS RESEARCH, 2001, 49 (05) : 796 - 802
  • [3] FACETS OF THE STOCHASTIC NETWORK FLOW PROBLEM
    Estes, Alexander S.
    Ball, Michael O.
    [J]. SIAM JOURNAL ON OPTIMIZATION, 2020, 30 (03) : 2355 - 2378
  • [4] A hybrid recourse policy for the vehicle routing problem with stochastic demands
    Salavati-Khoshghalb, Majid
    Gendreau, Michel
    Jabali, Ola
    Rei, Walter
    [J]. EURO JOURNAL ON TRANSPORTATION AND LOGISTICS, 2019, 8 (03) : 269 - 298
  • [5] Best routing policy problem in stochastic time-dependent networks
    Gao, Song
    Chabini, Ismail
    [J]. Transportation Research Record, 2002, (1783) : 188 - 196
  • [6] Best routing policy problem in stochastic time-dependent networks
    Gao, S
    Chabini, I
    [J]. TRANSPORTATION NETWORK MODELING 2002: PLANNING AND ADMINISTRATION, 2002, (1783): : 188 - 196
  • [7] A Stochastic Flow Network Model with Almost-Fractional Routing
    Xue, Mengran
    Roy, Sandip
    [J]. 2017 55TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING (ALLERTON), 2017, : 267 - 274
  • [8] Solving the aircraft routing problem using network flow algorithms
    Roy, Kaushik
    Tomlin, Claire J.
    [J]. 2007 AMERICAN CONTROL CONFERENCE, VOLS 1-13, 2007, : 4310 - 4315
  • [9] Routing policy choice prediction in a stochastic network: Recursive model and solution algorithm
    Mai, Tien
    Yu, Xinlian
    Gao, Song
    Frejinger, Emma
    [J]. TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2021, 151 : 42 - 58
  • [10] School bus routing problem in the stochastic and time-dependent transportation network
    Sun, Shichao
    Duan, Zhengyu
    Xu, Qi
    [J]. PLOS ONE, 2018, 13 (08):
12345