Presentation is loading. Please wait.

Presentation is loading. Please wait.

Dynamic Programming Applications

Similar presentations


Presentation on theme: "Dynamic Programming Applications"— Presentation transcript:

1 Dynamic Programming Applications
Optimum Geometric Layout of Truss D Nagesh Kumar, IISc Optimization Methods: M6L2

2 Optimization Methods: M6L2
Objectives To discuss the design of elastic trusses To formulate the optimization problem as a dynamic programming model D Nagesh Kumar, IISc Optimization Methods: M6L2

3 Optimum Geometric Layout of Truss
Consider a planar, pin jointed cantilever multi bayed truss Assume the length of the bays to be unity The truss is symmetric to the x axis Geometry or layout of the truss is defined by the y coordinates (y1, y2, …, yn) Truss is subjected to a unit load W1 D Nagesh Kumar, IISc Optimization Methods: M6L2

4 Optimum Geometric Layout of Truss …contd.
h1 h2 h3 W1=1 y1 y2 y3 y4 x 1 D Nagesh Kumar, IISc Optimization Methods: M6L2

5 Optimum Geometric Layout of Truss …contd.
Consider a particular bay I Assume the truss is statically determinate Forces in the bars of bay i depend only the coordinates yi-1 and yi Cross sectional area of a bar can be determined, once the length and force in it are known Cost of the bar can thus be determined. D Nagesh Kumar, IISc Optimization Methods: M6L2

6 Optimum Geometric Layout of Truss …contd.
The optimization problem is to find the geometry of the truss which will minimize the total cost from all the bars For the three bay truss, the relation between y coordinates can be expressed as yi+1 = yi + di for i = 1,2,3 This is an initial value problem since the value y1 is known D Nagesh Kumar, IISc Optimization Methods: M6L2

7 Optimum Geometric Layout of Truss …contd.
Let the y coordinate of each node is limited to a finite number of values say 0.25, 0.5, 0.75 and 1 y1 y4 y3 y2 0.25 0.50 0.75 1.00 D Nagesh Kumar, IISc Optimization Methods: M6L2

8 Optimum Geometric Layout of Truss …contd.
As shown in the figure, there will be 64 different possible ways to reach y4 from y1 This can be represented as a serial multistage initial value decision problem and can be solved using dynamic programming D Nagesh Kumar, IISc Optimization Methods: M6L2

9 Optimization Methods: M6L2
Thank You D Nagesh Kumar, IISc Optimization Methods: M6L2


Download ppt "Dynamic Programming Applications"

Similar presentations


Ads by Google