Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Effective local search approaches for the single-vehicle cyclic inventory routing problem

Effective local search approaches for the single-vehicle cyclic inventory routing problem 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png International Journal of Services Operations and Informatics Inderscience Publishers

Effective local search approaches for the single-vehicle cyclic inventory routing problem

Loading next page...
 
/lp/inderscience-publishers/effective-local-search-approaches-for-the-single-vehicle-cyclic-CScPcZaF1q
Publisher
Inderscience Publishers
Copyright
Copyright © Inderscience Enterprises Ltd. All rights reserved
ISSN
1741-539X
eISSN
1741-5403
DOI
10.1504/IJSOI.2012.052179
Publisher site
See Article on Publisher Site

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.

Journal

International Journal of Services Operations and InformaticsInderscience Publishers

Published: Jan 1, 2012

There are no references for this article.