Mixed Integer Linear Programming for delivery planning in Joint Replenishment Problems

Author

Rahmouni, Mouna ; Hennet, Jean-Claude ; Fnaiech, Farhat

Author_Institution

Image & Intell. Control of Ind. Process (SICISI, ESSTT Univ. of Tunis, Tunis, Tunisia

fYear

2013

fDate

6-8 May 2013

Firstpage

665

Lastpage

670

Abstract

This paper deals with the Joint Replenishment Problem (JRP) in multi item and multi site settings based on the common cycle strategy. The proposed delivery planning method, in deterministic and constant demand environment, uses Mixed Integer Linear Programming (MILP) algorithm. It is shown that the proposed MILP method gives better results in terms of reduced total replenishment cost than the standard delivery policy for which there is a periodicity of delivery for all the pairs (product, site).

Keywords

integer programming; linear programming; logistics; JRP; MILP algorithm; common cycle strategy; constant demand environment; delivery planning method; deterministic environment; joint replenishment problem; mixed integer linear programming algorithm; multiitem setting; multisite settings; standard delivery policy; total replenishment cost reduction; Analytical models; Cost function; Joints; Linear programming; Numerical models; Planning; Transportation; Inventory theory; Joint Replenishment Problems; common cycle model;

fLanguage

English

Publisher

ieee

Conference_Titel

Control, Decision and Information Technologies (CoDIT), 2013 International Conference on

Conference_Location

Hammamet

Print_ISBN

978-1-4673-5547-6

Type

conf

DOI

10.1109/CoDIT.2013.6689622

Filename

6689622