Replenishment routing problems between a single supplier and multiple retailers with direct delivery

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalpeer-review

16 Scopus Citations
View graph of relations


  • Jing-An Li
  • Yue Wu
  • Kin Keung Lai
  • Ke Liu

Related Research Unit(s)


Original languageEnglish
Pages (from-to)412-420
Journal / PublicationEuropean Journal of Operational Research
Issue number2
Publication statusPublished - 16 Oct 2008


We consider the replenishment routing problems of one supplier who can replenish only one of multiple retailers per period, while different retailers need different periodical replenishment. For simple cases satisfying certain conditions, we obtain the simple routing by which the supplier can replenish each retailer periodically so that shortage will not occur. For complicated cases, using number theory, especially the Chinese remainder theorem, we present an algorithm to calculate a feasible routing so that the supplier can replenish the selected retailers on the selected periods without shortages. © 2007 Elsevier B.V. All rights reserved.

Research Area(s)

  • Chinese remainder theorem, Inventory, Replenishment, Routing