Journal ArticleDOI
Warehouse-Retailer Network Design Problem
Chung-Piaw Teo,Jia Shu +1 more
TLDR
This paper considers the trade-off between inventory cost, direct shipment cost, and facility location cost in such a system and shows that the moderate size distribution network design problem can be solved efficiently via this approach.Abstract:
In this paper, we study the distribution network design problem integrating transportation and infinite horizon multiechelon inventory cost function. We consider the trade-off between inventory cost, direct shipment cost, and facility location cost in such a system. The problem is to determine how many warehouses to set up, where to locate them, how to serve the retailers using these warehouses, and to determine the optimal inventory policies for the warehouses and retailers. The objective is to minimize the total multiechelon inventory, transportation, and facility location costs. To the best of our knowledge, none of the papers in the area of distribution network design has explicitly addressed the issues of the 2-echelon inventory cost function arising from coordination of replenishment activities between the warehouses and the retailers. We structure this problem as a set-partitioning integer-programming model and solve it using column generation. The pricing subproblem that arises from the column generation algorithm gives rise to a new class of the submodular function minimization problem. We show that this pricing subproblem can be solved inO( n?log? n) time, wheren is the number of retailers. Computational results show that the moderate size distribution network design problem can be solved efficiently via this approach.read more
Citations
More filters
Journal ArticleDOI
Facility location and supply chain management - A review
TL;DR: Basic features that facility location models must capture to support decision-making involved in strategic supply chain planning are identified and applications ranging across various industries are presented.
Journal ArticleDOI
Drones for disaster response and relief operations: A continuous approximation model
TL;DR: This paper proposes a Continuous Approximation model that designs the potentiality of drones as a mode of transportation to supply emergency commodities in a disaster-affected region and conducts extensive sensitivity analysis to reveal insights into how system design varies with key drone design parameters.
Journal ArticleDOI
Capacitated warehouse location model with risk pooling
TL;DR: The capacitated warehouse location model with risk pooling (CLMRP) is introduced, which captures the interdependence between capacity issues and the inventory management at the warehouses, and a Lagrangian relaxation solution algorithm is proposed for the linear relaxation of this subproblem.
Journal ArticleDOI
An integrated production–distribution model for the dynamic location and allocation problem with safety stock optimization
TL;DR: An original model for the dynamic location-allocation problem with control of customer service level and safety stock optimization is presented and an industrial application is illustrated demonstrating the effectiveness of the proposed optimization approach.
Journal ArticleDOI
Reliable p-median facility location problem: two-stage robust models and algorithms
TL;DR: Wang et al. as mentioned in this paper proposed a set of two-stage robust optimization models to design reliable p-median facility location networks subject to disruptions, and implemented the column-and-constraint generation method with customized enhancement strategies, which is more effective than Benders cutting plane method.
References
More filters
Book
Integer and Combinatorial Optimization
TL;DR: This chapter discusses the Scope of Integer and Combinatorial Optimization, as well as applications of Special-Purpose Algorithms and Matching.
Book
Geometric Algorithms and Combinatorial Optimization
TL;DR: In this article, the Fulkerson Prize was won by the Mathematical Programming Society and the American Mathematical Society for proving polynomial time solvability of problems in convexity theory, geometry, and combinatorial optimization.
Book
Vehicle routing: methods and studies
Bruce L. Golden,Arjang A. Assad +1 more
TL;DR: Algorithmic Techniques for Vehicle Routing Systems and Models for Complex Routing Environments.
Journal ArticleDOI
A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time
TL;DR: This work gives a strongly polynomial-time algorithm minimizing a submodular function f given by a value-giving oracle that does not use the ellipsoid method or any other linear programming method.