A relax-and-price heuristic for the inventory-location-routing problem - Archive ouverte HAL Access content directly
Journal Articles International Transactions in Operational Research Year : 2015

A relax-and-price heuristic for the inventory-location-routing problem

(1, 2, 3) , (1) , (1, 2) , (2)
1
2
3

Abstract

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.

Dates and versions

hal-02478732 , version 1 (14-02-2020)

Identifiers

Cite

William Javier Guerrero, Caroline Prodhon, Nubia Velasco, Ciro A. Amaya. A relax-and-price heuristic for the inventory-location-routing problem. International Transactions in Operational Research, 2015, 22 (1), pp.129-148. ⟨10.1111/itor.12091⟩. ⟨hal-02478732⟩

Collections

CNRS UTT LOSI
14 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More