Optimization Methods: Dynamic Programming Applications Design of Continuous Beam Module 6 Lecture Notes 1 Design of Continuous Beam Introduction

In the previous lectures, the development of recursive equations and computational procedure were discussed. The application of this theory in practical situations is discussed here. In this lecture, the design of continuous beam and its formulation to apply dynamic programming is discussed. Design of continuous beam Consider a continuous beam having n spans with a set of loadings W1, W2,, Wn at the center of each span as shown in the figure.

W1 0 L1 1

W2 2 L2 i-1 Li

Wi i

Wi+1 i+1 Li+1 n-1

Wn n Ln

The beam rests on n+1 rigid supports. The locations of the supports are assumed to be known. The objective function of the problem is to minimize the sum of the cost of construction of all spans. It is assumed that simple plastic theory of beams is applicable. Let the reactant support moments be represented as m1, m2, , mn. Once these support moments are known, the complete bending moment distribution can be determined. The plastic limit moment for each span and also the cross section of the span can be designed using these support moments. The bending moment at the center of the ith span is -WiLi/4. Therefore, the largest bending moment in the ith span can be computed as

D Nagesh Kumar, IISc, Bangalore

M6L1

Optimization Methods: Dynamic Programming Applications Design of Continuous Beam

m + mi Wi Li M i = max mi 1 , mi , i 1 2 4

for i = 1, 2,...n

For a beam of uniform cross section in each span, the limit moment m_limi for the ith span should be greater than or equal to Mi. The cross section of the beam should be selected in such a way that it has the required limit moment. Since the cost of the beam depends on the cross section, which in turn depends on the limit moment, cost of the beam can be expressed as a function of the limit moments.

If

C (X )
i =1 i

represents the sum of the cost of construction of all spans of the beam where X

represents the vector of limit moments

m _ lim1 m _ lim 2 X = M _ lim m n

n

then, the optimization problem is to find X so that the constraints m _ lim i M i for i = 1, 2, ..., n .

C (X )
i =1 i

is minimized while satisfying

This problem has a serial structure and can be solved using dynamic programming.

D Nagesh Kumar, IISc, Bangalore

M6L1