Download presentation

Presentation is loading. Please wait.

Published byTucker Sheward Modified over 3 years ago

2
Tier III: Optimization Design Problems Derek McCormack Section 1: Sample Problems

3
Introduction Three sample problems have been given here to work on. The first is a heat exchange network optimization problem. The second is a transportation optimization problem to be solved with Lingo. The third problem deals with optimizing a heat exchanger’s minimum approach temperature.

4
Question #1 Optimization of a Heat Exchange Network by Thermal Pinch Analysis

5
Optimization of a Heat Exchange Network A plant has the following stream data:

6
HEN Problem Using the stream data given and a T min of 10 K, do the following : a)Determine the optimum heating and cooling utilities required by using the algebraic thermal pinch analysis method. Do you notice anything special with this example? b)Now solve this problem using the graphical method, keeping in mind the results obtained above. c)Create a possible heat exchange network for this situation based on the optimized conditions.

7
HEN Solution Attempt to solve this problem before proceeding to the solution.

8
Temperature Interval Diagram

9
Table of Exchangeable Heat Loads

11
Cascade Diagram

12
No Pinch Point? Notice that in this case the cascade diagram has no residuals that fall below zero. In this case, all of the heating needs of the cold streams are met by the hot streams, with an excess of heat left over. No heating utility is required, and the minimum cooling utility is 11,000 kW.

13
Hot Composite Stream

14
Cold Composite Stream

15
Optimized

16
No Pinch Point? Here we can see that we do not get a typical pinch point. The head of the cold composite stream cannot be moved below the tail of the hot composite stream. In this case, all of the heating requirements can be met by the hot streams, but 11,000 kW of cooling utility are still needed.

17
Question #2 Optimization of Transportation Route Problem

18
Transportation Problem Five chemical plants produce a chemical to be shipped and sold at three different selling stations. Each plant has a different production cost and shipping cost, while each warehouse that receives the product sells it for a different price. Warehouse 1 sells for 95 $/tonne, warehouse 2 sells for 90 $/tonne, and warehouse 3 sells for 93 $/tonne. The cost of production at each of the plants are as follows: plant 1 costs 42 $/tonne, plant 2 costs 45 $/tonne, plant 3 costs 43 $/tonne, plant 4 costs 46 $/tonne, and plant 5 costs 55 $/tonne. To ship from plant 1 costs 0.30 $/tonnekm, from plant 2 costs 0.35 $/tonnekm, from plant 3 costs 0.31 $/tonnekm, from plant 4 costs 0.34 $/tonnekm, and plant 5 costs 0.29 $/tonnekm.

19
Transportation Problem The distances between plants and warehouses, in km, are as follows: Plant 1 has a production capacity of 1300 tonnes, plant 2 can make 1200 tonnes, plant 3 can make 1700 tonnes, plant 4 can make 1400 tonnes, and plant 5 can make 1600 tonnes. Furthermore, market research suggests that the amount sold at each warehouse is limited. Warehouse 1 can receive 2400 tonnes, warehouse 2 can receive 2000 tonnes, and warehouse 3 can receive 2500 tonnes.

20
Transportation Problem What combination of shipments will maximize the profit that this company can earn, and what is that profit? Use Lingo to solve this. Attempt to solve this problem before proceeding to the solution.

21
Transportation Problem Solution Before Lingo can be used, this problem must be broken down into components: Profit = Revenue – Expenses What is revenue? Revenue = (selling price)*(quantity sold) = SP 1 ( x 1j ) + SP 2 ( x 2j ) + SP 3 ( x 3j ) (i refers to a warehouse property, while j refers to a plant property)

22
Transportation Problem Solution What are the expenses? The cost of production and the cost of shipping. Expenses = Production cost + Shipping cost The costs of shipping from each plant to each warehouse are given below.

23
Transportation Problem Solution Production cost = (cost per unit)*(quantity produced) = C j *x 1j + C j *x 2j + C j *x 3j Shipping cost = (quantity shipped)*(shipping price) = x 1j *S 1j + x 2j *S 2j + x 3j *S 3j

24
Transportation Problem Solution The objective function is now: maximize

25
Transportation Problem Solution The constraints: x 1j = 2400 x 2j = 2000 x 3j = 2500 x i1 <= 1300 x i2 <= 1200 x i3 <= 1700 x i4 <= 1400 x i5 <= 1600

26
Lingo Solution

28
Question #3 Optimizing Minimum Approach Temperature

29
T min Optimization A hot process stream coming out of a distillation tower has a specific heat flow rate, FC p, of 200 kW/K and must be cooled from 400 K to 300 K. Another process stream with an FC p of 150 kW/K must be heated from 330 K to 430 K before it enters a processing unit. A significant savings in utility costs can be realized by passing these streams through a heat exchanger.

30
T min Optimization Heating utility is available at a cost of approximately 90 $/kWyear, while cooling utility is available at approximately 40 $/kWyear. Based on an expected useful life of 10 years, the heat exchanger is estimated to have an annualized fixed cost of about 600 $/yearm 2. If the heat exchanger is expected to have a heat exchange coefficient of U = 1.2 kW/m 2, investigate where the optimum minimum approach temperature lies. Hint: It is between T min = 5 K and 20 K.

31
T min Optimization What is the optimum minimum approach temperature in this case? Use T min = 5 K, 10 K, and 20 K to develop your solution. Attempt to solve this problem before proceeding to the solution.

32
Optimum T min Solution Using the algebraic method, the utility requirements and exchanged heat are calculated for each T min.

33
Optimum T min Solution Next, for each case the inlet and outlet temperatures of the heat exchanger are calculated so that the log mean temperature difference can be calculated.

34
Optimum T min Solution Then the area of each heat exchanger is calculated.

35
Optimum T min Solution Finally, the annual utilities cost, heat exchanger cost, and total cost are calculated and plotted as a function of T min.

36
Optimum T min Solution

37
The End This is the end of the Process Optimization module.

Similar presentations

OK

Linear Programming. Linear programming A technique that allows decision makers to solve maximization and minimization problems where there are certain.

Linear Programming. Linear programming A technique that allows decision makers to solve maximization and minimization problems where there are certain.

© 2019 SlidePlayer.com Inc.

All rights reserved.

To make this website work, we log user data and share it with processors. To use this website, you must agree to our Privacy Policy, including cookie policy.

Ads by Google