Loading…

Addressing the Design of Chemical Supply Chains under Demand Uncertainty

This article addresses the design of chemical supply chains (SCs) under demand uncertainty. Given a design horizon consisting of several time periods in which expected but uncertain product demands materialize, the objective is to select the design that maximizes the expected profit. To tackle this...

Full description

Saved in:
Bibliographic Details
Published in:Industrial & engineering chemistry research 2006-10, Vol.45 (22), p.7566-7581
Main Authors: Guillén, Gonzalo, Mele, Fernando D, Espuña, Antonio, Puigjaner, Luis
Format: Article
Language:English
Subjects:
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This article addresses the design of chemical supply chains (SCs) under demand uncertainty. Given a design horizon consisting of several time periods in which expected but uncertain product demands materialize, the objective is to select the design that maximizes the expected profit. To tackle this problem, a multistage stochastic formulation is derived wherein the design decisions are made irrespective of the specific realization of the uncertain parameters. The resulting model is, in general, computationally intensive or even intractable, as the number of variables and equations is proportional to the number of possible nodes on the scenario tree, which explodes exponentially with the number of stages (periods). In view of this, a decomposition technique is introduced aiming at the objective of overcoming the numerical difficulties associated with the underlying large-scale stochastic mixed-integer linear problem (MILP). The resulting strategy combines genetic algorithms (GAs) and mathematical programming tools. Computational results indicate that the proposed approximation method provides solutions which are within a few percent of the optimal ones and also reduces the computation time required by the rigorous mathematical model.
ISSN:0888-5885
1520-5045
DOI:10.1021/ie051424a