Lower bound on the logistic ratio objective function for bulk distribution inventory-routing problem

Rodolphe Giroudeau 1 Michel Vasquez 2 Tamara Jovanovic 1, 2
1 MAORE - Méthodes Algorithmes pour l'Ordonnancement et les Réseaux
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
Abstract : Bulk distribution inventory-routing problem (IRP) typically occurs in the gas indus- try. In this paper we tackle the one-to-many problem structure, where both customers and vehicules can have different capacities. Such problem is proposed by Air Liquide within ROADEF/EURO 2016 challenge. The objective function to be minimized is represented as so-called logistic ratio, which is the ratio between the total transportation cost and the total delivered amount of a concerned product. Time dimension of this problem is the main factor rising the complexity. All the routing and delivery decisions have to be made in terms of minutes, and the whole horizon can be given in terms of months. For this reason, it is very important to have some knowledge on the objective function behaviour. The logistic ratio, as an objective function of IRP, is not well studied in the literature. We define an LP and an iterative method that gives us a sequence of lower bounds to the optimal solution of our problem. The tightness of these lower bounds does not necessary depend on the total number of customers to be served, but on the number of small capacitated customers.
Document type :
Conference papers
Complete list of metadatas

Contributor : Rodolphe Giroudeau <>
Submitted on : Monday, October 10, 2016 - 2:18:21 PM
Last modification on : Monday, February 11, 2019 - 6:22:02 PM


  • HAL Id : lirmm-01378572, version 1



Rodolphe Giroudeau, Michel Vasquez, Tamara Jovanovic. Lower bound on the logistic ratio objective function for bulk distribution inventory-routing problem. VeRoLog: Vehicle Routing and Logistics optimization, Jun 2016, Nantes, France. ⟨lirmm-01378572⟩



Record views