SOLUTION TECHNIQUES FOR THE TRAFFIC ASSIGNMENT PROBLEM

Abstract

The paper investigates the application of some large scale solution techniques to the so called traffic assignment problem, or multicommodity flow problem. As this is a network problem, there are two equivalent formulations. The first is based on the node-arc incidence matrix and is the usual approach. The second is based on an arc-chain matrix and the formulation is an extension of Ford and Fulkerson's multi-commodity work. Decomposition techniques are applied to the first formulation and a minimum chain network approach applied to the second. Then an extension of the arc-chain formulation shows it is equivalent to decomposition theory being applied to a slightly different node- arc formulation.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jun 01, 1965
Accession Number
AD0649828

Entities

People

  • Stephen P. Bradley

Organizations

  • University of California, Berkeley

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Commodities
  • Computations
  • Computer Programming
  • Decomposition
  • Dynamic Programming
  • Engineering
  • Equations
  • Iterations
  • Linear Programming
  • Military Research
  • Operations Research
  • Simplex Method
  • Travel Time
  • United States
  • United States Government

Readers

  • Operations Research