MAXBAND: A PROGRAM FOR SETTING SIGNALS ON ARTERIES AND TRIANGULAR NETWORKS
John D. C. Little, M D Kelson, Nathan M Gartner
Abstract
John D. C. Little, M D Kelson, Nathan M Gartner
Abstract
MAXBAND is a portable, off-line, FORTRAN IV computer program for setting arterial signals to achieve maximal bandwidth. Special features of the program include (a) automatically choosing cycle time from a given range, (b) permitting the design speed to vary within given tolerances, (c) selecting the best lead or lag pattern for left-turn phases from a specified set, (d) allowing a queue clearance time for secondary flow accumulated during red, (e) accepting user-specified weights for the green bands in each direction, and (f) handling a simple network in the form of a three-artery triangular loop. Green splits can be provided or, alternatively, flows and capacities can be given and splits calculated by using Webster's theory. The program produces cycle time, offsets, speeds, and order of left-turn phases to maximize the weighted combination of bandwidths. The optimization uses Land and Powell's MPCODE branch and bound algorithm. As many as 12 signals can be handled efficiently. The program is available from the Federal Highway Administration. (Authors)
OpenAlex reports 247 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
MAXBAND is a portable, off-line, FORTRAN IV computer program for setting arterial signals to achieve maximal bandwidth. Special features of the program include (a) automatically choosing cycle time from a given range, (b) permitting the design speed to vary within given tolerances, (c) selecting the best lead or lag pattern for left-turn phases from a specified set, (d) allowing a queue clearance time for secondary flow accumulated during red, (e) accepting user-specified weights for the green bands in each direction, and (f) handling a simple network in the form of a three-artery triangular loop. Green splits can be provided or, alternatively, flows and capacities can be given and splits calculated by using Webster's theory. The program produces cycle time, offsets, speeds, and order of left-turn phases to maximize the weighted combination of bandwidths. The optimization uses Land and Powell's MPCODE branch and bound algorithm. As many as 12 signals can be handled efficiently. The program is available from the Federal Highway Administration. (Authors)
Key concepts: Fortran, Queue, Computer science, Computer program, Bandwidth (computing), Range (aeronautics), Set (abstract data type), Algorithm