Abstract: Suppose that we wish to make a system of streets more efficient by making the streets one-way. How should the one-way streets be assigned so as to make the traffic flow most efficient? This is a surprisingly difficult problem, and is the problem considered in this thesis. We consider algorithms for assigning one-way streets, and we look at different ways of measuring efficiency. We then consider the special cases of rectangular grid graphs and wheel graphs. |
Presenting at HRUMC
St. Lawrence University Homepage - Academics Page |