A heuristic optimisation algorithm for two-echelon (R, Q) inventory systems with non-identical retailers Online publication date: Mon, 14-Nov-2016
by Mohammad H. Al-Rifai; Manuel D. Rossetti; Alireza Sheikhzadeh
International Journal of Inventory Research (IJIR), Vol. 3, No. 2, 2016
Abstract: This paper describes an optimisation algorithm that minimises the total inventory investment of a one warehouse and an m non-identical retailer's inventory system using reorder point and order quantity (R, Q) policies. The inventory system is subject to constraints on the average ordering frequency and number of backorders. The system is decomposed by echelon and location, and analytical expressions are derived for the inventory policy parameters. Sets of computational experiments illustrate the effectiveness of the heuristic over a wide range of problem instances. Experimental results indicate that the heuristic optimisation algorithm is an effective procedure for optimising the sampled inventory systems regarding both the quality of the solutions and the computational times. This research provides approximations and a heuristic optimisation procedure for a two-echelon inventory system for the non-identical retailer's case.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Inventory Research (IJIR):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook