A general method is developed for the dynamic optimization of multicommodity 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 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 tow-node, four-queue network.

  • Availability:
  • Corporate Authors:

    Operations Research Society of America

    428 East Preston Street
    Baltimore, MD  United States  21202
  • Authors:
    • D'Ans, G C
    • Gazis, D C
  • Publication Date: 1976-2

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 00134759
  • Record Type: Publication
  • Files: TRIS
  • Created Date: Jul 13 1976 12:00AM