DYNAMIC ALLOCATIONS FOR MULTI-PRODUCT DISTRIBUTION

Consider the problem of allocating multiple products by a distributor with limited capacity (truck size), who has a fixed sequence of customers (retailers) whose demands are unknown. Each time the distributor visits a customer, he gets information about the realization of the demand for this customer, but he does not yet know the demands of the following customers. The decision faced by the distributor is how much to allocate to each customer given that the penalties for not satisfying demand are not identical. In addition, we optimallyi solve the problem of loading the truck with the multiple products, given the limited storage capacity. This framework can also be used for the general problem of seat allocation in the airline industry. As with the truck in the distribution problem, the airplane has limited capacity.

  • Availability:
  • Corporate Authors:

    Operations Research Society of America

    1314 Guilford Avenue
    Baltimore, MD  United States  21202
  • Authors:
    • Bassok, Y
    • Ernst, R
  • Publication Date: 1995-8

Language

  • English

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 00712558
  • Record Type: Publication
  • Files: TRIS
  • Created Date: Oct 10 1995 12:00AM