Efficient decomposition and linearization methods for the stochastic transportation problem

The stochastic transportation problem can be formulated as a convex transportation problem with nonlinear objective function and linear constraints. We compare several different methods based on decomposition techniques and linearization techniques for this problem, trying to find the most efficient method or combination of methods. We discuss and test a separable programming approach, the Frank-Wolfe method with and without modifications, the new technique of mean value cross decomposition and the more well known Lagrangean relaxation with subgradient optimization, as well as combinations of these approaches. Computational tests are presented, indicating that some new combination methods are quite efficient for large scale problems.

[1]  Tony J. Van Roy,et al.  Cross decomposition for mixed integer programming , 1983, Math. Program..

[2]  Philip Wolfe,et al.  Validation of subgradient optimization , 1974, Math. Program..

[3]  Dan Wilson.  An a Priori Bounded Model for Transportation Problems with Stochastic Demand and Integer Solutions , 1972 .

[4]  A. Weintraub,et al.  Accelerating convergence of the Frank-Wolfe algorithm☆ , 1985 .

[5]  P. Camerini,et al.  On improving relaxation methods by modified gradient techniques , 1975 .

[6]  David E. Boyce,et al.  Improved Efficiency of the Frank-Wolfe Algorithm for Convex Network Programs , 1985, Transp. Sci..

[7]  Athanasios Migdalas,et al.  An algorithm for nonlinear programs over cartesian product sets , 1990 .

[8]  A. Williams.  A Stochastic Transportation Problem , 1963 .

[9]  L. Qi.  Forest iteration method for stochastic transportation problem , 1985 .

[10]  Liqun Qi,et al.  A Simplex Method for Network Programs with Convex Separable Piecewise Linear Costs and Its Application to Stochastic Transshipment Problems , 1993 .

[11]  Mokhtar S. Bazaraa,et al.  Nonlinear Programming: Theory and Algorithms , 1993 .

[12]  Boris Polyak.  Minimization of unsmooth functionals , 1969 .

[13]  K. Holmberg.  Linear mean value cross decomposition: A generalization of the Kornai-Liptak method , 1992 .

[14]  Philip Wolfe,et al.  An algorithm for quadratic programming , 1956 .

[15]  George B. Dantzig,et al.  Decomposition Principle for Linear Programs , 1960 .

[16]  Kaj Holmberg.  SEPARABLE PROGRAMMING APPLIED TO THE STOCHASTIC TRANSPORTATION PROBLEM , 1984 .

[17]  Kaj Holmberg,et al.  A convergence proof for linear mean value cross decomposition , 1994, Math. Methods Oper. Res..

[18]  K. Jörnsten,et al.  Cross decomposition applied to the stochastic transportation problem , 1984 .

[19]  D. Bertsekas,et al.  The relax codes for linear minimum cost network flow problems , 1988 .

[20]  J. F. Benders.  Partitioning procedures for solving mixed-variables programming problems , 1962 .

[21]  J. Kornai,et al.  Two-Level Planning , 1965 .

[22]  Dan Wilson,et al.  Tighter Bounds for Stochastic Transportation Models , 1973 .

[23]  S. Elmaghraby.  Allocation under Uncertainty when the Demand has Continuous D.F. , 1960 .

[24]  L. Cooper,et al.  Stochastic transportation problems and other newtork related convex problems , 1977 .