摘要

This paper outlines a dynamical assignment and control model which calculates stage green-times for a signal-controlled network. In the dynamical model route flows, bottleneck delays and stage green-times all change simultaneously over iterations. It is shown that if the initial problem is feasible and the P-0 policy is utilised to move stage green-times then convergence is certain in the vertical queueing case. The model makes some reasonable systematic allowance for travellers' route choices by encouraging congestion-reducing route choices in the future; the model (in generating signal timings) maximises network capacity (taking account of route choices) when queueing is vertical. Blocking back however appears difficult to deal with (while retaining the convergence guarantee) and represents an area for further study. The model may be used to design fixed-time or time of day signal timings; it may also be used to pre-prepare timings for rapid implementation in case of a predictable incident; finally if computation speeds are high enough the method may possibly be used responsively, in real-time.

  • 出版日期2015-9