Program > By author > André Jean

Wednesday 26
Polyhedral approaches, extended formulations and decomposition in integer programming
Pierre Fouilhoux
› 14:20 - 14:40 (20min)
› Bât. A - TD 33
Inventory Routing Problem with rational objective function
Emiliano Traversi  1, *@  , Mehdi Lamiri  2@  , Roberto Wolfler Calvo  1, *@  , Lucas Létocart  1@  , Jean André  2@  
1 : Laboratoire d'Informatique de Paris-Nord  (LIPN)  -  Website
Université Paris XIII - Paris Nord, CNRS : UMR7030, Institut Galilée
Institut Galilée 99, avenue J.B Clément 93430 VILLETANEUSE -  France
2 : Centre de Recherche Claude et Delorme
Air Liquide
CRCD Paris-Saclay 1, chemin de la Porte des Loges 78354 JOUY-EN-JOSAS -  France
* : Corresponding author

In this work we propose a column generation approach for solving the Inventory Routing Problem (IRP). The IRP is concerned with the distribution of a good from a set of sources to a set of customers over a given time horizon by using a homogeneous fleet of vehicles. We impose capacity constraints on the vehicles and time windows on the customers visited. We consider two versions of the problem: the first one is to minimize the total routing costs; the second one is to minimize the so-called non linear logistic ratio, i.e. the ratio between the total routing costs and the total quantity delivered over the time horizon. While both objective functions are common in practical application, only the first one has been studied deeply in practice. To the best of our knowledge, no exact approaches have been proposed in the literature for solving the IRP with the latter objective function. In order to deal with the rational objective function we introduce a suitable variables substitution, obtaining a linear formulation that can be used for computing valid lower bound for the problem within a global optimality framework.

A unified column generation approach is described for solving both versions of the problem and preliminary computational results are provided.

Online user: 1