Single‐path routing of stochastic flows in networks

Single‐path routing of stochastic flows in networks

0.00 Avg rating0 Votes
Article ID: iaor20133248
Volume: 39
Issue: 2
Start Page Number: 92
End Page Number: 98
Publication Date: Mar 2011
Journal: Operations Research Letters
Authors:
Keywords: vehicle routing & scheduling
Abstract:

The paper revisits a very simple network routing and dimensioning model, with two specific assumptions: the traffic amounts to be routed are Gaussian random variables, and each commodity must use one single route in the network. The need to control congestion leads naturally to probabilistic constraints. The impact of stochastic assumptions on solution algorithms is investigated, when compared to the usual deterministic case.

Reviews

Required fields are marked *. Your email address will not be published.