ON A MULTICOMMODITY FLOW NETWORK RELIABILITY MODEL AND ITS APPLICATION TO A CONTAINER-LOADING TRANSPORTATION PROBLEM
スポンサーリンク
概要
- 論文の詳細を見る
This paper is mainly to extent the MMCF(multi-commodity minimum cost flow)problem from deterministic flow networks to stochastic cases. Under the transportation budget constraint, this paper proposes an approach to calculate the probability that the required amount of multi-commodity can be transmitted successfully through a stochastic flow network. Such a probability is called transportation reliability. An algorithm is proposed first to find out all lower boundary points for the requirement in terms of minimal paths. The transportation reliability can then be calculated in terms of such lower boundary points. A numerical example, in which two types of commodities are shipped in container under two container-loading policies, is presented to illustrate the application of such a reliability model.
- 社団法人日本オペレーションズ・リサーチ学会の論文
著者
-
Lin Y‐k
Ven Nung Inst. Technol.
-
Lin Yi-kuei
Van Nung Institute Of Technology
-
Yuan John
National Tsing Hua University
関連論文
- 多品種流ネットワーク信頼性モデルとそのコンテナ積荷輸送問題への応用
- FIND ALL LONGER AND SHORTER BOUNDARY DURATION VECTORS UNDER PROJECT TIME AND BUDGET CONSTRAINTS
- ON A MULTICOMMODITY FLOW NETWORK RELIABILITY MODEL AND ITS APPLICATION TO A CONTAINER-LOADING TRANSPORTATION PROBLEM