Abstract
We introduce a variant of the well-known minimum-cost circulation problem in directed networks, where vertex demand values are taken from the integers modulo \(\lambda \), for some integer \(\lambda \ge 2\). More formally, given a directed network \(G = (V,E)\), each of whose edges is associated with a weight and each of whose vertices is associated with a demand taken over the integers modulo \(\lambda \), the objective is to compute a flow of minimum weight that satisfies all the vertex demands modulo \(\lambda \). This problem is motivated by a problem of computing a periodic schedule for traffic lights in an urban transportation network that minimizes the total delay time of vehicles. We show that this modular circulation problem is solvable in polynomial time when \(\lambda = 2\) and that the problem is NP-hard when \(\lambda = 3\). We also present a polynomial time algorithm that achieves a \(4(\lambda - 1)\)-approximation.
Research supported by NSF grant CCF-1618866.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice-Hall (1993)
Cormen, T.H., Stein, C., Rivest, R.L., Leiserson, C.E.: Introduction to Algorithms, 2nd edn. McGraw-Hill Higher Education (2001)
Dasler, P., Mount, D.M.: On the complexity of an unregulated traffic crossing. In: Dehne, F., Sack, J.-R., Stege, U. (eds.) WADS 2015. LNCS, vol. 9214, pp. 224–235. Springer, Cham (2015). doi:10.1007/978-3-319-21840-3_19
Dresner, K.M., Stone, P.: A multiagent approach to autonomous intersection management. J. Artif. Int. Res. 31, 591–656 (2008)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co. (1979)
Goldberg, A.V., Tarjan, R.E.: Finding minimum-cost circulations by canceling negative cycles. Journal of the ACM 36, 873–886 (1989)
Guler, S.I., Menendez, M., Meier, L.: Using connected vehicle technology to improve the efficiency of intersections. Transportation Research Part C: Emerging Technologies 46, 121–131 (2014)
Orlin, J.B.: A polynomial time primal network simplex algorithm for minimum cost flows. Mathematical Programming 78, 109–129 (1997)
Tachet, R., Santi, P., Sobolevsky, S., Reyes-Castro, L.I., Frazzoli, E., Helbing, D., Ratti, C.: Revisiting street intersections using slot-based systems. PLOS ONE 11(3), e0149607 (2016)
Vial, J.J.B., Devanny, W.E., Eppstein, D., Goodrich, M.T.: Scheduling autonomous vehicle platoons through an unregulated intersection. In: Goerigk, M., Werneck, R. (eds.) 16th Wkshp. Alg. Approaches Transport. Model., Opt., and Syst. (ATMOS 2016), vol. 54, pp. 1–14 (2016)
Yu, J., LaValle, S.M.: Multi-agent path planning and network flow. In: Frazzoli, E., Lozano-Perez, T., Roy, N., Rus, D. (eds.) Algorithmic Foundations of Robotics X. STAR, vol. 86, pp. 157–173. Springer, Heidelberg (2013). doi:10.1007/978-3-642-36279-8_10
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Dasler, P., Mount, D.M. (2017). Modular Circulation and Applications to Traffic Management. In: Ellen, F., Kolokolova, A., Sack, JR. (eds) Algorithms and Data Structures. WADS 2017. Lecture Notes in Computer Science(), vol 10389. Springer, Cham. https://doi.org/10.1007/978-3-319-62127-2_24
Download citation
DOI: https://doi.org/10.1007/978-3-319-62127-2_24
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-62126-5
Online ISBN: 978-3-319-62127-2
eBook Packages: Computer ScienceComputer Science (R0)