Effective Heuristics for Multiproduct Partial Shipment Models

Milind Dawande (), Srinagesh Gavirneni () and Sridhar Tayur ()
Additional contact information
Milind Dawande: School of Management, University of Texas at Dallas, Mail Station SM 30, Richardson, Texas 75083-0688
Srinagesh Gavirneni: Johnson Graduate School of Management, Cornell University, Ithaca, New York
Sridhar Tayur: Tepper School of Business, Carnegie Mellon University, Pittsburgh, Pennsylvania

Operations Research, 2006, vol. 54, issue 2, 337-352

Abstract: Motivated by real applications, we consider the problem of shipping products to multiple customers from limited inventory. After formulating the optimization problems under different restrictions on partial shipments, we find that commercially available packages, applied directly, are unsatisfactory, as are simple greedy approaches. We develop a scheme of heuristics that enables the user to select a good balance between computation time and effectiveness. A detailed computational study of one- and two-period industrial-sized problems indicates that these heuristics are computationally practical and generate solutions that are, on average, within 3%--4% of the optimum.

Keywords: partial shipments; integer programming models; heuristics (search for similar items in EconPapers)
Date: 2006
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.1050.0263 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:54:y:2006:i:2:p:337-352

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().