The Stochastic Dynamic Traffic Assignment Problem.

Abstract

This paper presents a method for solving a stochastic version of the dynamic traffic assignment problem. It shows that a globally optimal solution may be obtained by a sequence of linear optimizations. A decomposition algorithm for this procedure is presented that efficiently solves large-scale problems. Solution examples with up to sixty-six thousand variables are described. Keywords: Stochastic programming; Traffic assignment; Multi-Stage problems.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1987
Accession Number
ADA185497

Entities

People

  • James K. Ho
  • John R. Birge

Organizations

  • University of Michigan

Tags

Communities of Interest

  • Human Systems

DTIC Thesaurus Topics

  • Algorithms
  • Business Administration
  • Computer Networks
  • Computer Programming
  • Computers
  • Decomposition
  • Engineering
  • Iterations
  • Linear Programming
  • Mathematical Programming
  • Michigan
  • Military Research
  • Operating Systems
  • Optimization
  • Simplex Method
  • Universities

Readers

  • Operations Research