The one-warehouse multi-retailer problem: reformulation, classification, and computational results

Abstract

We consider the one-warehouse multi-retailer problem where a warehouse replenishes multiple retailers with deterministic dynamic demands over a horizon. The problem is to determine when and how much to order to the warehouse and retailers such that the total system-wide costs are minimized. We propose a new (combined transportation and shortest path based) integer programming reformulation for the problem in addition to the echelon stock and transportation based formulations in the literature. We analyze the strength of the LP relaxations of three formulations and show that the new formulation is stronger than others. We also show that the new and transportation based formulations are equivalent for the joint replenishment problem, where the warehouse is a crossdocking facility. We extend all formulations to the case with initial inventory at the warehouse and reveal the relation among their LP relaxations. We present our computational experiments with all formulations over a set of randomly generated test instances.

Vessel Routing for Sweeping of Marine Litter in a Port Area

“…The branch-and-cut algorithm was able to optimally solve single-vehicle instances up to 50 customers with a planning horizon equal to 3 and up to 30 customers with a planning horizon equal to 6 within 2 hours computational time. A few years later a reformulation of this branch-and-cut algorithm was proposed by Solyali and Sural [2011] and Solyali and Sural [2012]. Quite recently exact algorithms for solving multi-vehicle instances have been proposed by Coelho and Laporte [2013a] and Adulyasak et al [2013].…”

Inventory routing problems with multiple customers

“…The case with transshipment is analyzed in Coelho et al (2012b) where an adaptive large neighborhood search heuristic is proposed. Solyalı and Süral (2012) present a combined transportation and shortest path based integer programming reformulation and show that it is stronger than existing ones.…”

A Three-Layer Supply Chain EPQ Model for Price- and Stock-Dependent Stochastic Demand with Imperfect Item Under Rework

“…Jha and Shanker [22] considered single vendor multiple buyer integrated production model with controlled lead time and service level constraints. The single-vendor multi-buyer integrated inventory supply chain in meeting deterministic demand has received a considerable attention of the researchers (namely, Lam and Ip [25], Hoque [18], Sarkar and Diponegoro [42], Zavanella and Zanoni [49,50]; Srinivas and Rao [46], Solyal and Sural [44], Ben-Daya et al [5], Jana et al [21], Huang et al [19], Pasandideh et al [35], Pasandideh et al [34], Lieckens and Vandaele [28], etc. ).…”