Two popular computer programs, MAXBAND and PASSER II, are widely used in obtaining the maximal bandwidth. However, these bandwidths may not be realized or only be partly realized if the resultant signal timings are actually applied on the arterial. This phenomenon can be observed from field tests or from a time-space diagram. In this paper two examples demonstrate the problem. A new algorithm is proposed for solving the bandwidth problem and provides the user with a more realistic maximum progression bandwidth. The algorithm uses a general mixed-integer programming formulation, and a program BANDTOP based on this formulation has been developed to obtain the real progression bandwidth. It has been tested on street networks in Taiwan, where it has proved very effective. The major variation from traditional methods is that the bandwidth has a saw-toothed pattern in both directions instead of parallel and uniform. Any vehicle in the segment is allowed to travel through the entire section of an arterial with at most one stop.
Samenvatting