This paper discusses the properties of capacity restraint assignments in traffic analysis when only one travel time function is assumed on each link of the network, the capacity of a link being defined as the maximum permissible flow on that link. Two types of assignment criteria are dealt with: (a) individual optimum assignment, in which the travel times on all used routes are equal to one another, and are not greater than the travel time which would be experienced by a single driver on any unused route: this can be formulated as a game theory problem; (b) network optimum assignment, in which the total travel time spent by all the vehicles in the network is minimised: this can be formulated as a non-linear programming problem. The properties of individual optimum assignments are considered under asymptotic capacity restraint conditions and under cut-off capacity restraint conditions. /TRRL/

  • Availability:
  • Corporate Authors:

    Indian Roads Congress

    Jamnagar House, Shahjahan Road
    New Delhi,   India  110 011
  • Authors:
    • Anantharamajah, K M
  • Publication Date: 1974-12


  • English

Media Info

  • Features: Figures; References;
  • Pagination: p. 5-10
  • Serial:
    • Indian Highways
    • Volume: 2
    • Issue Number: 12
    • Publisher: Indian Roads Congress
    • ISSN: 0376-7256

Subject/Index Terms

Filing Info

  • Accession Number: 00128295
  • Record Type: Publication
  • Source Agency: Transport and Road Research Laboratory (TRRL)
  • Files: ITRD, TRIS
  • Created Date: Apr 7 1976 12:00AM