A Novel Bi-Level Programming Model for Facility Location in Supply Chain Network Design

ICTE 2011 ◽  
2011 ◽  
Author(s):  
Mi Gan ◽  
Weihua Lin ◽  
Si Chen ◽  
Xi Huang
2020 ◽  
Vol 2020 ◽  
pp. 1-15
Author(s):  
Jian Wang ◽  
Xueyan Wang ◽  
Mingzhu Yu

This paper studies a supply chain network design model with price competition. The supply chain provides multiple products for a market area in multiple periods. The model considers the location of manufacturers and retailers and assumes a probabilistic customer behavior based on an attraction function depending on both the location and the quality of the retailers. We aim to design the supply chain under the capacity constraint and maximize the supply chain profit in the competitive environment. The problem is formulated as a mixed integer nonlinear programming model. To solve the problem, we propose two heuristic algorithms—Simulated Annealing Search (SA) and Particle Swarm Optimization (PSO)—and numerically demonstrate the effectiveness of the proposed algorithms. Through the sensitivity analysis, we give some management insights.


2021 ◽  
Vol 55 (2) ◽  
pp. 811-840
Author(s):  
Amin Reza Kalantari Khalil Abad ◽  
Seyed Hamid Reza Pasandideh

In this paper, a novel chance-constrained programming model has been proposed for handling uncertainties in green closed loop supply chain network design. In addition to locating the facilities and establishing a flow between them, the model also determines the transportation mode between facilities. The objective functions are applied to minimize the expected value and variance of the total cost CO2 released is also controlled by providing a novel chance-constraint including a stochastic upper bound of emission capacity. To solve the mathematical model using the General Algebraic Modeling System (GAMS) software, four multi-objective decision-making (MODM) methods were applied. The proposed methodology was subjected to various numerical experiments. The solutions provided by different methods were compared in terms of the expected value of cost, variance of cost, and CPU time using Pareto-based analysis and optimality-based analysis. In Pareto-based analysis, a set of preferable solutions were presented using the Pareto front; then optimality-based optimization was chosen as the best method by using a Simple Additive Weighting (SAW) method. Experimental experiments and sensitivity analysis demonstrated that the performance of the goal attainment method was 13% and 24% better that of global criteria and goal programming methods, respectively.


Sign in / Sign up

Export Citation Format

Share Document