1. MULTIPERIOD DESIGN OF AZEOTROPIC SEPARATION SYSTEMS Kenneth H. Tyner and Arthur W. Westerberg

2. OVERVIEW Problem Description Problem Challenges Related Research Issues Solution Approach Conclusions

3. PROBLEM DESCRIPTION Design An Optimal Separation Plant Multiple Feeds –Flowrate –Composition –Operating Time Azeotropes A B CAz F1 F3 F2

4. PROBLEM DESCRIPTION A B CAz F1 F3 F2 F A B C Az

5. PROBLEM DESCRIPTION A B CAz F1 F3 F2 F A B C

6. PROBLEM DESCRIPTION FEED 1FEED 3FEED 2

7. PROBLEM DESCRIPTION FEED 1FEED 3FEED 2

8. PROBLEM DESCRIPTION FEED 1FEED 3FEED 2

9. PROBLEM DESCRIPTION FEED 1FEED 3FEED 2

10. PROBLEM DESCRIPTION FEED 1FEED 3FEED 2

11. PROBLEM CHALLENGES Highly Combinatorial –Separation Pathways –Process Units –Task Assignment Difficult Subproblems –Large Models –Highly Nonlinear –Recycle Streams –Shared Equipment

12. INITIAL RESEARCH THRUSTS Synthesize Designs Evaluate Designs Optimize / Modify Designs

13. AZEOTROPIC SYNTHESIS A B CAz F F A B C

14. AZEOTROPIC SYNTHESIS A B CAz F A B C F

15. AZEOTROPIC SYNTHESIS A B CAz F F A B C

16. SIMULATION Zero Slack S S S

17. SIMULATION Solve / Optimize Initialize Modify Library

18. REVISED RESEARCH THRUSTS Collocation Error Detection Scaling Solver Design

19. SIMULATION Solve / Optimize Initialize Modify Library

20. SOLUTION APPROACH Approximation –Separation Task –Column Design and Operation Shortcut Costing Autonomous Agents

21. ECONOMICS Cost = F( Feed, Distillate, Trays, Reflux )

22. ECONOMICS Cost = F( Feed, Distillate, Trays, Reflux ) Separation Task Contribution

23. ECONOMICS Cost = F( Feed, Distillate, Trays, Reflux ) Separation Task Contribution Column Design and Operation Contributions

24. TASK APPROXIMATION Variables: –Compositions –Flowrates Relations: –Mass Balance –Lever Rule –Geometric Objects A B CAz F D / F D B

25. COLUMN APPROXIMATION Cost = F(Feed, Distillate, Trays, Reflux) Reflux = F(Trays, Feed Location)

26. COLUMN APPROXIMATION Cost = F(Feed, Distillate, Trays, Reflux) Reflux = F(Trays) Optimal Feed Location = F(Trays)

27. COLUMN APPROXIMATION Reflux = C 1 * exp(-C 2 * Trays) + C 3 Opt Feed Loc = C 4 * Trays + C 5 –Numerical Difficulties Gilliland Correlation

28. DATA COLLECTION Fix Trays and Task Find Optimal Reflux

29. DATA COLLECTION

30. A B CAz Store In Database Calculate Parameters

31. SIMULATION F A B C Az A B C F Database

32. SIMULATION F A B C Az A B C F Database

33. SIMULATION Zero Slack S S S

34. ASYNCHRONOUS TEAMS Independent Software Agents Shared Memory Trial Points Newton SolverGradient Solver

35. ASYNCHRONOUS TEAMS Independent Software Agents Shared Memory Trial Points Newton SolverGradient Solver

36. ASYNCHRONOUS TEAMS Independent Software Agents Shared Memory Trial Points Newton SolverGradient Solver

37. ASYNCHRONOUS TEAMS Independent Software Agents Shared Memory Trial Points Newton SolverGradient Solver

38. ASYNCHRONOUS TEAMS Independent Software Agents Shared Memory Advantages –Scalable –Ease of Creation / Maintenance –Cooperation

39. ASYNCHRONOUS TEAMS Applications –Train Scheduling –Travelling Salesman Problem –Building Design

40. ASYNCHRONOUS TEAMS Problem Description Approximation Data Designs Database Design Agents Approximation Agents

41. MINLP DESIGN AGENT Fixed: –Separation Pathways –Intermediate Streams Variable: –Task Assignment –Number of Columns –Column Dimensions –Operating Policy

42. MINLP DESIGN AGENT Fixed: –Separation Pathways –Intermediate Streams Variable: –Task Assignment –Number of Columns –Column Dimensions –Operating Policy

43. MINLP DESIGN AGENT Fixed: –Separation Pathways –Intermediate Streams Variable: –Task Assignment –Number of Columns –Column Dimensions –Operating Policy

44. TASK ASSIGNMENT

46. PATH SELECTION Sequential Selection Genetic Algorithm Active Constraint

47. MINLP DESIGN AGENT Fixed: –Separation Pathways –Intermediate Streams Variable: –Task Assignment –Number of Columns –Column Dimensions –Operating Policy

48. ASYNCHRONOUS TEAMS Problem Description Approximation Data Designs Database Design Agents Approximation Agents

49. GENERAL BENEFITS Alternative to Hierarchical Design Persistent Data Scenario Analysis Human Agents

50. MULTIPERIOD DESIGN OF AZEOTROPIC SEPARATION SYSTEMS Kenneth H. Tyner and Arthur W. Westerberg