Search
The goal of this homework is to implement and compare two EA-based approaches for solving constrained optimization problems. In fact, you will mostly just reuse the implementations you have already coded within the past two lab exercises.
Implement the following two approaches, if you have not done yet.
First approach uses the Stochastic Ranking method. You should already have an implementation of this method.
Second approach is based on the idea that the constrained optimization problem can be cast as a bi-objective optimization one with the following two optimization objectives:
Both objectives to be minimized.
Implement this approach with the use of the NSGA-II algorithm that you have already implemented.
Compare the two approaches on the real-valued function optimizations g06, g08, g11 a g24 that you used on the last lab exercise, problem_definitions.
Add to the comparison another MOEA approach that works with the following objectives
Implement a function that will graphically display the best obtained solutions in relation to the optimum solution and to the feasible and infeasible areas.
Compare the methods on at least one problem with more than 3 variables and more than 3 constraints such as g04, g05, g09 and g21.
Implement modified binary tournament operator for NSGA-II that takes into account feasibility of solutions, see slide 32 NSGA-II: Constraint Handling Approach in MOEA slides. Compare NSGA-II using the modified binary tournament with the original two approaches.
Implement and test some other constraint handling method of your choice.
Implement and test other MOEA than the NSGA-II and use it in the bi-objective or multi-objective mode.
Likewise the first homework, also this homework has some minimal requirements: if you fulfill only them, you will still get the points required for this homework. Anything beyond these minimal requirements will bring you some additional points up to the maximum number of 10 points.
We shall deem this homework fulfilled, if you
You should submit your solution to task DU2 via a ZIP archive using BRUTE. The ZIP archive shall contain
During the evaluation, we may require you to demonstrate the functionality of your implementation of certail lab exercise (or via an online meeting). If you chose a programming languge other than Pythou, Julia, Java, or C/C++, the demonstration will be probably required.
Expected form of the report:
Expected contents of the report:
For this homework, you can get up to 10 points.