Replenishment routing problems between a single supplier and multiple retailers with direct delivery |
| |
| Authors: | Jing-An Li Yue Wu Kin Keung Lai Ke Liu |
| |
| Institution: | 1. Institute of Systems Science, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing 100080, PR China;2. School of Management, University of Southampton, UK;3. Department of Management Sciences, City University of Hong Kong, Hong Kong, PR China;4. College of Business Administration, Hunan University, Changsha 410082, PR China;5. Institute of Applied Mathematics, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing 100080, PR China |
| |
| 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. |
| |
| Keywords: | Inventory Replenishment Routing Chinese remainder theorem |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
