THE DUAL OF THE TRAFFIC ASSIGNMENT PROBLEM WITH ELASTIC DEMANDS

This article is concerned with the dual of the traffic assignment problem, and of the combined generation, distribution, and assignment problem. The duals, and duality relations, for the arc-chain and node-arc formulations of the problem are derived using only the Kuhn-Tucker conditions for convex programs. This has the advantage of being more familiar to most readers than the conjugate function presentation which has been used elswhere. (Author/TRRL)

• Corporate Authors:

  Bumpus, Haldane and Maxwell Limited

  Document Centre, Cowper Works
  Olney, Bucks MK46 4BN,   England 
• Authors:
  • Carey, M
• Publication Date: 1985-6

Media Info

• Features: Figures; References;
• Pagination: p. 227-237
• Serial:
  • Volume: 19B
  • Issue Number: 3

Subject/Index Terms

• TRT Terms: Demand; Mathematical models; Physical distribution; Problem solving; Traffic; Traffic assignment; Traffic distribution; Trip generation
• ITRD Terms: 285: Demand (econ); 9016: Distribution (gen); 663: Generated traffic; 6473: Mathematical model; 755: Traffic; 679: Traffic assignment
• Subject Areas: Freight Transportation; Highways; Operations and Traffic Management; Planning and Forecasting;

Filing Info

• Accession Number: 00451968
• Record Type: Publication
• Source Agency: Transport Research Laboratory
• Files: ITRD, TRIS
• Created Date: May 31 1986 12:00AM