Date of Original Version
This is the author’s version of a work that was accepted for publication. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version is available at http://dx.doi.org/10.1016/j.compchemeng.2013.11.014
Abstract or Description
In Part I (Rodriguez, et al., 2013) an optimization model was proposed to redesign the supply chain of spare parts industry under demand uncertainty in a specified planning horizon. To address large industrial problems, a Lagrangean scheme is proposed to decompose the MINLP of Part I according to the warehouses by dualizing the logic constraints that assign the warehouses to different customers, together with the demand constraints and factory capacity constraints. The subproblems are first approximated by an adaptive piece-wise linearization scheme that provides lower bounds, and the MILP is further relaxed to an LP to improve solution efficiency while providing a valid lower bound. An initialization scheme is designed to obtain good initial Lagrange multipliers, which are scaled to accelerate the convergence. The results from an illustrative problem and two real world industrial problems show that the method can obtain optimal or near optimal solutions in modest computational times.
Computers and Chemical Engineering, 62, 211-224.