Projected dynamical systems modeling and computation of spatial network equilibria

In this paper, we consider the price formulation-rather than the quantity formulation ― of spatial network equilibria and introduce a projected dynamical system, whose set of stationary points corresponds to the set of solutions of the governing variational inequality problem. We then interpret the dynamical system as a tatonnement process in which the commodity prices and shipments are updated simultaneously. We propose an Euler-type method for the computation of the commodity prices and trade patterns, provide convergence results, and demonstrate that the algorithm can be implemented on massively parallel architectures. The notable feature of the algorithm is that the prices and shipments can be computed independently and in closed form. Finally, we illustrate the performance of the implemented algorithm on the Thinking Machine's CM-2 and CM-5 architectures.

[1]  Faruk Güder,et al.  Pairwise reactive sor algorithm for quadratic programming of net import spatial equilibrium models , 1989, Math. Program..

[2]  Anna Nagurney,et al.  A general dynamic spatial price network equilibrium model with gains and losses , 1989, Networks.

[3]  A. Goldstein.  Convex programming in Hilbert space , 1964 .

[4]  D. Bertsekas.  On the Goldstein-Levitin-Polyak gradient projection method , 1974, CDC 1974.

[5]  Faruk Güder,et al.  Parallel and Serial Successive Overrelaxation for Multicommodity Spatial Price Equilibrium Problems , 1992, Transp. Sci..

[6]  D. Kinderlehrer,et al.  An introduction to variational inequalities and their applications , 1980 .

[7]  M. Florian,et al.  A new look at static spatial price equilibrium models , 1982 .

[8]  Patrice Marcotte,et al.  A Newton-SOR Method for Spatial Price Equilibrium , 1992, Transp. Sci..

[9]  Steven Chandler McKelvey.  Partitionable variational inequalities and an application to the market equilibrium problem , 1989 .

[10]  A. Nagurney,et al.  On the stability of projected dynamical systems , 1995 .

[11]  J. Pang.  SOLUTION OF THE GENERAL MULTICOMMODITY SPATIAL EQUILIBRIUM PROBLEM BY VARIATIONAL AND COMPLEMENTARITY METHODS , 1984 .

[12]  P. Harker,et al.  ALTERNATIVE ALGORITHMS FOR THE GENERAL NETWORK SPATIAL PRICE EQUILIBRIUM PROBLEM , 1984 .

[13]  A. Nagurney.  Network Economics: A Variational Inequality Approach , 1992 .

[14]  A. Nagurney,et al.  Progressive equilibration algorithms: The case of linear transaction costs , 1989 .

[15]  Anna Nagurney,et al.  Supply and Demand Equilibration Algorithms for a Class of Market Equilibrium Problems , 1989, Transp. Sci..

[16]  A. Skorokhod.  Stochastic Equations for Diffusion Processes in a Bounded Region , 1961 .

[17]  G. Stampacchia,et al.  On some non-linear elliptic differential-functional equations , 1966 .

[18]  Sjur Didrik Flåm,et al.  On finite convergence and constraint identification of subgradient projection methods , 1992, Math. Program..

[19]  L. Armijo.  Minimization of functions having Lipschitz continuous first partial derivatives. , 1966 .

[20]  S. C. Dafermos,et al.  Partitionable variational inequalities with applications to network and economic equilibria , 1992 .

[21]  Anna Nagurney,et al.  Parallel computation of large-scale dynamic market network equilibria via time period decomposition , 1991 .

[22]  Anna Nagurney,et al.  Massively parallel computation of spatial price equilibrium problems as dynamical systems , 1995 .

[23]  Masao Fukushima,et al.  A relaxed projection method for variational inequalities , 1986, Math. Program..

[24]  P. Zusman.  Spatial and temporal price and allocation models , 1971 .

[25]  Anna Nagurney,et al.  Dynamical systems and variational inequalities , 1993, Ann. Oper. Res..

[26]  Tony E. Smith,et al.  A solution condition for complementarity problems: with an application to spatial price equilibrium , 1984 .