A probabilistic multipath traffic assignment model which obviates path enumeration

https://doi.org/10.1016/0041-1647(71)90012-8Get rights and content

First page preview

First page preview
Click to open first page preview
View PDF

References (27)

  • M. Sakarovitch

    The k shortest chains in a graph

    Transpn Res.

    (1968)
  • F.A. Tillman et al.

    An iterative approach to traffic assignment

    Transpn Res.

    (1968)
  • H.W. Bewis

    A Probabilistic Model for Highway Traffic Assignment

  • R.M. Brown

    Expressway route selection and vehicular usage

    Bull. Highw. Res. Bd

    (1948)
  • R.M. Brown et al.

    Traffic assignment using IBM computations and summation

    Bull. Highw. Res. Bd

    (1956)
  • Bureau of Public Roads

    Traffic Assignment Manual

    (1964)
  • Bureau of Public Roads

    Urban Planning Program System for IBM System/360

    (1968)
  • Bureau of Public Roads

    Urban Transportation Planning, General Information and Introduction to System/360

    (1970)
  • Bureau of Public Roads

    Program Documentation, Urban Transportation Planning System/360

    (1970)
  • California Division of Highways

    Trip Development and Network Analysis Handbook

    (1968)
  • E.W. Campbell

    A mechanical method for assigning traffic to expressways

    Bull. Highw. Res. Bd

    (1956)
  • J.D. Carrol

    A method of assignment to an urban network

    Bull. Highw. Res. Bd

    (1959)
  • A. Charnes et al.

    Multicopy traffic network models

    • Cited by (0)

    †

    This report, carried out under U.S. Department of Transportation Contract FH-11-6972, includes portions of the author's Ph.D. dissertation.

    View full text
    Copyright © 1971 Published by Elsevier Ltd.