Advertisement

A Scenario-Based Heuristic for a Capacitated Transportation-Inventory Problem with Stochastic Demands

  • Paveena Chaovalitwongse
  • H. Edwin Romeijn
  • Panos M. Pardalos
Part of the Applied Optimization book series (APOP, volume 74)

Abstract

A single-period multi-warehouse multi-retailer system with uncertain demands at the retailers and finite capacities at the warehouses is considered. The problem is to determine shipment sizes from each warehouse to each retailer at minimium costs. The cost components are the expected overage and underage costs at the end of the period, as well as the transportation costs corresponding to the shipments. The transportation costs have a fixed-charge structure. A scenario-based approach is proposed, and the corresponding approximating problem is solved by a generalization of the Dynamic Slope Scaling Procedure, which has been developed as a heuristic for fixed-charge network flow problems. The performance of the heuristic is tested by comparing to the optimal solution to the scenario-problem, as well as to a lowerbound on the true optimal costs.

Keywords

Capacitated transportation/inventory problem fixed charge costs global optimization heuristics supply chain optimization 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Balakrishnan, A. and Graves, S. (1989). A composite algorithm for a concave-cost network flow problem. Networks, 19: 175–202.CrossRefGoogle Scholar
  2. Bell, G., Lamar, B., and Wallace, C. (1999). Capacity improvement, penalties, and the fixed charge transportation problem. Naval Research Logistics, 46: 341–355.CrossRefGoogle Scholar
  3. Chaovalitwongse, P., Romeijn, H., and Pardalos, P. (2001). A Lagrange-based heuristic for a capacitated transportation-inventory problem with stochastic demands. Working paper, Department of Industrial and Systems Engineering, University of Florida, Gainesville, Florida.Google Scholar
  4. Guisewite, G. and Pardalos, P. (1991). Minimum concave cost network flow problems: Applications, complexity, and algorithms. Annals of Operations Research, 25: 245–265.Google Scholar
  5. Horst, R., Pardalos, P., and Thoai, N. (2000). Introduction to Global Optimization. Kluwer Academic Publishers, Dordrecht, The Netherlands, 2 edition.Google Scholar
  6. Kim, D. and Pardalos, P. (1999). A solution approach to the fixed charge netwok flow problem using a dynamic slope scaling procedure. Operations Research Letters, 24: 195–203.CrossRefGoogle Scholar
  7. Kim, D. and Pardalos, P. (2000a). A dynamic domain contraction algorithm for nonconvex piecewise linear network flow problems. Journal of Global Optimization, 17: 225–234.CrossRefGoogle Scholar
  8. Kim, D. and Pardalos, P. (2000b). A dynamic slope scaling and trust interval techniques for solving concave piecewise linear network flow problems. Networks, 35 (3): 216–222.CrossRefGoogle Scholar
  9. Lau, H. (1997). Simple formulas for the expected costs in the newsboy problem: an educational note. European Journal of Operational Research, 100: 557–561.CrossRefGoogle Scholar
  10. Lau, H. and Lau, H. (1995). The multi-product multi-constraint newsboy problem: Application, formulation, and solution. European Journal of Operational Research, 31: 153–162.Google Scholar
  11. Lau, H. and Lau, H. (1996). The newsstand problem: A capacitated multiproduct single-period inventory problem. European Journal of Operational Research, 94: 29–42.CrossRefGoogle Scholar
  12. Moon, I. and Silver, E. (2000). The multi-item newsvendor problem with a budget constraint and fixed ordering cost. Journal of the Operational Research Society, 51: 602–608.Google Scholar
  13. Murty, K. (1968). Solving the fixed charge problem by ranking the extreme points. Operations Research, 16: 268–279.CrossRefGoogle Scholar
  14. Nahmias, S. (1997). Production and Operations Analysis. Irwin, Chicago, Illinois.Google Scholar
  15. Pardalos, R and Rosen, J. (1986). Methods for global concave minimization: A bibliographic survey. SIAM Review, 28: 367–379.CrossRefGoogle Scholar
  16. Rockafellar, R. (1970). Convex Analysis. Princeton University Press, Princeton, New Jersey.Google Scholar
  17. Silver, E., Pyke, D., and Peterson, R. (1998). Inventory Management and Production Planning and Scheduling. John Wiley Sons, New York, New York.Google Scholar
  18. Sivazlian, B. and Stanfel, L. (1975).Analysis of Systems in Operations Research. Prentice-Hall, Englewood Cliffs, New Jersey.Google Scholar
  19. Tuy, H. (1995). D.C. optimization: theory, methods and algorithms. In Horst, R. and Pardalos, R, editors, Handbook of Global Optimization, pages 149–216. Kluwer Academic Publishers, Dordrecht, The Netherlands.Google Scholar
  20. Winston, W. (1994). Operations Research: Applications and Algorithms. Duxbury Press, Belmont, California.Google Scholar
  21. Zangwill, W. (1968). Minimum concave cost flows in certain networks. Management Science, 14: 429–450.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media Dordrecht 2002

Authors and Affiliations

  • Paveena Chaovalitwongse
    • 1
  • H. Edwin Romeijn
    • 2
  • Panos M. Pardalos
    • 2
  1. 1.Department of Industrial Engineering Faculty of EngineeringChulalongkorn UniversityPatumwan BangkokThailand
  2. 2.Department of Industrial and Systems EngineeringUniversity of FloridaGainesvilleUSA

Personalised recommendations