Write a Python code using (Non-dominated Sorting Genetic Algorithm II (NSGA-II))
Budget: £50 – £60 GBP
Write a Python code using (Non-dominated Sorting Genetic Algorithm II (NSGA-II)).
I already have the basis code that has all the parameters with constraints. I just want you to complete the code and use this multi-objective method (Non-dominated Sorting Genetic Algorithm II (NSGA-II)) to find the Pareto Optimal Solutions.
Here are the instructions:
1- Use the original code and complete it by using this method: (NSGA-II)
2- In the output, I want to see the print statements, that I found in my original code, plus the Pareto optimal solutions output.
3- The code should contain visualization of the Pareto optimal solutions, so when we run the code, we can see the outputs and the Pareto graph.
4- You have to explain the output of the Pareto optimal solutions (make analysis) of the output.
* If you are able to do the task, send me please so I can send you the original code to take a look
I already have the basis code that has all the parameters with constraints. I just want you to complete the code and use this multi-objective method (Non-dominated Sorting Genetic Algorithm II (NSGA-II)) to find the Pareto Optimal Solutions.
Here are the instructions:
1- Use the original code and complete it by using this method: (NSGA-II)
2- In the output, I want to see the print statements, that I found in my original code, plus the Pareto optimal solutions output.
3- The code should contain visualization of the Pareto optimal solutions, so when we run the code, we can see the outputs and the Pareto graph.
4- You have to explain the output of the Pareto optimal solutions (make analysis) of the output.
* If you are able to do the task, send me please so I can send you the original code to take a look