Minimizing Transportation and Inventory Costs for Several Products on a Single Link

Maria Grazia Speranza and Walter Ukovich
Additional contact information
Maria Grazia Speranza: University of Brescia, Brescia, Italy
Walter Ukovich: University of Trieste, Trieste, Italy

Operations Research, 1994, vol. 42, issue 5, 879-894

Abstract: This paper deals with the problem of determining the frequencies at which several products have to be shipped on a common link to minimize the sum of transportation and inventory costs. A set of feasible shipping frequencies is given. Transportation costs are supposed to be proportional to the number of journeys performed by vehicles of a given capacity. Vehicles may or may not be supposed to carry out completely all materials available, and products assigned to different frequencies may or may not share the same truck. Integer and mixed integer linear programming models are formulated for each of the resulting four situations, and their properties are investigated. In particular, we show that allowing products to be split among several shipping frequencies makes trucks traveling at high frequencies to be filled up completely. In this situation, trucks may always be loaded with products shipped at the same frequency.

Keywords: transportation; costs: cost effectiveness in freight transportation (search for similar items in EconPapers)
Date: 1994
References: Add references at CitEc
Citations: View citations in EconPapers (39)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.42.5.879 (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:42:y:1994:i:5:p:879-894

Access Statistics for this article

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