Canada Spends Logo

Explorez notre analyse du budget 2026

Grant: Discovery Grants Program - Individual

University of Ontario Institute of Technology

$28,000.00

Efficient Evolutionary Algorithms for Many-objective Optimization

EF 2020-21

Résumé
Most of the time, when we are talking about an improvement of something, in fact, we are interested to minimize or maximize (i.e. optimize) quality or quantity of an entity. Universal examples are maximization of reliability, efficiency, safety, and benefit; or minimization of the pollution, risk, consumed energy, or production time/cost. Now, it is clear why the fingerprint of the optimization is visible in all science and engineering fields, ranging from healthcare to astronomy. In this direction, nature-inspired problem solving methods play a crucial role to efficiently solve complex real-world problems. Evolutionary Algorithms (EAs) are well-known examples inspired from the genetic biology; they employ biological operations such as selection, crossover, and mutation. EAs are pioneers tackling problems which are hard or even impossible to be solved by the conventional methods. For majority of our practical problems, we are faced with two or more (multi) conflicting objectives to optimize simultaneously; such as minimizing cost and maximizing efficiency for a system. The current successful evolutionary multi-objective algorithms have focused on problems with two or three objectives. However, recently, we face with problems which consist of more than three objectives (called many-objective). EAs have demonstrated their niche in solving these problems due to the requirement of finding multiple trade-off solutions for these problems. However, having a number of algorithmic restrictions, these methods were shown to be non-scalable to many-objective problems. These kinds of problems present new challenges for algorithm design and visualization which have not been addressed properly. This research program expects training 3 PhD and 3 MSc students by involving them in the cutting-edge research topics. These topics address the existing restrictions by enhancing various correlated aspects, namely, a) designing computationally fast algorithms, b) utilizing decomposition methods for dividing an conquering the original problem, c) designing tailored processing type (i.e., sequential, distributed, and parallel), d) designing simple and intuitive large-scale data visualization techniques (for better understanding and supporting an interactive computation), and e) designing effective performance metrics. The outcomes of the current research will be beneficial for a wide range of research communities and industrial sectors in Canada which utilize optimization by any means in scheduling, control systems, robotics, data mining, circuits design, communications, bioinformatics, image processing, networking, traffic engineering, etc. The applicant's more than ten years' comprehensive experience in evolutionary computation will play a pivotal role in success of this research program.
Programme
Discovery Grants Program - Individual
Emplacement
Ontario, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data

Tel que publié

Application id
RGPIN-2015-03651
Name nom
Rahnamayan, Shahryar
Department département
ECSE
Organization id
19222
Institution établissement
University of Ontario Institute of Technology
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2020
Competition year année de concours
2015
Award amount
28000
Program id
RGPIN
Program name en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
Discovery grants programs
Group fr
Programmes de subventions à la découverte
Committee code
1509
Committee name en
Civil, Industrial and Systems Engineering
Committee name fr
Génie civil, industriel et des systèmes
Area of application code
801
Area of application group en
Information and communication services
Area of application group fr
Services d'information et de télécommunications
Area of application en
Computer software
Area of application fr
Logiciel
Research subject code
1601
Research subject group en
Industrial engineering
Research subject group fr
Génie industriel
Research subject en
Operations research and management science
Research subject fr
Recherche opérationnelle et science de la gestion
Installment
inst:6-7
Partie
2
Nb partie
7
Application title
Efficient Evolutionary Algorithms for Many-objective Optimization
Keyword
NSERC
Application summary
Most of the time, when we are talking about an improvement of something, in fact, we are interested to minimize or maximize (i.e. optimize) quality or quantity of an entity. Universal examples are maximization of reliability, efficiency, safety, and benefit; or minimization of the pollution, risk, consumed energy, or production time/cost. Now, it is clear why the fingerprint of the optimization is visible in all science and engineering fields, ranging from healthcare to astronomy. In this direction, nature-inspired problem solving methods play a crucial role to efficiently solve complex real-world problems. Evolutionary Algorithms (EAs) are well-known examples inspired from the genetic biology; they employ biological operations such as selection, crossover, and mutation. EAs are pioneers tackling problems which are hard or even impossible to be solved by the conventional methods. For majority of our practical problems, we are faced with two or more (multi) conflicting objectives to optimize simultaneously; such as minimizing cost and maximizing efficiency for a system. The current successful evolutionary multi-objective algorithms have focused on problems with two or three objectives. However, recently, we face with problems which consist of more than three objectives (called many-objective). EAs have demonstrated their niche in solving these problems due to the requirement of finding multiple trade-off solutions for these problems. However, having a number of algorithmic restrictions, these methods were shown to be non-scalable to many-objective problems. These kinds of problems present new challenges for algorithm design and visualization which have not been addressed properly. This research program expects training 3 PhD and 3 MSc students by involving them in the cutting-edge research topics. These topics address the existing restrictions by enhancing various correlated aspects, namely, a) designing computationally fast algorithms, b) utilizing decomposition methods for dividing an conquering the original problem, c) designing tailored processing type (i.e., sequential, distributed, and parallel), d) designing simple and intuitive large-scale data visualization techniques (for better understanding and supporting an interactive computation), and e) designing effective performance metrics. The outcomes of the current research will be beneficial for a wide range of research communities and industrial sectors in Canada which utilize optimization by any means in scheduling, control systems, robotics, data mining, circuits design, communications, bioinformatics, image processing, networking, traffic engineering, etc. The applicant's more than ten years' comprehensive experience in evolutionary computation will play a pivotal role in success of this research program.