Exact and Heuristic Solutions for a Shipment Problem with Given Frequencies

Luca Bertazzi (), Maria Grazia Speranza () and Walter Ukovich ()
Additional contact information
Luca Bertazzi: Dipartimento di Metodi Quantitativi, University of Brescia, Italy
Maria Grazia Speranza: Dipartimento di Metodi Quantitativi, University of Brescia, Italy
Walter Ukovich: Dipartimento di Elettrotecnica, Elettronica ed Informatica, University of Trieste, Italy

Management Science, 2000, vol. 46, issue 7, 973-988

Abstract: 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.

Keywords: transportation; inventory; dominance rules; branch-and-bound; heuristics (search for similar items in EconPapers)
Date: 2000
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (11)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.46.7.973.12032 (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:ormnsc:v:46:y:2000:i:7:p:973-988

Access Statistics for this article

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