Advertisement

Modular Circulation and Applications to Traffic Management

  • Philip Dasler
  • David M. Mount
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10389)

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.

Keywords

Network flows and circulations Traffic management Approximation algorithms NP-hard problems 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice-Hall (1993)Google Scholar
  2. 2.
    Cormen, T.H., Stein, C., Rivest, R.L., Leiserson, C.E.: Introduction to Algorithms, 2nd edn. McGraw-Hill Higher Education (2001)Google Scholar
  3. 3.
    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 CrossRefGoogle Scholar
  4. 4.
    Dresner, K.M., Stone, P.: A multiagent approach to autonomous intersection management. J. Artif. Int. Res. 31, 591–656 (2008)Google Scholar
  5. 5.
    Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co. (1979)Google Scholar
  6. 6.
    Goldberg, A.V., Tarjan, R.E.: Finding minimum-cost circulations by canceling negative cycles. Journal of the ACM 36, 873–886 (1989)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    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)CrossRefGoogle Scholar
  8. 8.
    Orlin, J.B.: A polynomial time primal network simplex algorithm for minimum cost flows. Mathematical Programming 78, 109–129 (1997)MathSciNetzbMATHGoogle Scholar
  9. 9.
    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)CrossRefGoogle Scholar
  10. 10.
    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)Google Scholar
  11. 11.
    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 CrossRefGoogle Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  1. 1.Department of Computer Science and Institute for Advanced Computer StudiesUniversity of MarylandCollege ParkUSA

Personalised recommendations