Algorithms for the multi-item multi-vehicles dynamic lot sizing problem

Research output: Contribution to journalArticlepeer-review


We consider a two-stage supply chain, in which multi-items are shipped from a manufacturing facility or a central warehouse to a downstream retailer that faces deterministic external demand for each of the items over a finite planning horizon. The items are shipped through identical capacitated vehicles, each incurring a fixed cost per trip. In addition, there exist item-dependent variable shipping costs and inventory holding costs at the retailer for items stored at the end of the period; these costs are constant over time. The sum of all costs must be minimized while satisfying the external demand without backlogging. In this paper we develop a search algorithm to solve the problem optimally. Our search algorithm, although exponential in the worst case, is very efficient empirically due to new properties of the optimal solution that we found, which allow us to restrict the number of solutions examined. Second, we perform a computational study that compares the empirical running time of our search methods to other available exact solution methods to the problem. Finally, we characterize the conditions under which each of the solution methods is likely to be faster than the others and suggest efficient heuristic solutions that we recommend using when the problem is large in all dimensions.

Original languageEnglish
Pages (from-to)157-169
Number of pages13
JournalNaval Research Logistics
Issue number2
StatePublished - Mar 2006


  • Inventory/transportation
  • Multi-item
  • Search algorithm


Dive into the research topics of 'Algorithms for the multi-item multi-vehicles dynamic lot sizing problem'. Together they form a unique fingerprint.

Cite this