Loading...
Loading...

Go to the content (press return)

An iterated local search algorithm for the single-vehicle cyclic inventory routing problem

Author
Vansteenwegen, P.; Mateo, M.
Type of activity
Journal article
Journal
European journal of operational research
Date of publication
2014-09-16
Volume
237
Number
3
First page
802
Last page
813
DOI
https://doi.org/10.1016/j.ejor.2014.02.020 Open in new window
Repository
http://hdl.handle.net/2117/23355 Open in new window
URL
http://www.sciencedirect.com/science/article/pii/S0377221714001350 Open in new window
Abstract
The Single-Vehicle Cyclic Inventory Routing Problem (SV-CIRP) belongs to the class of Inventory Routing Problems (IRP) in which the supplier optimises both the distribution costs and the inventory costs at the customers. The goal of the SV-CIRP is to minimise both kinds of costs and to maximise the collected rewards, by selecting a subset of customers from a given set and determining the quantity to be delivered to each customer and the vehicle routes, while avoiding stockouts. A cyclic distribu...
Citation
Vansteenwegen, P.; Mateo, M. An iterated local search algorithm for the single-vehicle cyclic inventory routing problem. "European journal of operational research", 16 Setembre 2014, vol. 237, núm. 3, p. 802-813.
Keywords
Inventory, Iterated local search, MANAGEMENT, Metaheuristic, ORIENTEERING PROBLEM, Routing, SYSTEMS, Single-vehicle cyclic inventory routing problem
Group of research
SCOM - Supply Chain and Operations Management

Participants