機率性負載量與預算限制下求算多種商品利用貨櫃運輸之可靠度問題

摘要

本文討論將某特定供應商特定數量之多種商品(multicommodity)委由運輸公司利用貨櫃運輸至某一客戶處之可靠度問題：考慮運輸公司能夠調派的貨櫃數量並非固定而是機率性且供應商本身有運輸預算的限制下，求算運輸可靠度（即能夠成功運輸至客戶處之機率），本文首先將此問題以流量限制網路(capacitated-flow network)模式表示，在相同之需求量及預算要求下，針對兩種不同的貨櫃裝載情況分別提出簡便的演算法以求出運輸可靠度，並以實例說明。

Abstract

This paper considers a transportation problem in which multiple types of commodities are transported simultaneously from one supplier to a customer via intermediate stations given that the amount of containers of transportation company can be dispatched to the supplier is probabilistic. Under the budget constraint, we try to evaluate the probability (transportation reliability) that the required amount of all types of commodity can be transported successfully. We first establish a capacitated-flow network to formulate such a transporta tion problem and then propose two efficient algorithms to evaluate the transportation reliability by considering two different container-dispatch cases, respectively.

關鍵字:

• 機率性負載量
• 多商品
• 運輸可靠度
• 貨櫃運輸
• 流量限制網路

Keywords:

• Probabilistic capacity
• multicommodity
• transportation reliability
• container transportation
• capacitated-flow network