Effective local search approaches for the single-vehicle cyclic inventory routing problem
by Yiqing Zhong; El-Houssaine Aghezzaf
International Journal of Services Operations and Informatics (IJSOI), Vol. 7, No. 4, 2012

Abstract: The single-vehicle cyclic inventory routing problem (SV-CIRP) is concerned with a cyclic distribution of a product from a single depot to a selected subset of retailers facing stable demands. If a retailer is selected for replenishment, the supplier collects a retailer-related reward. The objective is to select a subset of retailers to replenish, quantities to be delivered to each, and design delivery routes that minimise the expected total distribution and inventory costs while maximising the total collected rewards. The resulting distribution plan must prevent stockouts from occurring at each retailer. The underlying optimisation model for the SV-CIRP is formulated as a mixed integer program with linear constraints and a nonlinear objective function. An effective iterated local search based algorithm is developed to solve the problem. Various instances are generated to test the proposed algorithm. Numerical results show that it is very competitive and can find good quality solutions for the SV-CIRP in reasonable computational time.

Online publication date: Sat, 27-Dec-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 Services Operations and Informatics (IJSOI):
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