TRAFFIC FLOW IN A NETWORK--A GRAPH-THEORETICAL METHOD OF OPTIMIZATION

VERKEHRSABLAUF IN NETZEN--EIN GRAPHENTHEORETISCHES OPTIMIERUNGSVERFAHREN

Besides the construction of new roads and the improvement of the existing ones, traffic control is another means to avoid or diminish bottlenecks. Based on the two WARDROP principles on trip distribution in the network, e.g. individual and system optimum distribution, a graph-theoretical procedure is applied which by means of incremental graph algorithms evaluates both situations in a comprehensive model. Depending on the road standards and the load of the network links, the individual optimum clearly contrasts with the system optimum, of which the current planning methodology does not supply any information. In the course of the graph-theoretical method of optimization, traffic streams are indicated which are to be diverted to achieve the system optimum, thus suggesting an implement of traffic control. It is demonstrated that the network time effort, i.e. the total of all travel time in the network, can be reduced or in other words, that the individual optimum can be approached to the system optimum. /Author/

• Corporate Authors:

  Technical University of Karlsruhe, West Germany

  Kaiserstrasse 12
  D-7500 Karlsruhe,   Germany 
• Authors:
  • Sahling, B M
• Publication Date: 1977

Media Info

• Features: Appendices; Figures; Tables;
• Pagination: 131 p.

Subject/Index Terms

• TRT Terms: Mathematical models; Optimization; Traffic congestion; Traffic control; Traffic flow; Travel time; Trip distribution
• Subject Areas: Highways; Operations and Traffic Management;

Filing Info

• Accession Number: 00173222
• Record Type: Publication
• Report/Paper Numbers: Report No. 16
• Files: TRIS
• Created Date: Apr 26 1978 12:00AM