SUCCESSIVE LINEAR OPTIMIZATION APPROACH TO THE DYNAMIC TRAFFIC ASSIGNMENT PROBLEM

A dynamic model for the optimal control of traffic flow over a network is considered. The model, which treats congestion explicity in the flow equations, gives rise to nonlinear, nonconvex mathematical programming problems. It has been shown for a piecewise linear version of this model that a global optimum is contained in the set of optimal solutions of a certain linear program. This paper presents a sufficient condition for optimality which implies that a global optimum can be obtained by successively optimizing at most N + 1 objective functions for the linear program, where N is the number of time periods in the planning horizon.

  • Availability:
  • Corporate Authors:

    Operations Research Society of America

    428 East Preston Street
    Baltimore, MD  United States  21202
  • Authors:
    • Ho, J K
  • Publication Date: 1980-11

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 00334758
  • Record Type: Publication
  • Source Agency: Engineering Index
  • Files: TRIS
  • Created Date: Oct 28 1981 12:00AM