Сохраби Маджид

Российско-китайский математический центр «Многоканальный алгоритм совместного распределения ресурсов на основе математического программирования» - (апрель 2025 г. - апрель 2026 г.).

Аспирантура, финансируемая стипендией Российской Федерации (ноябрь 2022 г. - октябрь 2025 г.).

Магистерская программа, финансируемая за счет стипендии Российской Федерации (сентябрь 2020 г. - август 2022 г.).

Исследовательские проекты - диссертация/курсовая работа (бакалавр, магистр) в области алгоритмов генной инженерии и видообразования

Genetic Algorithm (GA) is one of the earliest evolutionary approaches to solve combinatorial optimization problems such as allocation, scheduling, supply chain network, etc. The problem we are interested in is NP-hard and in most cases, it is impossible to find the optimal solution (exact solution). The basic GA algorithm performs an interactive search in the solution space using two main operators - crossover and mutation. Although the algorithm's output is promising, there are some limitations: the use of random crossover and mutation, and premature convergence, due to which the algorithm fails to find the global optimum. To address these limitations, we adopt different approaches by redesigning the algorithm pipeline, pattern mining, clustering, etc. to properly search the solution space. Check out my recent articles on Genetic Engineering Algorithms (GEA) .

There are various projects related to this topic for Bachelor and Master (thesis/coursework) on implementation, testing and development of approaches to improve the algorithm. A valuable contribution is finding a new best local or global optimal solution.

All projects are related to programming and in English, those who are interested in the topic and improvement of English, programming, ML, DL, can contact me.