Replenishment routing problems between a single supplier and multiple retailers with direct delivery
Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review
Author(s)
Related Research Unit(s)
Detail(s)
Original language | English |
---|---|
Pages (from-to) | 412-420 |
Journal / Publication | European Journal of Operational Research |
Volume | 190 |
Issue number | 2 |
Publication status | Published - 16 Oct 2008 |
Link(s)
Abstract
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
Citation Format(s)
Replenishment routing problems between a single supplier and multiple retailers with direct delivery. / Li, Jing-An; Wu, Yue; Lai, Kin Keung et al.
In: European Journal of Operational Research, Vol. 190, No. 2, 16.10.2008, p. 412-420.
In: European Journal of Operational Research, Vol. 190, No. 2, 16.10.2008, p. 412-420.
Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review