OPTIMAL TRAFFIC ASSIGNMENT WITH ELASTIC DEMANDS: A REVIEW -- 2. ALGORITHMIC APPROACHES

The paper examines algorithmic approaches for calculating the flow patterns resulting from the different modes of assignment. An efficient methodology for solving the elastic-demand TAP is based on remodeling it as an equivalent assignment problem in an expanded network. The variable-demand TAP is then transformed into a fixed-demand TAP, with a trip table consisting of the potential demands, and can be solved by available fixed-demand assignment algorithms. Three alternative transformations are described.

  • Availability:
  • Corporate Authors:

    Operations Research Society of America

    428 East Preston Street
    Baltimore, MD  USA  21202
  • Authors:
    • Gartner, N H
  • Publication Date: 1980-5

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 00329632
  • Record Type: Publication
  • Source Agency: Engineering Index
  • Files: TRIS
  • Created Date: Apr 15 1981 12:00AM