Skip to main content

Long Term Behavior of Dynamic Equilibria in Fluid Queuing Networks

  • Conference paper
  • First Online:
Integer Programming and Combinatorial Optimization (IPCO 2017)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10328))

Abstract

A fluid queuing network constitutes one of the simplest models in which to study flow dynamics over a network. In this model we have a single source-sink pair and each link has a per-time-unit capacity and a transit time. A dynamic equilibrium (or equilibrium flow over time) is a flow pattern over time such that no flow particle has incentives to unilaterally change its path. Although the model has been around for almost fifty years, only recently results regarding existence and characterization of equilibria have been obtained. In particular the long term behavior remains poorly understood. Our main result in this paper is to show that, under a natural (and obviously necessary) condition on the queuing capacity, a dynamic equilibrium reaches a steady state (after which queue lengths remain constant) in finite time. Previously, it was not even known that queue lengths would remain bounded. The proof is based on the analysis of a rather non-obvious potential function that turns out to be monotone along the evolution of the equilibrium. Furthermore, we show that the steady state is characterized as an optimal solution of a certain linear program. When this program has a unique solution, which occurs generically, the long term behavior is completely predictable. On the contrary, if the linear program has multiple solutions the steady state is more difficult to identify as it depends on the whole temporal evolution of the equilibrium.

We warmly thank Schloss Dagstuhl for its hospitality during the Seminar 15412 “Dynamic Traffic Models in Transportation Science” at which this research started. We also express our sincere gratitude to Vincent Acary, Umang Bhaskar, and Martin Skutella for enlightening discussions. This work was partially supported by Núcleo Milenio Información y Coordinación en Redes (ICM-FIC RC130003), an NWO Veni grant, and an NWO TOP grant.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    These derivatives exist almost everywhere and are locally integrable.

References

  1. Cominetti, R., Correa, J., Larré, O.: Dynamic equilibria in fluid queueing networks. Oper. Res. 63(1), 21–34 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  2. Ford, L.R., Fulkerson, D.R.: Constructing maximal dynamic flows from static flows. Oper. Res. 6, 419–433 (1958)

    Article  MathSciNet  Google Scholar 

  3. Friesz, T.L., Bernstein, D., Smith, T.E., Tobin, R.L., Wie, B.W.: A variational inequality formulation of the dynamic network user equilibrium problem. Ope. Res. 41(1), 179–191 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  4. Gale, D.: Transient flows in networks. Mich. Math. J. 6, 59–63 (1959)

    Article  MathSciNet  MATH  Google Scholar 

  5. Koch, R., Skutella, M.: Nash equilibria and the price of anarchy for flows over time. Theor. Comput. Syst. 49, 71–97 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  6. Merchant, D.K., Nemhauser, G.L.: A model and an algorithm for the dynamic traffic assignment problems. Transp. Sci. 12, 183–199 (1978)

    Article  Google Scholar 

  7. Merchant, D.K., Nemhauser, G.L.: Optimality conditions for a dynamic traffic assignment model. Transp. Sci. 12, 200–207 (1978)

    Article  Google Scholar 

  8. Meunier, F., Wagner, N.: Equilibrium results for dynamic congestion games. Transp. Sci. 44(4), 524–536 (2010)

    Article  Google Scholar 

  9. Peeta, S., Ziliaskopoulos, A.K.: Foundations of dynamic traffic assignment: the past, the present and the future. Netw. Spat. Econ. 1(3–4), 233–265 (2001)

    Article  Google Scholar 

  10. Ran, B., Boyce, D.: Modeling Dynamic Transportation Networks. Springer, Berlin (1996)

    Book  MATH  Google Scholar 

  11. Vickrey, W.S.: Congestion theory and transport investment. Am. Econ. Rev. 59(2), 251–260 (1969)

    Google Scholar 

  12. Xu, Y.W., Wu, J.H., Florian, M., Marcotte, P., Zhu, D.L.: Advances in the continuous dynamic network loading problem. Transp. Sci. 33(4), 341–353 (1999)

    Article  MATH  Google Scholar 

  13. Zhu, D., Marcotte, P.: On the existence of solutions to the dynamic user equilibrium problem. Transp. Sci. 34(4), 402–414 (2000)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Neil Olver .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Cominetti, R., Correa, J., Olver, N. (2017). Long Term Behavior of Dynamic Equilibria in Fluid Queuing Networks. In: Eisenbrand, F., Koenemann, J. (eds) Integer Programming and Combinatorial Optimization. IPCO 2017. Lecture Notes in Computer Science(), vol 10328. Springer, Cham. https://doi.org/10.1007/978-3-319-59250-3_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-59250-3_14

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-59249-7

  • Online ISBN: 978-3-319-59250-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics