Hybrid robust and stochastic optimization for closed-loop supply chain network design using accelerated Benders decomposition [thesis]

Esmaeil Keyvanshokooh
Environmental, social and economic concerns motivate the operation of closed-loop supply chain networks (CLSCN) in many industries. We propose a novel profit maximization model for CLSCN design as a mixedinteger linear program in which there is flexibility in covering the proportions of demand satisfied and returns collected based on the firm's policies. Our major contribution is to develop a novel hybrid robust-stochastic programming (HRSP) approach to simultaneously model two different types
more » ... wo different types of uncertainties by including stochastic scenarios for transportation costs and polyhedral uncertainty sets for demands and returns. Transportation cost scenarios are generated using a Latin Hypercube Sampling method and scenario reduction is applied to consolidate them. An accelerated stochastic Benders decomposition algorithm is proposed for solving this model. To speed up the convergence of this algorithm, valid inequalities are introduced to improve the lower bound quality, and also a Pareto-optimal cut generation scheme is used to strengthen the Benders optimality cuts. Numerical studies are performed to verify our mathematical formulation and also demonstrate the benefits of the HRSP approach. The performance improvements achieved by the valid inequalities and Pareto-optimal cuts are demonstrated in randomly generated instances. Abstract: Environmental, social and economic concerns motivate the operation of closed-loop supply chain networks (CLSCN) in many industries. We propose a novel profit maximization model for CLSCN design as a mixed-integer linear program in which there is flexibility in covering the proportions of demand satisfied and returns collected based on the firm's policies. Our major contribution is to develop a novel hybrid robust-stochastic programming (HRSP) approach to simultaneously model two different types of uncertainties by including stochastic scenarios for transportation costs and polyhedral uncertainty sets for demands and returns. Transportation cost scenarios are generated using a Latin Hypercube Sampling method and scenario reduction is applied to consolidate them. An accelerated stochastic Benders decomposition algorithm is proposed for solving this model. To speed up the convergence of this algorithm, valid inequalities are introduced to improve the lower bound quality, and also a Pareto-optimal cut generation scheme is used to strengthen the Benders optimality cuts. Numerical studies are performed to verify our mathematical formulation and also demonstrate the benefits of the HRSP approach. The performance improvements achieved by the valid inequalities and Pareto-optimal cuts are demonstrated in randomly generated instances.
doi:10.31274/etd-180810-4106 fatcat:5yqnp47vd5hxhnenszuqbhxwby