Hostname: page-component-76fb5796d-9pm4c Total loading time: 0 Render date: 2024-04-26T22:17:36.325Z Has data issue: false hasContentIssue false
  • English
  • Français

AN MDP DECOMPOSITION APPROACH FOR TRAFFIC CONTROL AT ISOLATED SIGNALIZED INTERSECTIONS

Published online by Cambridge University Press:  25 September 2008

René Haijema  and
Jan van der Wal
René Haijema
Affiliation:
Department of Quantitative Economics Faculty of Economics and BusinessUniversity of Amsterdam1018WB Amsterdam, The Netherlands E-mail: r.haijema@uva.nl; jan.v.d.wal@tue.nl
Jan van der Wal
Affiliation:
Department of Quantitative Economics Faculty of Economics and BusinessUniversity of Amsterdam1018WB Amsterdam, The Netherlands E-mail: r.haijema@uva.nl; jan.v.d.wal@tue.nl
Get access Rights & Permissions [Opens in a new window]

Abstract

This article presents a novel approach for the dynamic control of a signalized intersection. At the intersection, there is a number of arrival flows of cars, each having a single queue (lane). The set of all flows is partitioned into disjoint combinations of nonconflicting flows that will receive green together. The dynamic control of the traffic lights is based on the numbers of cars waiting in the queues. The problem concerning when to switch (and which combination to serve next) is modeled as a Markovian decision process in discrete time. For large intersections (i.e., intersections with a large number of flows), the number of states becomes tremendously large, prohibiting straightforward optimization using value iteration or policy iteration. Starting from an optimal (or nearly optimal) fixed-cycle strategy, a one-step policy improvement is proposed that is easy to compute and is shown to give a close to optimal strategy for the dynamic problem.

Type
Research Article
Information
Probability in the Engineering and Informational Sciences , Volume 22 , Issue 4 , October 2008 , pp. 587 - 602
Copyright
Copyright © Cambridge University Press 2008

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

1.Bhulai, S. (2004). Dynamic routing policies for multi-skill call centers. Technical report WS2004-11, Vrije Universiteit Amsterdam.Google Scholar
2.Darroch, J.N. (1964). On the traffic light queue. Annals of Mathematical Statistics 35(1): 380–388.CrossRefGoogle Scholar
3.Farges, J.-L., Henry, J.-J., & Tufal, J. (1983). The PRODYN real-time traffic algorithm. In Proceedings of the 4th IFAC Symposium on Transportation Systems, pp. 307–312.Google Scholar
4.Higashikubo, M., Hinenoya, T., & Takeuchi, K. (1997). Traffic queue length measurement using an image processing sensor. Sumitomo Electric Technical Review 43: 64–68.Google Scholar
5.Krishnan, K.R. & Ott, T.J. (1986). State-dependent routing for telephone traffic: Theory and results. In Proceedings of the 25th IEEE conference on decision and control, Athens, Greece. New York: IEEE, pp. 2124–2128.CrossRefGoogle Scholar
6.Krishnan, K.R. & Ott, T.J. (1987). Joining the right queue: A Markov decision rule. In Proceedings of the 26th IEEE conference on decision and control, Los Angeles. New York: IEEE, pp. 1863–1868.CrossRefGoogle Scholar
7.McNeill, D.R. (1965). A solution to the fixed cycle traffic light problem for compound poisson arrivals. Journal of Applied Probability 5: 624–635.CrossRefGoogle Scholar
8.Miller, A.J. (1963). Settings for fixed-cycle traffic signals. Operations Research 14(4): 373–386.CrossRefGoogle Scholar
9.Miller, A.J. (1963). A computer control system for traffic networks. In Proceedings of the International Symposium on Traffic Theory, pp. 200–220.Google Scholar
10.Newell, G.F. (1960). Queues for a fixed-cycle traffic light. Annals of Mathematical Statistics 31(3): 589–597.CrossRefGoogle Scholar
11.Newell, G.F. (1965). Approximation methods for queues with applications to the fixed-cycle traffic light. SIAM Review 7(2): 223–240.CrossRefGoogle Scholar
12.Norman, J.M. (1972). Heuristic procedures in dynamic programming. Manchester, UK: Manchester University Press.Google Scholar
13.Papageorgiou, M., Diakaki, C., Dinopoulou, V., Kotsialos, A., & Wang, Y. (2003). Review of road traffic control strategies. In Proc. IEEE 91: 2043–2067.CrossRefGoogle Scholar
14.Prinsen, L.H.A. (2006). Personal communication.Google Scholar
15.Sassen, S.A.E., Tijms, H.C., & Nobel, R.D. (1997). A heuristic rule for routing customers to parallel queues. Statistica Neerlandica 51(1): 107–121.CrossRefGoogle Scholar
16.Sen, S. & Head, L. (1997). Controlled optimization of phases at an intersection. Transportation Science 31: 5–17.CrossRefGoogle Scholar
17.Tijms, H.C. (2003). A first course in stochastic models. New York: Wiley.CrossRefGoogle Scholar
18.van Leeuwaarden, J.S.H. (2006). Delay analysis for the fixed cycle traffic light queue. Transportation Science 40(2): 189–199.CrossRefGoogle Scholar
19.Vincent, R.A. & Young, C.P. (1986). Self-optimizing traffic signal control using microprocessor: The TRRL “MOVA” strategy for isolated intersections. Traffic Engineering and Control 27: 385–387.Google Scholar
20.Webster, F.V. (1958). Traffic signal settings. Road Research technical paper 39. Road Research Laboratory, London.Google Scholar
21.Wiering, M., van Veenen, J., Vreeken, J., & Koopman, A. (2004). Intelligent traffic light control. Technical report UU-CS-2004-029, Institute of Information and Computing Sciences, Utrecht University.Google Scholar
22.Wijngaard, J. (1979). Decomposition for dynamic programming in production and inventory control. Engineering and Process Economics 4: 385–388.CrossRefGoogle Scholar