MINOR TO MAJOR STREAM MERGING WITHIN AN AUTOMATED HIGHWAY SYSTEM

A MODEL OF A COMPLETELY AUTOMATED HIGHWAY SYSTEM IN WHICH THE VELOCITY AND HEADWAY OF EACH VEHICLE IS UNDER COMPUTER CONTROL IS INVESTIGATED. IT IS ASSUMED THAT DUE TO THIS CONTROL, EACH VEHICLE IS LOCATED AT A POINT OR SLOT WHICH IS AN INTEGRAL MULTIPLE OF A MINIMUM HEADWAY, FROM ITS PROCEEDING VEHICLE. BASED ON THESE ASSUMPTIONS IT IS SHOWN THAT THE TRAFFIC DISTRIBUTION ON THE CONTROLLED HIGHWAY IS BINOMIAL. FOUR POSSIBLE MERGING STRATEGIES ARE THEN DISCUSSED. IN THE FIRST STRATEGY, ONE VEHICLE IS ALLOWED TO MERGE PER SERVICE PERIOD REGARDLESS OF SERVICE PERIOD GAP SIZE. THE SECOND STRATEGY IS THE MERGING OF ONE VEHICLE PER SERVICE PERIOD BASED UPON A MINIMUM GAP SIZE. THE THIRD STRATEGY IS BULK SERVICE WHERE ONLY TWO VEHICLES ARE ALLOWED TO MERGE DURING ANY GIVEN SERVICE PERIOD RATHER THAN VEHICLES AS IN THE CASE OF BULK SERVICE. THE FINAL STRATEGY INVESTIGATED IS A COMBINATION OF THE SECOND AND THIRD STRATEGIES. HERE TWO VEHICLES ARE ALLOWED TO MERGE DURING A GIVEN SERVICE PERIOD DEPENDING ON BOTH THE QUEUE LENGTH IN THE MINOR STREAM AND THE SERVICE PERIOD GAP LENGTH IN THE MAJOR STREAM. THESE FOUR STRATEGIES ARE COMPARED ON THE BASIS OF AVERAGE MINOR STREAM QUEUE LENGTH AND AVERAGE MAJOR STREAM SERVICE PERIOD. /AUTHOR/

  • Supplemental Notes:
    • Vol 4, No 4, PP 301-324
  • Authors:
    • Breeding, K J
  • Publication Date: 1970-12

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 00225967
  • Record Type: Publication
  • Files: TRIS
  • Created Date: Jun 29 1971 12:00AM