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

Date

2012-07-01

Author

Solyali, Oguz
Süral, Haldun

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

141
views

0
downloads

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.

Subject Keywords

One-warehouse multi-retailer problem, Lot sizing, Strong formulations, Integer programming

URI

https://hdl.handle.net/11511/38318

Journal

ANNALS OF OPERATIONS RESEARCH

DOI

https://doi.org/10.1007/s10479-011-1022-0

Collections

Department of Industrial Engineering, Article

Suggestions

OpenMETU
Core

The Impact of Modeling on Robust Inventory Management Under Demand Uncertainty Solyali, Oguz; Cordeau, Jean-Francois; Laporte, Gilbert (2016-04-01) This study considers a basic inventory management problem with nonzero fixed order costs under interval demand uncertainty. The existing robust formulations obtained by applying well-known robust optimization methodologies become computationally intractable for large problem instances due to the presence of binary variables. This study resolves this intractability issue by proposing a new robust formulation that is shown to be solvable in polynomial time when the initial inventory is zero or negative. Becau...
A Branch-and-Cut Algorithm Using a Strong Formulation and an A Priori Tour-Based Heuristic for an Inventory-Routing Problem Solyali, Oguz; Süral, Haldun (2011-08-01) We address a vendor-managed inventory-routing problem where a supplier ( vendor) receives a given amount of a single product each period and distributes it to multiple retailers over a finite time horizon using a capacitated vehicle. Each retailer faces external dynamic demand and is controlled by a deterministic order-up-to level policy requiring that the supplier raise the retailer's inventory level to a predetermined maximum in each replenishment. The problem is deciding on when and in what sequence to v...
Robust Inventory Routing Under Demand Uncertainty Solyali, Oguz; Cordeau, Jean-Francois; Laporte, Gilbert (2012-08-01) This paper introduces a robust inventory routing problem where a supplier distributes a single product to multiple customers facing dynamic uncertain demands over a finite discrete time horizon. The probability distribution of the uncertain demand at each customer is not fully specified. The only available information is that these demands are independent and symmetric random variables that can take some value from their support interval. The supplier is responsible for the inventory management of its custo...
The multiple retailer inventory routing problem with backorders Alişan, Onur; Süral, Haldun; Department of Industrial Engineering (2008) In this study we consider an inventory routing problem in which a supplier distributes a single product to multiple retailers in a finite planning horizon. Retailers should satisfy the deterministic and dynamic demands of end customers in the planning horizon, but the retailers can backorder the demands of end customers considering the supply chain costs. In each period the supplier decides the retailers to be visited, and the amount of products to be supplied to each retailer by a fleet of vehicles. The de...
One-warehouse multi-retailer problem under inventory control and transportation policies Solyalı, Oğuz; Süral, Haldun; Department of Industrial Engineering (2008) We consider a one-warehouse multi-retailer system where the warehouse orders or receives from its supplier and replenishes multiple retailers with direct shipping or multi-stop routing over a finite time horizon. The warehouse has the knowledge of external (deterministic) demands at the retailers and manages their inventories while ensuring no stock-out. We consider two problems with direct shipping policy and two problems with routing policy. For the direct shipping policy, the problem is to determine the ...

Citation Formats

O. Solyali and H. Süral, “The one-warehouse multi-retailer problem: reformulation, classification, and computational results,” ANNALS OF OPERATIONS RESEARCH, pp. 517–541, 2012, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/38318.