The University of Southampton
University of Southampton Institutional Repository

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

Replenishment routing problems between a single supplier and multiple retailers with direct delivery
Replenishment routing problems between a single supplier and multiple retailers with direct delivery
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.
inventory, replenishment, routing, chinese remainder theorem
0377-2217
412-420
Li, Jing-An
4e36d01e-6262-4cba-a1b0-f1cb6310bf28
Wu, Yue
e279101b-b392-45c4-b894-187e2ded6a5c
Lai, Kin Keung
9c369b98-74f9-44aa-8a5f-00675cea1f6b
Liu, Ke
880cb688-a3be-46b7-980a-35519d3fd8a4
Li, Jing-An
4e36d01e-6262-4cba-a1b0-f1cb6310bf28
Wu, Yue
e279101b-b392-45c4-b894-187e2ded6a5c
Lai, Kin Keung
9c369b98-74f9-44aa-8a5f-00675cea1f6b
Liu, Ke
880cb688-a3be-46b7-980a-35519d3fd8a4

Li, Jing-An, Wu, Yue, Lai, Kin Keung and Liu, Ke (2008) Replenishment routing problems between a single supplier and multiple retailers with direct delivery. European Journal of Operational Research, 190 (2), 412-420. (doi:10.1016/j.ejor.2007.06.022).

Record type: Article

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.

This record has no associated files available for download.

More information

e-pub ahead of print date: 22 June 2007
Published date: 16 October 2008
Keywords: inventory, replenishment, routing, chinese remainder theorem

Identifiers

Local EPrints ID: 58636
URI: http://eprints.soton.ac.uk/id/eprint/58636
ISSN: 0377-2217
PURE UUID: 19fb9368-0b1b-4e2c-9384-66a2deb18e1a
ORCID for Yue Wu: ORCID iD orcid.org/0000-0002-1881-6003

Catalogue record

Date deposited: 18 Aug 2008
Last modified: 16 Mar 2024 03:39

Export record

Altmetrics

Contributors

Author: Jing-An Li
Author: Yue Wu ORCID iD
Author: Kin Keung Lai
Author: Ke Liu

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×