Please use this identifier to cite or link to this item:
Title: A two-echelon inventory system with transportation capacity constraint
Authors: Huang, H.C. 
Chew, E.P. 
Goh, K.H.
Keywords: Heuristics
Integer programming
Staggering of deliveries
Stationary policy
Transportation capacity
Zero inventory ordering policy
Issue Date: 16-Nov-2005
Citation: Huang, H.C., Chew, E.P., Goh, K.H. (2005-11-16). A two-echelon inventory system with transportation capacity constraint. European Journal of Operational Research 167 (1) : 129-143. ScholarBank@NUS Repository.
Abstract: Consider a one-warehouse multi-retailer system under constant and deterministic demand, which is subjected to transportation capacity for every delivery period. To search for the best stationary zero inventory ordering (ZIO) policy, or the best power-of-two policy, or the best nested policy, the problem is formulated as a 0-1 integer linear program in which the objective function comprises of a fixed transportation cost whenever a delivery is made and the inventory costs for both the warehouse and retailers. To overcome the transportation capacity limitation, we extend the policies to allow for staggering deliveries. It is shown that with transportation capacity constraint the non-staggering policy can have its effectiveness close to 0% from the best staggering policy and the power-of-two policy with staggering allowed can have its effectiveness close to 0% from the optimal policy. Nevertheless in general, the power-of-two policy fairs well on a number of randomly generated problems. To solve the large distribution network problem, an efficient heuristic based on the power-of-two policy with staggering of deliveries is suggested. © 2004 Elsevier B.V. All rights reserved.
Source Title: European Journal of Operational Research
ISSN: 03772217
DOI: 10.1016/j.ejor.2004.01.051
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.


checked on Jan 12, 2019


checked on Jan 2, 2019

Page view(s)

checked on Dec 15, 2018

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.