We study the problem of shipping products from one origin to several d
estinations, when a given set of possible shipping frequencies is avai
lable. The objective of the problem is the minimization of the transpo
rtation and inventory costs. We present different heuristic algorithms
and test them on a set of randomly generated problem instances. The h
euristics are based upon the idea of solving, in a first phase, single
link problems, and of locally improving the solution in subsequent ph
ases. (C) 1997 Published by Elsevier Science Ltd.