Step-by-step explanation in Arabic of the Non-Dominated Sorting Genetic Algorithm II (NSGA-II). The tutorial quickly introduces the traditional genetic algorithm for solving single-objective optimization problems and then introduces NSGA-II for solving multi-objective problems. The video explains how non-dominated sorting and crowding distance work using a numerical example.
شرح مبسط خطوة بخطوة عن الخوارزمية الجينية لحل المشاكل متعددة الأهداف.
Get in touch:
Facebook: / ahmed.f.gadd
Twitter: / @ahmedfgad
LinkedIn: / ahmedfgad
For coding the GA in Python, check the PyGAD library.
- Documentation: pygad.readthed...
- GitHub: github.com/ahm...
- Facebook: / pygad
- Twitter: / @pygadlib
- LinkedIn: / pygad
PyGAD is an open-source Python library for building the genetic algorithm and optimizing machine learning algorithms. It works with Keras and PyTorch. It works with both single-objective and multi-objective optimization problems.
Негізгі бет بالعربي Non-Dominated Sorting Genetic Algorithm II (NSGA-II) Step-by-Step
No video
Пікірлер: 8