Exact and Heuristic Solutions for a Shipment Problem with Given Frequencies
We consider the problem of shipping several products from an origin to a destination when a discrete set of shipping frequencies is available, in such a way that the sum of the transportation and inventory costs is minimized. This problem, which is known to be NP-hard, has applications in transportation planning and in location analysis. In this paper we derive dominance rules for the problem solutions that allow a tightening of the bounds on the problem variables and improve the efficiency of a known branch-and-bound algorithm. Moreover, we present some heuristics and compare them with two different modifications of an EOQ-type algorithm for the solution of the problem with continuous frequencies.
Volume (Year): 46 (2000)
Issue (Month): 7 (July)
|Contact details of provider:|| Postal: |
Web page: http://www.informs.org/
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:46:y:2000:i:7:p:973-988. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Mirko Janc)
If references are entirely missing, you can add them using this form.