Decomposition Approaches to Batch Plant Design and Planning
Industrial & Engineering Chemistry Research1996Vol. 35(6), pp. 1866–1876
Citations Over TimeTop 10% of 1996 papers
Abstract
Design of batch facilities through a mathematical programming approach lead to large problem size. A heuristic approach which was proposed in an earlier paper (Subrahmanyam et al. Ind. Eng. Chem. Res. 1994b, 33, 2688) used decomposition techniques to solve an aggregate problem and a series of scheduling problems. Each of these problems corresponds to a mixed integer linear program. In this work, we derive a theoretical relationship between the aggregate problem and the detailed design formulation. A hierarchy of aggregate problems is derived, based on which an algorithm is developed to obtain optimal solutions to the overall design problem. A number of industrially derived cases are solved to illustrate and validate the algorithm.
Related Papers
- → Home circuit grouping in LOBS-HC ring networks: ILP and heuristic approaches(2013)2 cited
- Transformation From AKNS Hierarchy to Burgers Hierarchy(2009)
- The Air-to-Ground Tasks Assignment for Multi-UAV based Mixed Integer Linear Programming(2008)
- → Optimal Telecommunications Network Expansion Using Mixed Linear Integer Programming(2022)
- → Alternatives to Hierarchy: Partnerships(1988)