Optimal Control of Oversaturated Store-and-Forward Transportation Networks

G. C. D'Ans and D. C. Gazis
Additional contact information
G. C. D'Ans: IBM, Armonk, New York
D. C. Gazis: IBM, Armonk, New York

Transportation Science, 1976, vol. 10, issue 1, 1-19

Abstract: A general method is developed for the dynamic optimization of multi-commodity flows in an oversaturated, store-and-forward transportation network. The network is characterized by time-varying inputs, and the existence of queues in front of certain nodes where the incoming flows exceed the capacity to discharge them, during a certain period of oversaturation. The method consists of discretizing in time and solving a linear programming (LP) problem, in order to obtain the order of exhaustion of the various queues and an approximation to their, optimum time variation. The LP solution may be refined to any degree of desired accuracy, or used as a first step in a two-step procedure, where the order of exhaustion of the queues of the LP solution is used in a variational scheme to obtain the exact solution. The method is demonstrated by optimizing the operation of a two-node, four-queue network.

Date: 1976
References: Add references at CitEc
Citations: View citations in EconPapers (9)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.10.1.1 (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:ortrsc:v:10:y:1976:i:1:p:1-19

Access Statistics for this article

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