
Product No.
99793 
Supplementary Print 
Price:
FREE with membership 



The Scheduling of Traffic Lights (UMAP)
Sara Kuplinsky, Julio Kuplinsky

Mathematics Topic: Graph Theory, Optimization 
Application Areas: Traffic management 
Prerequisites: Elementary graph theory, linear programming 

 ©2006 by COMAP, Inc.  UMAP/ILAP Modules 2006  43 pages 

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



