An exact algorithm for the single-vehicle cyclic inventory routing problem
Visualitza/Obre
Tipus de documentComunicació de congrés
Data publicació2010
Condicions d'accésAccés obert
Llevat que s'hi indiqui el contrari, els
continguts d'aquesta obra estan subjectes a la llicència de Creative Commons
:
Reconeixement-NoComercial-SenseObraDerivada 3.0 Espanya
Abstract
The single-vehicle cyclic inventory routing problem (SV CIRP) consists of a repetitive
distribution of a product from a single depot to a selected subset of customers. For each customer that is
selected for replenishments, the supplier collects a corresponding xed reward. The objective is to determine
the subset of customers to replenish, the quantity of the product to be delivered to each, and to design the
vehicle route so that the resulting pro t (di erence between the total reward and the total logistical cost) is
maximized while preventing stockouts at each of the selected customers. In this paper, the SV CIRP is
formulated as a mixed-integer program with a nonlinear objective function. After an e cient analysis of
the problem, an exact algorithm for its solution is proposed. This exact algorithm requires only solutions of
linear mixed-integer programs. Values of an insertion-based heuristic for this problem are compared to the
optimal values obtained for a set of some test problems. In general the gap may get as large as 25%, which
justi es the e ort to continue exploring and developing exact and approximation algorithms for the SV CIRP.
CitacióAghezzaf, E. [et al.]. An exact algorithm for the single-vehicle cyclic inventory routing problem. A: International Conference of Modeling and Simulation. "8th International Conference of Modeling and Simulation". Hammamet: 2010, p. 1-9.
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
aghezzaf et al.pdf | Article | 1,941Mb | Visualitza/Obre |