Loading...
Loading...

Go to the content (press return)

An exact algorithm for the single-vehicle cyclic inventory routing problem

Author
Aghezzaf, E.; Zhong, Y.; Raa, B.; Mateo, M.
Type of activity
Presentation of work at congresses
Name of edition
8th International Conference of Modeling and Simulation
Date of publication
2010
Presentation's date
2010-05-10
Book of congress proceedings
8th ENIM IFAC International Conference of Modeling and Simulation
First page
1
Last page
9
Repository
http://hdl.handle.net/2117/8719 Open in new window
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 ...
Citation
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.

Participants

  • Aghezzaf, El-Houssaine  (author and speaker )
  • Zhong, Yiqing  (author and speaker )
  • Raa, Birger  (author and speaker )
  • Mateo Doll, Manuel  (author and speaker )

Attachments