Strategic robust supply chain design based on the Pareto-optimal tradeoff between efficiency and risk

详细信息    查看全文

• 作者：Edward Huang^a ; ^{chuang10@gmu.edu" class="auth_mail} ; Marc Goetschalckx^b ; ^{marc.goetschalckx@isye.gatech.edu" class="auth_mail}
• 关键词：Facilities planning and design ; Supply chain network design ; Stochastic programming ; Branch and reduce algorithm
• 刊名：European Journal of Operational Research
• 出版年：1 September, 2014
• 年：2014
• 卷：237
• 期：2
• 页码：508-518
• 全文大小：1334 K

文摘

The strategic design of a robust supply chain has to determine the configuration of the supply chain so that its performance remains of a consistently high quality for all possible future conditions. The current modeling techniques often only consider either the efficiency or the risk of the supply chain. Instead, we define the strategic robust supply chain design as the set of all Pareto-optimal configurations considering simultaneously the efficiency and the risk, where the risk is measured by the standard deviation of the efficiency. We model the problem as the Mean-Standard Deviation Robust Design Problem (MSD-RDP). Since the standard deviation has a square root expression, which makes standard maximization algorithms based on mixed-integer linear programming non-applicable, we show the equivalency to the Mean-Variance Robust Design Problem (MV-RDP). The MV-RDP yields an infinite number of mixed-integer programming problems with quadratic objective (MIQO) when considering all possible tradeoff weights. In order to identify all Pareto-optimal configurations efficiently, we extend the branch-and-reduce algorithm by applying optimality cuts and upper bounds to eliminate parts of the infeasible region and the non-Pareto-optimal region. We show that all Pareto-optimal configurations can be found within a prescribed optimality tolerance with a finite number of iterations of solving the MIQO. Numerical experience for a metallurgical case is reported.