The Scheduling of Traffic Lights (UMAP)

We consider the problem of scheduling traffic lights optimally, or more generally, the problem of allocating optimally the use of a facility to users having conflicting constraints. To this effect, we show how traffic at an intersection can be modeled by a graph with some additional structure and how to set up a linear program from which a solution to the problem can be obtained. An algorithm to carry out this task is discussed in detail.

Table of Contents:

FOREWORD

INTRODUCTION

MODELING THE PROBLEM

IMPROVING THE ASSIGNMENT

MAXIMAL CLIQUES

LINEAR PROGRAMMING

PHASINGS AND INTERSECTION ASSIGNMENTS

A MORE INVOLVED EXAMPLE

CONSECUTIVE ORDERINGS

FULL INTERSECTION ASSIGNMENTS

AN ALGORITHM
The Algorithm
Notes on the Algorithm

COMMENTS AND SUGGESTIONS FOR FURTHER READING

INDEX

SOLUTIONS TO THE EXERCISES

REFERENCES

ABOUT THE AUTHORS