Incorporating inventory and routing costs in strategic location models

We consider a supply chain design problem where the decision maker needs to decide the number and locations of the distribution centers (DCs). Customers face random demand, and each DC maintains a certain amount of safety stock in order to achieve a certain service level for the customers it serves....

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:European journal of operational research Ročník 179; číslo 2; s. 372 - 389
Hlavní autoři: Max Shen, Zuo-Jun, Qi, Lian
Médium: Journal Article
Jazyk:angličtina
Vydáno: Amsterdam Elsevier B.V 01.06.2007
Elsevier
Elsevier Sequoia S.A
Edice:European Journal of Operational Research
Témata:
Applied sciences
Cost control
Decision theory. Utility theory
Distribution centers
Distribution costs
Exact sciences and technology
Integer programming
Integrated supply chain design models
Inventory
Lagrange multiplier
Location models
Logistics
Nonlinear programming
Operational research and scientific management
Operational research. Management science
Optimization algorithms
Studies
Supply chain management
Supply chains
Vehicle routing
Integrated supply chain design models
Location models
Vehicle routing
Inventory
Distribution cost
Routing
Non linear programming
Polynomial method
Safety stock
Optimization
Integer programming
Lagrange multiplier
User service
Non linear model
Integrated design
Relaxation method
Localization
Logistics
ISSN:0377-2217, 1872-6860
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:We consider a supply chain design problem where the decision maker needs to decide the number and locations of the distribution centers (DCs). Customers face random demand, and each DC maintains a certain amount of safety stock in order to achieve a certain service level for the customers it serves. The objective is to minimize the total cost that includes location costs and inventory costs at the DCs, and distribution costs in the supply chain. We show that this problem can be formulated as a nonlinear integer programming model, for which we propose a Lagrangian relaxation based solution algorithm. By exploring the structure of the problem, we find a low-order polynomial algorithm for the nonlinear integer programming problem that must be solved in solving the Lagrangian relaxation sub-problems. We present computational results for several instances of the problem with sizes ranging from 40 to 320 customers. Our results show the benefits of having an integrated supply chain design framework that includes location, inventory, and routing decisions in the same optimization model.
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0377-2217
1872-6860
DOI:10.1016/j.ejor.2006.03.032