A production-transportation problem with stochastic demand and concave production costs

Well known extensions of the classical transportation problem are obtained by including fixed costs for the production of goods at the supply points (facility location) and/or by introducing stochastic demand, modeled by convex nonlinear costs, at the demand points (the stochastic transportation problem, [STP]). However, the simultaneous use of concave and convex costs is not very well treated in the literature. Economies of scale often yield concave cost functions other than fixed charges, so in this paper we consider a problem with general concave costs at the supply points, as well as convex costs at the demand points. The objective function can then be represented as the difference of two convex functions, and is therefore called a d.c. function. We propose a solution method which reduces the problem to a d.c. optimization problem in a much smaller space, then solves the latter by a branch and bound procedure in which bounding is based on solving subproblems of the form of [STP]. We prove convergence of the method and report computational tests that indicate that quite large problems can be solved efficiently. Problems up to the size of 100 supply points and 500 demand points are solved.

[1]  Hoang Tuy,et al.  The complementary convex structure in global optimization , 1992, J. Glob. Optim..

[2]  Hoang Tuy,et al.  D.C. Optimization: Theory, Methods and Algorithms , 1995 .

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

[4]  P. França,et al.  Solving Stochastic Transportation-Location Problems by Generalized Benders Decomposition , 1982 .

[5]  L. Cooper,et al.  The Transportation-Production Problem , 1974 .

[6]  Kaj Holmberg,et al.  On the convergence of cross decomposition , 1990, Math. Program..

[7]  Panos M. Pardalos,et al.  Constrained Global Optimization: Algorithms and Applications , 1987, Lecture Notes in Computer Science.

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

[9]  P. Pardalos,et al.  Greedy Randomized Adaptive Search for a Location Problem with Economies of Scale , 1997 .

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

[11]  A. M. Geoffrion.  Generalized Benders decomposition , 1972 .

[12]  L. LeBlanc.  A heuristic approach for large scale discrete stochastic transportation-location problems , 1977 .

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

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

[15]  Panos M. Pardalos,et al.  Minimum concave-cost network flow problems: Applications, complexity, and algorithms , 1991 .

[16]  Hoang Tuy,et al.  On nonconvex optimization problems with separated nonconvex variables , 1992, J. Glob. Optim..

[17]  J. E. Falk,et al.  An Algorithm for Separable Nonconvex Programming Problems , 1969 .

[18]  Aimo A. Törn,et al.  Global Optimization , 1999, Science.

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

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

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

[22]  Reiner Horst,et al.  Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and D.C. Optimization problems , 1988, Math. Program..

[23]  Kaj Holmberg,et al.  Efficient decomposition and linearization methods for the stochastic transportation problem , 1995, Comput. Optim. Appl..

[24]  H. Tuy.  Global Minimization of a Difference of Two Convex Functions , 1987 .