Graphical abstract Display Omitted
Highlights We provide a new exact algorithm for the inventory-routing problem with logistic ratio (IRP-LR). The IRP-LR contains a fractional objective function, and is solved iteratively. We prove that our method converges and compare its performance on bench-mark instances from the literature. We significantly improve the results of a competing algorithm.
Abstract The Inventory Routing Problem with Logistic Ratio (IRPLR) is a variant of the classical IRP where, instead of the total distribution cost, the ratio between the total distribution cost and the total delivered quantity is minimized, giving rise to a fractional objective function. An exact algorithm is known, solving instances with up to 15 customers. We propose an iterative exact algorithm where, at each iteration, an IRP with a linear objective function is solved. Experiments show that the proposed algorithm is faster when the number of vehicles is small, solving instances with more customers and a longer planning horizon.
An exact algorithm for the inventory routing problem with logistic ratio
2019-09-27
12 pages
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
Minimizing the logistic ratio in the inventory routing problem
Online Contents | 2017
|Transportation Research Record | 2013
|An Exact Algorithm for the Vehicle Routing Problem with Backhauls
British Library Online Contents | 1997
|An Exact Algorithm for the Vehicle Routing Problem with Backhauls
Online Contents | 1997
|An Exact Algorithm for the Green Vehicle Routing Problem
Online Contents | 2017