Analysis and Solution Developement of the Single-Vehicle Inventory Routing Problem

7Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The inventory routing problem (IRP) is a challenging optimization problem underlying the vendor managed inventory policy. In this paper, we focus on a particular case of this problem, namely, the long-term single-vehicle IRP with stable demand rates. The objective is thus to develop an optimal cyclical distribution plan, of a single product, from a single distribution center to a set of selected customers. After an analysis of the problem's features, we propose and discuss a hybrid approximation algorithm to solve the problem. The approach is then tested on some randomly generated problems to evaluate its performance. © Springer-Verlag Berlin Heidelberg 2008.

Cite

CITATION STYLE

APA

Zhong, Y., & Aghezzaf, E. H. (2008). Analysis and Solution Developement of the Single-Vehicle Inventory Routing Problem. In Communications in Computer and Information Science (Vol. 14, pp. 369–378). https://doi.org/10.1007/978-3-540-87477-5_40

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free