Download presentation

Presentation is loading. Please wait.

Published byJakayla Stennett Modified over 2 years ago

1
ZEIT4700 – S1, 2014 Mathematical Modeling and Optimization School of Engineering and Information Technology

2
Optimization - basics Maximization or minimization of given objective function(s), possibly subject to constraints, in a given search space Minimize f1(x),..., fk(x) (objectives) Subject to gj(x) < 0, i = 1,...,m (inequality constraints) hj(x) = 0, j = 1,..., p (equality constraints) Xmin1 ≤ x1 ≤ Xmax1 (variable / search space) Xmin2 ≤ x2 ≤ Xmax2.

3
Evolutionary Algorithms (EA) Initialization (population of solutions) Parent selection Recombination / Crossover Mutation Ranking (parent+child pop) Reduction Termination criterion met ? Yes No Output best solution obtained “Evolve” childpop Evaluate childpop

4
Constraint handling Optimum Feasible Infeasible -Search space is reduced -Disconnected/constricted feasible regions possible -Feasibility of solutions to be considered in ranking x1 x2 x1 x2

5
Constraint handling - Penalty function method (Constrained) (Unconstrained) -Performance is sensitive to choice of parameters -No fixed way to generate penalty parameters -Scaling between different terms

6
Constraint handling – feasibility first techniques During the ranking, enforce the following relations: 1.Between two feasible solutions, the one with superior objective value is bettter. 2.Between a feasible and an infeasible solution, feasible is better 3.Between two infeasible solutions, the one with lower objective value is better. => All feasible solutions are ranked above infeasible solutions

7
Optimization – Multi-objective f1 f2 The final set of non-dominated solutions should be: 1.Converged (to the Pareto optimal front) 2.Diverse (should span entire range of solutions Uniformly)

8
Multiobjective Optimization – Scalarization approach f1 f2 -One solution per optimization search -Can only achieve convex fronts

9
f1 f2 -One solution per optimization search -Difficult to estimate c values

10
Multiobjective Optimization – Non-dominated sorting f1 f2 f1 f2 f1 f2 d2 d1 Convergence (nd-sort) Diversity (crowding- distance sort)

11
Evolutionary Algorithm (cntd) Minimize f(x) = (x-6)^2 0 ≤ x ≤ 31 Binary GAReal Parameter GA RepresentationBinaryReal Parent selectionBinary tournament/ Roulette wheel Binary tournament/ Roulette wheel CrossoverOne point/multi-pointSBX,PCX … MutationBinary flipPolynomial RankingSort / NDSort / ND / CD

12
Resources Course material and suggested reading can be accessed at http://seit.unsw.adfa.edu.au/research/sites/mdo/ Hemant/design-2.htm http://seit.unsw.adfa.edu.au/research/sites/mdo/ Hemant/design-2.htm

Similar presentations

OK

ZEIT4700 – S1, 2015 Mathematical Modeling and Optimization School of Engineering and Information Technology.

ZEIT4700 – S1, 2015 Mathematical Modeling and Optimization School of Engineering and Information Technology.

© 2017 SlidePlayer.com Inc.

All rights reserved.

Ads by Google

Ppt on right to education act in india Ppt on improvement in food resources science Ppt on self awareness and leadership Ppt on tcp/ip protocol video tutorial Ppt on marie curie's husband Ppt on review writing lesson Ppt on question tags worksheet Ppt on steps in research process Ppt on column chromatography lab Ppt on animals for kindergarten