Special Issue Paper
Journal of the Operational Research Society (2008) 59, 2–12. doi:10.1057/palgrave.jors.2602381 Published online 31 January 2007
Robust solutions and risk measures for a supply chain planning problem under uncertainty
C A Poojari1, C Lucas1 and G Mitra1
1Brunel University, Uxbridge, UK
Correspondence: CA Poojari, Centre for the analysis of Risk and optimization Modelling Applications (CARISMA), School of Information Systems, Computing and Mathematics, Brunel University, Uxbridge UB8 3PH, UK. E-mail: Chandra.Poojari@brunel.ac.uk
Received June 2006; Accepted November 2006; Published online 31 January 2007.
Abstract
We consider a strategic supply chain planning problem formulated as a two-stage stochastic integer programming (SIP) model. The strategic decisions include site locations, choices of production, packing and distribution lines, and the capacity increment or decrement policies. The SIP model provides a practical representation of real-world discrete resource allocation problems in the presence of future uncertainties which arise due to changes in the business and economic environment. Such models that consider the future scenarios (along with their respective probabilities) not only identify optimal plans for each scenario, but also determine a hedged strategy for all the scenarios. We
- exploit the natural decomposable structure of the SIP problem through Benders' decomposition,
- approximate the probability distribution of the random variables using the generalized lambda distribution, and
- through simulations, calculate the performance statistics and the risk measures for the two models, namely the expected-value and the here-and-now.
Keywords:
supply chain planning, stochastic integer programming, Benders' decomposition, generalized lambda distribution, simulation, genetic algorithm


