A heuristic algorithm for a stochastic transportation network

Abstract

A stochastic version of the classical transportation problem is presented. In this model, each arc of the network connects a supply node to a demand node, and the flow of units travelling along each arc of the network forms a stochastic process. In this paper, a heuristic algorithm is presented to obtain the optimal flow rate along each arc of the network such that the total transportation cost is minimized, the total supply rate is equal to the total demand rate, and the average congestion along each arc does not exceed its capacity

Keywords:

• Transportation Network
• Stochastic Optimization
• Approximation, Heuristic Algorithm