THE OPTIMAL STRONGLY CONNECTED ORIENTATIONS OF CITY STREET GRAPHS. II: TWO EAST-WEST AVENUES OR NORTH-SOUTH STREETS

Strongly connected orientations of graphs arise in connection with problems of traffic flow where the idea is to make every street in a network one-way so as to move traffic more effectively. Strongly connected orientations have been studied, as have arbitrary graphs with large N1 and n2 values. In this paper the authors explore the most efficient orientations for networks with small n1 and N2 values. Optimum orientations are first described with reference to previous papers. A series of orientations are tabulated for different values of n and the authors attempt to prove that these orientations are optimal under the criteria of minimizing m(o) or d(o). Claims are made and verification shown in detail.

• Corporate Authors:

  John Wiley & Sons, Incorporated

  111 River Street
  Hoboken, NJ  United States  07030-6000
• Authors:
  • Roberts, F S
  • Xu, Yonghua
• Publication Date: 1989-3

Language

• English

Media Info

• Pagination: p. 221-233
• Serial:
  • NETWORKS
  • Volume: 19
  • Issue Number: 2

Subject/Index Terms

• TRT Terms: Alignment; Charts; Mathematical models; Networks; Optimization; Roads; Traffic flow; Urban areas
• Uncontrolled Terms: Optimum; Road networks; Selection
• ITRD Terms: 2894: Alignment; 6486: Chart; 6473: Mathematical model; 1053: Road network; 9072: Selection; 671: Traffic flow; 313: Urban area
• Subject Areas: Highways; Operations and Traffic Management;

Filing Info

• Accession Number: 00498754
• Record Type: Publication
• Source Agency: Transport and Road Research Laboratory (TRRL)
• Files: ITRD, TRIS
• Created Date: Sep 30 1990 12:00AM