Journal Article10.1007/S11081-013-9245-3
An efficient optimization procedure for designing a capacitated distribution network with price-sensitive demand
21
TL;DR: The numerical study indicates that the proposed algorithms are highly efficient and effective for solving large-sized instances of the location-allocation problem in a supply-chain distribution network with capacitated distribution centers and customers with price-sensitive demands.
read more
Abstract: This paper considers a location-allocation problem in a supply-chain distribution network with capacitated distribution centers and customers with price-sensitive demands. The problem determines location, allocation and price decisions in order to maximize the total profit under two supply policies. Serving all of the customers is compulsory under the first policy, but is optional under the second. The problem is formulated as a mixed-integer linear program and solved by a Lagrangian relaxation algorithm under each policy. The numerical study indicates that the proposed algorithms are highly efficient and effective for solving large-sized instances of the problem.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
A survey of healthcare facility location
TL;DR: A framework to classify different types of non-emergency and emergency HCFs in terms of location management is presented, and the literature based on the framework is reviewed and future research possibilities are analyzed.
475
Dynamic supply chain network design with capacity planning and multi-period pricing ☆
TL;DR: In this paper, a new problem in designing and planning a multi-echelon and multi-product supply chain network over a mult-period horizon in which customer zones have price-sensitive demands is addressed.
86
Incorporating location, inventory and price decisions into a supply chain distribution network design problem
TL;DR: The goal of this paper is to study a profit-maximization location-inventory problem in a multi-commodity supply chain distribution network with price-sensitive demands, formulated as a mixed-integer nonlinear programming model and solved using a Lagrangian relaxation algorithm.
65
A multi-stage stochastic program for supply chain network redesign problem with price-dependent uncertain demands
TL;DR: A novel multi-stage stochastic program is proposed to simultaneously make tactical decisions including products’ prices and strategic redesign decisions to solve a multi-period supply chain network redesign problem in which customer zones have price-dependent Stochastic demand for multiple products.
65
A location-inventory-pricing model in a supply chain distribution network with price-sensitive demands and inventory-capacity constraints
TL;DR: In this paper, a location-inventory-pricing model for designing the distribution network of a supply chain with price-sensitive demands and inventory-capacity constraints is presented, and an efficient Lagrangian relaxation algorithm is proposed to solve the model.
58
References
The Lagrangian Relaxation Method for Solving Integer Programming Problems
TL;DR: This paper is a review of Lagrangian relaxation based on what has been learned in the last decade and has led to dramatically improved algorithms for a number of important problems in the areas of routing, location, scheduling, assignment and set covering.
2.4K
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.
2K
Validation of subgradient optimization
TL;DR: It is concluded that the “relaxation” procedure for approximately solving a large linear programming problem related to the traveling-salesman problem shows promise for large-scale linear programming.
1.4K
•Book
Nonlinear optimization
Andrzej Ruszczyński
- 01 Jan 2006
TL;DR: This book will help readers to understand the mathematical foundations of the modern theory and methods of nonlinear optimization and to analyze new problems, develop optimality theory for them, and choose or construct numerical solution methods.
1.1K