Conflict-minimising traffic patterns: A graph-theoretic approach to efficient traffic circulation in urban areas

The paths followed by vehicles in urban areas are densely interwoven, and some of the accidents and congestion that occur in city centres can be attributed to the ‘conflicts’ that arise where these paths intersect. Hence, it is desirable to encourage traffic patterns in which the frequency and severity of conflicts are minimised. At present, neither signal optimisation programs nor traffic simulation programs allow the user to experiment freely with different combinations of one-way streets and turn restrictions, which might otherwise help to disentangle conflicting movements. There is no accepted formula or philosophy for organising traffic into a coherent spatial pattern. The aim of this paper is to consider some idealised networks and circulation systems that have simple geometrical configurations, and to identify those systems that are relatively efficient in terms of path crossings, as compared with a theoretical yardstick derived from graph theory. The results provide some pointers towards a general strategy for efficient traffic circulation in urban areas.