MODEL AND AN ALGORITHM FOR THE DYNAMIC TRAFFIC ASSIGNMENT PROBLEMS

A discrete time model is presented for dynamic traffic assignment with a single destination. Congestion is treated explicitly in the flow equations. The model is a nonlinear and nonconvex mathematical programming problem. A piecewise linear version of the model, with additional assumptions on the objective function, can be solved for a global optimum using a one-pass simplex algorithm -- branch-and-bound is not required. The piecewise linear program has a staircase structure and can be solved by decomposition techniques or compactification methods for sparse matrices.

  • Availability:
  • Corporate Authors:

    Operations Research Society of America

    428 East Preston Street
    Baltimore, MD  USA  21202
  • Authors:
    • Merchant, D K
    • Nemhauser, G L
  • Publication Date: 1978-8

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 00195398
  • Record Type: Publication
  • Source Agency: Engineering Index
  • Files: TRIS
  • Created Date: Aug 15 1979 12:00AM