SELECTION OF OFFSETS TO MINIMIZE DELAY TO TRAFFIC IN A NETWORK CONTROLLED BY FIXED-TIME SIGNALS

HILLIER HAS DESCRIBED A METHOD OF SELECTING OFFSETS TO MINIMIZE DELAY IN CERTAIN NETWORKS CONTROLLED BY FIXED-TIME SIGNALS. IN THIS PAPER AN ATTEMPT IS MADE TO EXTEND THE METHOD BY RELAXING SOMEWHAT THE RESTRICTIONS ON THE FORM OF THE NETWORK. THE PROBLEM IS EXPRESSED IN TERMS OF THE THEORY OF GRAPHS, AND AN ITERATIVE PROCESS IS DEVELOPED FOR FINDING A SET OF OFFSETS THAT MINIMIZES DELAY OVER THE WHOLE NETWORK. AT EACH STAGE, THE PART OF THE NETWORK ALREADY COVERED IS EXTENDED BY ADDING ONE OR MORE LINKS, AND FOR THE METHOD TO BE VIABLE THESE LINKS MUST BE CHOSEN SO THAT A CERTAIN SET OF INTERSECTIONS REMAINS SMALL. A METHOD OF SELECTION OF LINKS THAT MINIMIZES THIS SET OF INTERSECTIONS AT EACH STAGE IS DEVELOPED. THE SELECTION OF LINKS AND CALCULATIONS OF OFFSETS HAVE BEEN PROGRAMMED IN FORTRAN. HAVING FOUND ONE DELAY-MINIMIZING SET OF OFFSETS, SOME OTHERS THAT GIVE THE SAME TOTAL DELAY CAN BE FOUND IF THEY EXIST. /AUTHOR/

  • Availability:
  • Supplemental Notes:
    • Vol2, pp 1-13
  • Corporate Authors:

    Operations Research Society of America

    428 East Preston Street
    Baltimore, MD  United States  21202
  • Authors:
    • ALLSOP, R E
  • Publication Date: 0

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 00227206
  • Record Type: Publication
  • Source Agency: Traffic Systems Reviews & Abstracts
  • Files: TRIS
  • Created Date: Aug 13 2004 6:56PM