Abstract
In this article, we consider transport networks with uncertain demands. Network dynamics are given by linear hyperbolic partial differential equations and suitable coupling conditions, while demands are incorporated as solutions to stochastic differential equations. For the demand satisfaction, we solve a constrained optimal control problem. Controls in terms of network inputs are then calculated explicitly for different assumptions. Numerical simulations are performed to underline the theoretical results.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows. Prentice Hall Inc, Englewood Cliffs (1993)
Armbruster, D., Degond, P., Ringhofer, C.: A model for the dynamics of large queuing networks and supply chains. J. SIAM Appl. Math. 66, 896–920 (2006)
Banda, M., Herty, M., Klar, A.: Gas flow in pipeline networks. Netw. Heterog. Media 1, 41–56 (2006)
Benner, P., Grundel, S., Himpe, C., Huck, C., Streubel, T., Tischendorf, C.: Gas Network Benchmark Models, pp 171–197. Springer International Publishing, Cham (2019)
Bressan, A., Čanić, S., Garavello, M., Herty, M., Piccoli, B.: Flows on networks: recent results and perspectives. EMS Surv. Math. Sci. 1, 47–111 (2014)
Coskun, S., Korn, R.: Modeling the Intraday Electricity Demand in Germany, pp 3–23. Springer International Publishing, Cham (2021)
D’Apice, C., GÖttlich, S., Herty, M., Piccoli, B.: Modeling, simulation, and optimization of supply chains society for industrial and applied mathematics (2010)
Delbaen, F., Shirakawa, H.: An interest rate model with upper and lower bounds. Asia-Pacific Finan. Markets. 9, 191–209 (2002)
Dohi, T., Kaio, N., Osaki, S.: Optimal production planning under diffusion demand pattern. Math. Comput. Model. 21, 35–46 (1995)
Festa, A., GÖttlich, S., Pfirsching, M.: A model for a network of conveyor belts with discontinuous speed and capacity. Networks and Heterogeneous Media 14 (2018)
Filipović, D., Larsson, M., Ware, A.: Polynomial processes for power prices, SSRN Electronic Journal (2017)
Ford, L.R. Jr., Fulkerson, D.R.: Flows in Networks. Princeton, Princeton University Press (1962)
Garavello, M., Piccoli, B.: Traffic Flow on Networks, Vol. 1 of AIMS Series on Applied Mathematics, American Institute of Mathematical Sciences (AIMS), Springfield, MO (2006)
GÖttlich, S., Herty, M., Klar, A.: Network models for supply chains. Commun. Math. Sci. 3, 545–559 (2005)
GÖttlich, S., Herty, M., Schillen, P.: Electric transmission lines: control and numerical discretization, Optimal Control Applications and Methods, 980–995 (2015)
GÖttlich, S., Kolb, O., Lux, K.: Chance-constrained optimal inflow control in hyperbolic supply systems with uncertain demand. Optimal Control Appl. Methods 42, 566–589 (2021)
GÖttlich, S., Korn, R., Lux, K.: Optimal control of electricity input given an uncertain demand. Math. Methods Oper. Res. 90, 1–28 (2019)
GÖttlich, S., Korn, R., Lux, K.: Optimal inflow control penalizing undersupply in transport systems with uncertain demands. Mathematics in Industry 30, 485–490 (2019)
Gourieroux, C., Jasiak, J.: Multivariate jacobi process with application to smooth transitions. J. Econ. 131, 475–505 (2006)
Klenke, A.: Theory, Probability A Comprehensive Course, 2020th edn. Universitext, Cham (2020)
Koch, T., Hiller, B., Pfetsch, M.E., Schewe, L.: Evaluating gas network capacities society for industrial and applied mathematics (2015)
Øksendal, B.: Stochastic Differential Equations: An introduction with Applications. Universitext, Berlin (2003)
Leugering, G., SCHMIDT, E.J.P.G.: On the modelling and stabilization of flows in networks of open canals. SIAM J. Control Optim. 41 (2002)
Leveque, R.J.: Finite Volume Methods for Hyperbolic Problems, Cambridge Texts in Applied Mathematics. Cambridge University Press, Cambridge (2002)
Ouaret, S., Polotski, V., Kenne, J. -P., Gharbi, A.: Optimal production control of hybrid manufacturing/remanufacturing failure-prone systems under diffusion-type demand. Appl. Math. 04, 550–559 (2013)
Papadopoulos, H., Heavey, C.: Queueing theory in manufacturing systems analysis and design: a classification of models for production and transfer lines. Eur. J. Oper. Res. 92, 1–27 (1996)
Simoni, M.D., Claudel, C.G.: A fast Lax–Hopf algorithm to solve the Lighthill–Whitham–Richards traffic flow model on networks. Transp. Sci. 54, 1516–1534 (2020)
SØrensen, M., Forman, J.: The pearson diffusions: a class of statistically tractable diffusion processes. Scand. J. Stat. 35, 438–465 (2007)
Vaidyanathan, B., Miller, D., Park, Y.: Application of discrete event simulation in production scheduling. Winter Simulation Conf. Proc. 2 (1998), 965–971 (1998)
Funding
Open Access funding enabled and organized by Projekt DEAL. This work was supported by the DAAD project “Stochastic dynamics for complex networks and systems” (Project-ID 5744394).
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The authors declare no competing interests.
Additional information
Communicated by: Jon Wilkening
Author contribution
All authors have contributed equally to this article.
Publisher’s note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Appendix
Appendix
We present the detailed calculation of the second moment for a Jacobi process with time-varying mean reversion level given by the SDE
Lemma A.1
Let \((\bar {\theta }_{n})_{n \in \mathbb {N}}\) be a sequence of step functions converging uniformly to a function 𝜃 ∈ C1([t0,T]). Additionally, let \(\underset {n \rightarrow \infty }{\lim } t_{n} = T\). Then, the conditional second moment for the solution of (A.1) is given by
Proof 1
For a constant mean reversion level, the conditional second moment is presented in equation (??). The idea of the proof is to use this expression to find a representation of the second moment for piecewise constant mean reversion levels and then use a uniform limit to show the result for continuously differentiable functions 𝜃. First, assume that for t0 < t1 < … < tn on a bounded interval [t0,tn], 𝜃 is a step-function, i.e.,
for \(\theta _{i} \in \mathbb {R}\). For n = 1, we obtain the the conditional second moment as in (??). We use an induction to calculate the conditional second moment for an arbitrary \(n+1 \in \mathbb {N}\) assuming that the conditional second moment is known for a step-function with n steps is given by
Then the induction step to n + 1 reads
Summarizing, we obtain the proposed equation (A.3). As a last step, we calculate the limit for \(n \rightarrow \infty \).
□
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Göttlich, S., Schillinger, T. Control strategies for transport networks under demand uncertainty. Adv Comput Math 48, 74 (2022). https://doi.org/10.1007/s10444-022-09993-9
Received:
Accepted:
Published:
DOI: https://doi.org/10.1007/s10444-022-09993-9