Grant: Discovery Grants Program - Individual
University of Ontario Institute of Technology
$25,000.00
Oppostition-based evolutionary algorithms: toward solving high-dimensional optimization problems efficiently
FY 2013-14
Summary
Modeling of a scientific or engineering problem often leads to an optimization problem. Optimization provides a formal basis for decision making in a wide variety of applications, ranging from engineering design to service oriented applications such as healthcare, finance, and transportation. In this proposal, Evolutionary Algorithms (EAs) will be investigated to solve those optimization problems, which are otherwise difficult or impossible to solve by classical methods. Solving problems with mixed-type variables, dynamic environments, multi-objective constrained functions, and non-analytical functions are examples that highlight the outstanding capabilities of EAs. But currently, EAs are computationally expensive because of their evolutionary nature. Furthermore, EAs suffer from the problem of dimensionality. This means that their performance deteriorates quickly as the dimensionality of the search space increases. Rapid solutions of the problems are highly desirable during research and design processes. As a consequence, acceleration of EAs is a significant issue of importance for the scientific community to solve large-scale problems in a smaller time interval. This research develops new acceleration schemes for EAs, and also smart sampling methods, which are needed particularly for high-dimensional problems. Combining these proposed schemes and sampling methods would result in more efficient and robust approaches to accelerate well-known evolutionary algorithms and effectively solve high-dimensional problems. Reduction of function evaluations for time-consuming optimization problems is highly demanding. Solving high-dimensional expensive optimization problems is a challenging research area. This proposal aims to make significant contributions to this field. It would provide a very good training environment for highly qualified personnel, who can become Canada's future leaders and pioneering researchers in optimization techniques for applications in science and engineering. These applications depend on successfully finding optimum values for a hundred parameters during design of a product or solving a scientific problem.
Program
Discovery Grants Program - Individual
Location
Ontario, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data
As published
Application id
371992-2010
Name nom
Rahnamayan, Shahryar
Department département
Engineering and Applied Science, Faculty of
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
2013
Competition year année de concours
2010
Award amount
25000
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
1510
Committee name en
Electrical and Computer Engineering
Committee name fr
Génie électrique et informatique
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
2800
Research subject group en
Artificial intelligence
Research subject group fr
Intelligence artificielle
Research subject en
Artificial intelligence (computer vision, use2603)
Research subject fr
Intelligence artificielle (vision artificielle, utiliser 2603)
Partie
4
Nb partie
5
Application title
Oppostition-based evolutionary algorithms: toward solving high-dimensional optimization problems efficiently
Keyword
NSERC
Application summary
Modeling of a scientific or engineering problem often leads to an optimization problem. Optimization provides a formal basis for decision making in a wide variety of applications, ranging from engineering design to service oriented applications such as healthcare, finance, and transportation. In this proposal, Evolutionary Algorithms (EAs) will be investigated to solve those optimization problems, which are otherwise difficult or impossible to solve by classical methods. Solving problems with mixed-type variables, dynamic environments, multi-objective constrained functions, and non-analytical functions are examples that highlight the outstanding capabilities of EAs. But currently, EAs are computationally expensive because of their evolutionary nature. Furthermore, EAs suffer from the problem of dimensionality. This means that their performance deteriorates quickly as the dimensionality of the search space increases. Rapid solutions of the problems are highly desirable during research and design processes. As a consequence, acceleration of EAs is a significant issue of importance for the scientific community to solve large-scale problems in a smaller time interval. This research develops new acceleration schemes for EAs, and also smart sampling methods, which are needed particularly for high-dimensional problems. Combining these proposed schemes and sampling methods would result in more efficient and robust approaches to accelerate well-known evolutionary algorithms and effectively solve high-dimensional problems. Reduction of function evaluations for time-consuming optimization problems is highly demanding. Solving high-dimensional expensive optimization problems is a challenging research area. This proposal aims to make significant contributions to this field. It would provide a very good training environment for highly qualified personnel, who can become Canada's future leaders and pioneering researchers in optimization techniques for applications in science and engineering. These applications depend on successfully finding optimum values for a hundred parameters during design of a product or solving a scientific problem.