THE TRAFFIC INTERSECTION WITH DETERMINISTIC ARRIVALS OVER A PLANNING PERIOD IS MODELLED BY ANALOGY WITH A RESERVOIR. UNDER FIXED CYCLE LENGTHS, LIGHT SETTINGS ARE DETERMINED WHICH MINIMIZE AVERAGE LINE LENGTHS OF WAITING VEHICLES. UNDER CERTAIN CONDITIONS, THE FIXED-CYCLE LENGTH REQUIREMENT MAY BE RELAXED, RESULTING IN APPROXIMATELY OPTIMAL CYCLE LENGTHS. CONSTRAINTS ON MAXIMUM WAITING TIME, MAXIMUM QUEUE LENGTH, AND MINIMUM CLEARANCE DURING A CYCLE ARE APPENDED TO THE FUNDAMENTAL MODEL AND TRADEOFF ANALYSES ARE SUGGESTED. MAXIMUM LINE LENGTH MAY, IN ADDITION, BE EXPLICITLY MINIMIZED. THE SINGLE INTERSECTION IS INVESTIGATED FOR THE CASE OF TWO ONE-WAY INTERSECTING STREETS. THE CASE OF TWO TWO-WAY INTERSECTING STREETS IS AN OBVIOUS AND EASY EXTENSION OF THE TWO ONE-WAY INTERSECTING STREETS MODEL. EXTENSIONS TO SERIAL INTERSECTIONS WITH LIMITED WAITING ROOM ARE SUGGESTED. ALL PROBLEMS ARE NEATLY CAST AS LINEAR PROGRAMS AND HENCE ARE READILY OPTIMIZABLE.(Author/publisher).
Abstract