Solving a reverse supply chain design problem by improved Benders decomposition schemes.

• Autor(a) principal: Santibanez Gonzalez, Ernesto Del Rosario
• Data de Publicação: 2013
• Outros Autores: Diabat, Ali
• Tipo de documento: Artigo
• Idioma: eng
• Título da fonte: Repositório Institucional da UFOP
• Texto Completo: http://www.repositorio.ufop.br/handle/123456789/4359; https://doi.org/10.1016/j.cie.2013.09.005
• topic: Supply chain management; Reverse logistics; Benders decomposition; Mixed integer programming

In this paper we propose improved Benders decomposition schemes for solving a remanufacturing supply chain design problem (RSCP). We introduce a set of valid inequalities in order to improve the quality of the lower bound and also to accelerate the convergence of the classical Benders algorithm. We also derive quasi Pareto-optimal cuts for improving convergence and propose a Benders decomposition scheme to solve our RSCP problem. Computational experiments for randomly generated networks of up to 700 sourcing sites, 100 candidate sites for locating reprocessing facilities, and 50 reclamation facilities are presented. In general, according to our computational results, the Benders decomposition scheme based on the quasi Pareto-optimal cuts outperforms the classical algorithm with valid inequalities.