MODELS AND ALGORITHMS FOR DISTRIBUTION PROBLEMS WITH UNCERTAIN DEMANDS

This paper considers the problem of distributing goods from one or more plants through a set of warehouses in anticipation of forecasted customer demands. Two results are provided in this paper. First, the authors present a methodology for approximating stochastic distribution problems that are computationally tractable for problems of realistic size. Comparisons are made to standard deterministic formulations and shown to give superior results. Then, they compare logistics networks with varying degrees of redundancy represented by the number of warehouses which serve each customer. Overlapping service regions for warehouses provides additional flexibility to handle real-time demands. The authors quantify the expected savings that might result from such strategies.

  • Availability:
  • Corporate Authors:

    Operations Research Society of America

    1314 Guilford Avenue
    Baltimore, MD  United States  21202
  • Authors:
    • Cheung, R K-M
    • Powell, W B
  • Publication Date: 1996-2

Language

  • English

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 00720577
  • Record Type: Publication
  • Files: TRIS, ATRI
  • Created Date: Apr 26 1996 12:00AM