Download presentation

Presentation is loading. Please wait.

Published byTyree Emberson Modified over 2 years ago

1
optimization 1/33 Radford, A D and Gero J S (1988). Design by Optimization in Architecture, Building, and Construction, Van Nostrand Reinhold, New York

2
optimization techniques 2/33 ● which technique depends on ● nature of problem ● nature of information required ● historically ● mathematical problem – single optimal value ● not interested in suboptimal values ● design ● both decisions and suboptimal solutions important ● suboptimal solutions options ● may be more acceptable in terms of unstated objectives

3
optimization techniques 3/33 ● nature of problem / information ● design variables discrete &/or discontinuous &/or non-contiguous ● steel beams in discrete sizes ● no. of lifts discontinuous, ● materials non-contiguous ● nonlinear relationships heat loss

4
types of techniques 4/33 ● calculus ● continuous and differentiable ● linear programming (LP) ● well developed method ● linear relationship among variables ● nonlinear programming (NLP) ● nonlinear relationships ● dynamic programming (DP) ● discrete, nonlinear, handles constraints ● evolutionary computation ● population

5
general strategies 5/33 ● exhaustive enumeration ● all possible solutions ● implicit enumeration ● e.g. branch & bound, DP ● hill-climbing ● moving from existing solution to an improved solution

6
linear programming ● best developed technique ● most frequently used ● guarantees optimum solution ● 3 conditions ● variables must be continuous, >= 0 ● O.F. must be linear, OF=20x 1 +12x 2 ● constraints must be linear, 4x 1 + 3x 2 > 18 6/33

7
linear programming ● convex spaces ● feasible solution space ● O.F. moves away from origin ● optimum solution at vertex 7/33 x1x1 x2x2

8
dynamic programming ● design problems ● not continuous or linear ● definition (Richard Bellman) ● an optimal set of decisions has the property that whatever the first decision is, the remaining decisions must be optimal with respect to the outcome which results from the first decision 8/33 if you don’t’ do the best with what you have, you will never do the best with what you should have had

9
dynamic programming ● stage-state formulation ● implicit enumeration of all paths ● guarantees global optimum ● non-serial DP doesn’t guarantee ● but pretty good 9/33 Stage 123 es 45 State

10
evolutionary computation ● hill-climbing ● one solution at a time ● in direction of steepest slope ● local optima ● variables &/or constants ● equations – y = mx + c ● EC in parallel ● populations ● survival of the fittest – probability ● random generation 10/33 LO GO

11
evolutionary computation 11/33

12
evolutionary computation 12/33

13
evolutionary computation 13/33

14
evolutionary computation 14/33

15
evolutionary computation 15/33

16
evolutionary computation 16/33

17
evolutionary computation 17/33

18
evolutionary computation 18/33

19
evolutionary computation 19/33

20
evolutionary computation 20/33

21
evolutionary computation 21/33

22
evolutionary computation 22/33

23
evolutionary computation 23/33

24
evolutionary computation 24/33

25
evolutionary computation 25/33

26
evolutionary computation 26/33

27
evolutionary computation 27/33

28
evolutionary computation 28/33

29
evolutionary computation 29/33

30
evolutionary computation 30/33

31
evolutionary computation 31/33

32
artificial life 32/33

33
multicriteria optimization 33/33 ● single objective ● e.g. cost ● several conflicting objectives ● max light – min heat ● best looking, min cost car ● Pareto solutions ● best compromise ● tradeoffs c1c1 c2c2

Similar presentations

Presentation is loading. Please wait....

OK

© 2010, Mike Murach & Associates, Inc.

© 2010, Mike Murach & Associates, Inc.

© 2017 SlidePlayer.com Inc.

All rights reserved.

Ads by Google

Slide show view ppt on ipad Ppt on power factor meter Ppt on van de graaff generator definition Ppt on different solid figures names Complete ppt on hepatitis b Ppt on kingdom monera Ppt on home automation using dtmf Ppt on polynomials and coordinate geometry games Ppt on exploring fibonacci numbers Ppt on campus recruitment system