Memuat
Memuat
Watch every step above performed live, with English narration.
0 plays
Class book
Page 1 / 6
Cover: Class NSGA-II MOPSO Hybrid Multi-Objective Optimization #1: Multi-Objective Optimization: Pare, Dominance, and ZDT/DTLZ Test Functions
Click a page or use ◀ ▶ to turn · swipe on mobile · to enlarge
Want to go deeper?
Join one of our courses or ask us directly on WhatsApp.
Picked from the software, topic, and level of “Class NSGA-II MOPSO Hybrid Multi-Objective Optimization #1: Multi-Objective Optimization: Pareto Front, Dominance, and Test Functions ZDT/DTLZ”.
Other ways we can help with Python.
Learn with a mentor
Scheduled AI & Machine Learning courses with live guidance and a certificate.

Multi-Objective Optimization Course: NSGA-II, MOPSO & Hybrid Algorithms (Python)

ECG Arrhythmia Classification Course with Wavelet & Deep Learning (PyTorch)

ANFIS + PSO/GA Course for Non-Linear Time Series Forecasting (Python)
Have it built for you
No time to learn Python? Our team can do the project for you.

Python Machine Learning — Prediction Models, Customer Segmentation, Fraud Detection & AI Apps

AI Image Creation with Stable Diffusion — Unlimited Custom Visual Production
★ 4.9

AI Image & Video Creation with Leonardo AI — All-in-One Visuals for Business
★ 4.9
Get notified about new Python classes
At most one email a week. Unfollow anytime with one click.
The full narration of this video. The current sentence is highlighted while the video plays; click any sentence to jump there.
Here is the final result, four standard multi-objective test functions along with their true Pareto front, from convex, concave, discontinuous, up to three-dimensional spherical surfaces. We also see that 300 random solutions are still far from the best front. Let's start. Hello, welcome to the tutorial series on research, hybrid metaheuristic algorithms for large-scale multi-objective optimization. In the real world, we rarely have a single objective, car design must be light yet strong, electric power networks must be cheap yet reliable. These objectives are mutually conflicting. In this 6-part series, we build everything from scratch, Pareto concepts, NSGA2, MoPSO, hybrid algorithms, performance metrics, up to large-scale case studies with statistical testing.
Create a problem file .py ZDT1 has 2 objectives and 30 variables, F1 equals X1, and F2 depends on the G function of the other variables. The Pareto front is achieved when X2 to X30 are zero, forming a convex curve where F2 equals 1 minus the square root of F1. ZDT2 is similar but has a concave front, and ZDT3 has a discontinuous front divided into 5 segments due to the sine term. DTLZ2 has 3 objectives with a front in the form of a 1.8 unit spherical surface.
The actual front function generates the theoretical Pareto front points for each test function, used to measure the quality of the algorithm. The dominance function checks whether solution A dominates B, not worse in all objectives and better in at least one. Non-dominated solutions find all solutions that are not dominated by other solutions calculated simultaneously with matrix comparison up to n
Create a test file underscore problem .py and run it From 300 random solutions ZDT1 only 16 are non-dominated and the best F2 is 2.55 although the actual front reaches 0 Example of dominance a solution with F1 0.54 and F2 3.26 dominates a solution with 0.63 and 3.86 but not the other way around The optimal solution for ZDT1 with other variables 0 is exactly on the theoretical curve and the solution DTLZ2 on the front has the exact square objective value of 1 according to the spherical surface
Let's look at the graph On ZDT1 the gray random solution points are far above the black actual front line and the red points are the non-dominated solutions among them The other three panels show different front shapes concave, broken and three-dimensional surface A good algorithm should be able to handle all these shapes
Done We have understood dominance non-dominated set Pareto front and write the ZDT1 test function, ZDT2, ZDT3, as well as DTLZ2. In the next episode, we build NSGA2, the most popular multi-objective algorithm, from scratch. Currently working on a thesis, dissertation, or research in the field of optimization and artificial intelligence? Cerdas Inovasi Digital helps with the implementation of optimization algorithms, from NSGA2 and MOPSO, designing hybrid algorithms, up to hypervolume metrics and IG, as well as opening statistical test comparison courses, and offering Python programming courses for engineers. Want to master the entire series, from Pareto concepts to large-scale case studies? All 6 episodes, complete with PDF step-by-step guides and source code, are available to premium tutorial subscribers. Subscribe starting at Rp69.000 per month, save 28% with the 12-month package, or pay once Rp999.000 for lifetime access. Want just one class? Buy the unit class with lifetime access. Subscribe now on the premium page cerdasinovasidigital.com. Contact our WhatsApp or visit cerdasinovasidigital.com. Thank you for watching, see you in the next episode. Thank you for watching,
Type a question or keyword; we find the part of this episode that explains it and jump the video there.
Notes are saved with the current video time and are only visible to you.
Stuck on a step? Ask here; the instructor and other learners can answer.
No questions yet.

Cerdas Inovasi Digital Team
Software developers, BIM & 3D engineers, and AI practitioners
We build software, BIM models, games and AI automations for clients every day, and turn that hands-on work into step-by-step classes: every step is shown on screen and comes with a PDF guide you can keep.
See our clients →