Optimal Time-Varying Flows on Congested Networks

Malachy Carey
Additional contact information
Malachy Carey: Carnegie-Mellon University, Pittsburgh, Pennsylvania

Operations Research, 1987, vol. 35, issue 1, 58-69

Abstract: This paper develops a well-behaved convex programming model for least-cost flows on a general congested network on which flows vary over time, as for example during peak/off-peak demand cycles. The model differs from static network models and from most work on multiperiod network models because it treats the time taken to traverse each arc as varying with the flow rate on the arc. We develop extensions of the model to handle multiple destinations and multiple commodities, though not all of these extensions yield convex programs. As part of its solution, the model yields a set of nonnegative time-varying optimal flow controls for each arc. We determine and discuss sufficient conditions under which some or all of these optimal flow controls will be zero-valued. These conditions are consistent with computational experience. Finally, we indicate directions for further research.

Keywords: 481 optimal dynamic flows with congestion; 691 networks; 831 dynamic traffic assignment (search for similar items in EconPapers)
Date: 1987
References: Add references at CitEc
Citations: View citations in EconPapers (34)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.35.1.58 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:35:y:1987:i:1:p:58-69

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().