Carregant...
Carregant...

Vés al contingut (premeu Retorn)

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

Autor
Vansteenwegen, P.; Mateo, M.
Tipus d'activitat
Article en revista
Revista
European journal of operational research
Data de publicació
2014-09-16
Volum
237
Número
3
Pàgina inicial
802
Pàgina final
813
DOI
https://doi.org/10.1016/j.ejor.2014.02.020 Obrir en finestra nova
Repositori
http://hdl.handle.net/2117/23355 Obrir en finestra nova
URL
http://www.sciencedirect.com/science/article/pii/S0377221714001350 Obrir en finestra nova
Resum
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...
Citació
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.
Paraules clau
Inventory, Iterated local search, MANAGEMENT, Metaheuristic, ORIENTEERING PROBLEM, Routing, SYSTEMS, Single-vehicle cyclic inventory routing problem
Grup de recerca
SCOM - Supply Chain and Operations Management

Participants