TY - JOUR

T1 - A variational approach for continuous supply chain networks

AU - Han, Ke

AU - Friesz, Terry L.

AU - Yao, Tao

N1 - Copyright:
Copyright 2014 Elsevier B.V., All rights reserved.

PY - 2014

Y1 - 2014

N2 - We consider a continuous supply chain networ k consisting of buffering queues and processors first proposed by [D. Armbruster, P. Degond, and C. Ringhofer, SIAM J. Appl. Math., 66 (2006) pp. 896-920] and subsequently analyzed by [D. Armbruster, P. Degond, and C. Ringhofer, Bull. Inst. Math. Acad. Sin. (N.S.), 2 (2007),pp. 433-460] and [D. Armbruster, C. De Beer, M. Freitag, T. Jagalski, and C. Ringhofer, Phys. A, 363 (2006),pp. 104-114]. A model was proposed for such a network by [S. Göttlich, M. Herty, and A. Klar, Commun. Math. Sci., 3 (2005),pp. 545-559] using a system of coupling ordinary differential equations and partial differential equations. In this article, we propose an alternative approach based on a variational method to formulate the network dynamics. We also derive, based on the variational method, a computational algorithm that guarantees numerical stability, allows for rigorous error estimates, and facilitates efficient computations. A class of network flow optimization problems are formulated as mixed integer programs (MIPs). The proposed numerical algorithm and the corresponding MIP are compared theoretically and numerically with existing ones [A. Fügenschuh, S. Göttlich, M. Herty, A. Klar, and A. Martin, SIAM J. Sci. Comput., 30(2008), pp. 1490-1507; S. Göttlich, M. Herty, and A. Klar, Commun. Math. Sci., 3(2005), pp. 545-559], which demonstrates the modeling and computational advantages of the variational approach.

AB - We consider a continuous supply chain networ k consisting of buffering queues and processors first proposed by [D. Armbruster, P. Degond, and C. Ringhofer, SIAM J. Appl. Math., 66 (2006) pp. 896-920] and subsequently analyzed by [D. Armbruster, P. Degond, and C. Ringhofer, Bull. Inst. Math. Acad. Sin. (N.S.), 2 (2007),pp. 433-460] and [D. Armbruster, C. De Beer, M. Freitag, T. Jagalski, and C. Ringhofer, Phys. A, 363 (2006),pp. 104-114]. A model was proposed for such a network by [S. Göttlich, M. Herty, and A. Klar, Commun. Math. Sci., 3 (2005),pp. 545-559] using a system of coupling ordinary differential equations and partial differential equations. In this article, we propose an alternative approach based on a variational method to formulate the network dynamics. We also derive, based on the variational method, a computational algorithm that guarantees numerical stability, allows for rigorous error estimates, and facilitates efficient computations. A class of network flow optimization problems are formulated as mixed integer programs (MIPs). The proposed numerical algorithm and the corresponding MIP are compared theoretically and numerically with existing ones [A. Fügenschuh, S. Göttlich, M. Herty, A. Klar, and A. Martin, SIAM J. Sci. Comput., 30(2008), pp. 1490-1507; S. Göttlich, M. Herty, and A. Klar, Commun. Math. Sci., 3(2005), pp. 545-559], which demonstrates the modeling and computational advantages of the variational approach.

UR - http://www.scopus.com/inward/record.url?scp=84897902322&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84897902322&partnerID=8YFLogxK

U2 - 10.1137/120868943

DO - 10.1137/120868943

M3 - Article

AN - SCOPUS:84897902322

VL - 52

SP - 663

EP - 686

JO - SIAM Journal on Control and Optimization

JF - SIAM Journal on Control and Optimization

SN - 0363-0129

IS - 1

ER -