%0 Journal Article %T A relax-and-price heuristic for the inventory-location-routing problem %+ Laboratoire d'Optimisation des Systèmes Industriels (LOSI) %+ Universidad de los Andes [Bogota] (UNIANDES) %+ Escuela Colombiana de Ingeniería Julio Garavito [Bogota] %A Guerrero, William, Javier %A Prodhon, Caroline %A Velasco, Nubia %A Amaya, Ciro, A. %< avec comité de lecture %@ 0969-6016 %J International Transactions in Operational Research %I Wiley %V 22 %N 1 %P 129-148 %8 2015-01 %D 2015 %R 10.1111/itor.12091 %K inventory‐location‐routing problem %K Lagrangian relaxation %K column generation %K supply chain design %K vehicle routing problem %Z Computer Science [cs]/Operations Research [cs.RO]Journal articles %X This paper considers the problem of designing a supply chain assuming routing decisions. The objective is to select a subset of depots to open from a set of candidates, the inventory policies for a two‐echelon system, and the set of routes to perform distribution from the upper echelon to the next by a homogeneous fleet of vehicles over a finite planning horizon considering deterministic demand. To solve the problem, a partition is proposed using a Dantzig–Wolfe formulation on the routing variables. A hybridization between column generation, Lagrangian relaxation, and local search is presented within a heuristic procedure. Results demonstrate the capability of the algorithm to compute high quality solutions and empirically estimate the improvement in the cost function of the proposed model at up to 9% compared to the sequential approach. Furthermore, the suggested pricing problem is a new variant of the shortest path problem with applications in urban transportation and telecommunications. %G English %L hal-02478732 %U https://utt.hal.science/hal-02478732 %~ CNRS %~ UNIV-TROYES %~ UTT %~ LOSI