Single Stage Capacitated Warehouse Location Problem (SSCWLP) has been attempted by few researchers in the past. These are Geoffrion and Graves [1], Sharma [2], Sharma [3] and Sharma and Berry [4]. In this paper we giv...Single Stage Capacitated Warehouse Location Problem (SSCWLP) has been attempted by few researchers in the past. These are Geoffrion and Graves [1], Sharma [2], Sharma [3] and Sharma and Berry [4]. In this paper we give a “vertical decomposition” approach to solve SSCWLP that uses Lagrangian relaxation. This way SSCWLP is broken into two versions of capacitated plant location problem (the CPLP_L and CPLP_R) by relaxing the flow balance constraints. For CPLP_R, we use well known Lagrangian relaxations given in literature (Christofides and Beasley [5] and Nauss [6]);and adopt them suitably for solving CPLP_L. We show theoretically in this paper that SSCWLP can be more efficiently solved by techniques of vertical decomposition developed in this paper than the method available in literature (Sharma and Berry [4]). Encouraging computational study is reported in this paper.展开更多
In the past, researchers have applied Bender’s decomposition to distribution problem and used feasibility constraint to speed up the performance of Bender’s decomposition. Further, the application of Branch and Boun...In the past, researchers have applied Bender’s decomposition to distribution problem and used feasibility constraint to speed up the performance of Bender’s decomposition. Further, the application of Branch and Bound to single-stage multi-commodity single-period warehouse location problem (SSMCSPWLP) with strong constraints has shown that they are more effective. It was also shown in the previous research (in the context of Branch and Bound Methodology) that hybrid formulation for the single-stage single-period multi-commodity warehouse location problem yielded superior results. In this paper we apply Benders’ decomposition to strong and weak formulations of single-stage multi-commodity multi-period warehouse location problem (SSMCMPWLP). As suggested in the previous literature we put feasibility constraints in the pure integer sub- problem to speed up the performance of Benders’ decomposition. We also develop an additional cut (constraint that is again added to pure integer sub-problem) and show that it further speeded up Benders’ Decomposition. This research led to the possibility of applying Benders’ Decomposition to the hybrid formulation of SSMCMPWLP in future.展开更多
Choosing the locations and the capacities of emergency warehouses for the storage of relief materials is critical to the quality of services provided in the wake of a largescale emergency such as an earthquake.This pa...Choosing the locations and the capacities of emergency warehouses for the storage of relief materials is critical to the quality of services provided in the wake of a largescale emergency such as an earthquake.This paper proposes a stochastic programming model to determine disaster sites’locations as well as their scales by considering damaged scenarios of the facility and by introducing seismic resilience to describe the ability of disaster sites to resist earthquakes.The objective of the model is to minimize fixed costs of building emergency warehouses,expected total transportation costs under uncertain demands of disaster sites and penalty costs for lack of relief materials.A local branching(LB)based solution method and a particle swarm optimization(PSO)based solution method are proposed for the problem.Extensive numerical experiments are conducted to assess the efficiency of the heuristic according to the real data of Yunnan province in China.展开更多
文摘Single Stage Capacitated Warehouse Location Problem (SSCWLP) has been attempted by few researchers in the past. These are Geoffrion and Graves [1], Sharma [2], Sharma [3] and Sharma and Berry [4]. In this paper we give a “vertical decomposition” approach to solve SSCWLP that uses Lagrangian relaxation. This way SSCWLP is broken into two versions of capacitated plant location problem (the CPLP_L and CPLP_R) by relaxing the flow balance constraints. For CPLP_R, we use well known Lagrangian relaxations given in literature (Christofides and Beasley [5] and Nauss [6]);and adopt them suitably for solving CPLP_L. We show theoretically in this paper that SSCWLP can be more efficiently solved by techniques of vertical decomposition developed in this paper than the method available in literature (Sharma and Berry [4]). Encouraging computational study is reported in this paper.
文摘In the past, researchers have applied Bender’s decomposition to distribution problem and used feasibility constraint to speed up the performance of Bender’s decomposition. Further, the application of Branch and Bound to single-stage multi-commodity single-period warehouse location problem (SSMCSPWLP) with strong constraints has shown that they are more effective. It was also shown in the previous research (in the context of Branch and Bound Methodology) that hybrid formulation for the single-stage single-period multi-commodity warehouse location problem yielded superior results. In this paper we apply Benders’ decomposition to strong and weak formulations of single-stage multi-commodity multi-period warehouse location problem (SSMCMPWLP). As suggested in the previous literature we put feasibility constraints in the pure integer sub- problem to speed up the performance of Benders’ decomposition. We also develop an additional cut (constraint that is again added to pure integer sub-problem) and show that it further speeded up Benders’ Decomposition. This research led to the possibility of applying Benders’ Decomposition to the hybrid formulation of SSMCMPWLP in future.
文摘Choosing the locations and the capacities of emergency warehouses for the storage of relief materials is critical to the quality of services provided in the wake of a largescale emergency such as an earthquake.This paper proposes a stochastic programming model to determine disaster sites’locations as well as their scales by considering damaged scenarios of the facility and by introducing seismic resilience to describe the ability of disaster sites to resist earthquakes.The objective of the model is to minimize fixed costs of building emergency warehouses,expected total transportation costs under uncertain demands of disaster sites and penalty costs for lack of relief materials.A local branching(LB)based solution method and a particle swarm optimization(PSO)based solution method are proposed for the problem.Extensive numerical experiments are conducted to assess the efficiency of the heuristic according to the real data of Yunnan province in China.