A tabu search-based heuristic for a new capacitated cyclic inventory routing problem
by Mehdi Seifbarghy; Zahra Samadi
International Journal of Mathematics in Operational Research (IJMOR), Vol. 6, No. 4, 2014

Abstract: In this paper, a special case of inventory routing problem, in which a distribution centre as the supplier distributes a single product to a set of sales-points using economic order quantity policy to manage inventories, is investigated. A fleet of homogeneous vehicles, each with a given capacity, is available for delivery of inventory to the sales-points served by a vehicle in a cyclical manner in such a way that at no moment a stock-out occurs. Demand rates at the sales-points are constant and known to the supplier. The proposed model in this paper extends the concept of vehicle multi-tours considering the inventory costs of the supplier; in other words, the objective is to minimise total ordering and inventory holding costs of the supplier coordinately with fleet operating, sales-points inventory holding and distribution costs during a given planning horizon. The frequency and routes by which each sales-point is to be served and the type of vehicles for this purpose are determined by this model. We have developed a tabu search-based heuristic to solve the problem. Because of the novelty of the model, a set of numerical examples is designed and solved in order to assess the performance of the model.

Online publication date: Sat, 26-Jul-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
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 Mathematics in Operational Research (IJMOR):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your 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