Canada Spends Logo

Explore our Budget 2026 analysis

Grant: Discovery Grants Program - Individual

Brock University

$24,000.00

Development and Analysis of Metaheuristics for Challenging Large-Scale Optimization Problems

FY 2024-25

Summary
The benefits of optimization can be observed in almost all aspects of life, from science, healthcare, economics, to engineering problems. Important problems in these areas are computationally intractable by exact methods. My research uses computational intelligence, a branch of artificial intelligence to solve problems that are either too challenging or impossible to solve using conventional optimization methods. Specifically, I use algorithms that simulate the emergent behaviour of flocking birds (particle swarm optimization, PSO) and evolutionary algorithms (EAs) inspired by Darwinian evolution and population genetics: I use biological processes such as selection, crossover, and mutation to quickly find solutions that are acceptable in practice, or "near perfect" where the optimal solution may require a lifetime to compute. The majority of real-world optimization problems involve simultaneous optimization of two or more, often conflicting objectives, e.g., minimizing transportation costs while maximizing safety and efficiency; this is called a multi-objective optimization problem (MOP). The successes in the role played by optimizing algorithms based on EAs and PSOs, among other metaheuristics in solving MOPs are well documented. Increasingly we are faced with problems that have more than three objectives, i.e., a special case of MOPs, termed many-objective optimization problems (MaOPs). However, the performance of the aforementioned algorithms deteriorates severely with increase in the number of objectives (beyond three) and the number of problem dimensions or decision variables, i.e., for large-scale many-objective optimization problems, which present new challenges for optimization techniques. The proposed research will tackle efficient algorithm design, solution evaluation, and data/algorithm activity visualizations that have not been adequately addressed for MaOPs. Both well-known benchmark functions for MaOPs and large-scale real-world optimization problems arising in network science, such as finding critical nodes in complex networks, will be investigated. The critical node detection problem has many practical applications: e.g., targeting specific proteins in protein interaction networks for use in drug design, in computer network security so as to protect or attack important areas, in determining smart grid vulnerability, and in identifying individuals for vaccination or quarantine when mitigating disease spread. Providing efficient algorithmic solutions for important problems, and by improving our understanding of appropriate algorithms and techniques for different classes of challenging optimization problems, this research will benefit many researchers and practitioners that utilize optimization across different domains. I will involve graduate and senior undergraduate students to find cutting-edge solutions to challenging optimization problems and to advance the theoretical aspects and development of EAs and PSOs.
Program
Discovery Grants Program - Individual
Location
Ontario, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data

As published

Application id
RGPIN-2022-05418
Name nom
Ombuki-Berman, Beatrice
Department département
Computer Science
Organization id
22
Institution établissement
Brock University
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2024
Competition year année de concours
2022
Award amount
24000
Program id
RGPIN
Program name en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
DISCOVERY RESEARCH
Group fr
RECHERCHE AXÉE SUR LA DÉCOUVERTE
Committee code
1507
Committee name en
Computer Science
Committee name fr
Sciences informatiques
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)
Field of research list names en
Not available
Field of research list names fr
Non disponible
Socioeconomic objective list names en
Not available
Socioeconomic objective list names fr
Non disponible
Application title
Development and Analysis of Metaheuristics for Challenging Large-Scale Optimization Problems
Keywords
particle swarm optimization; metaheuristics; fitness landscape analysis; algorithm behaviour analysis; fitness-aware algorithm selection; control parameter selection; large-scale optimization; multi/many-objective optimization; evolutionary algorithms; real-world combinatorial optimization problems
Application summary
The benefits of optimization can be observed in almost all aspects of life, from science, healthcare, economics, to engineering problems. Important problems in these areas are computationally intractable by exact methods. My research uses computational intelligence, a branch of artificial intelligence to solve problems that are either too challenging or impossible to solve using conventional optimization methods. Specifically, I use algorithms that simulate the emergent behaviour of flocking birds (particle swarm optimization, PSO) and evolutionary algorithms (EAs) inspired by Darwinian evolution and population genetics: I use biological processes such as selection, crossover, and mutation to quickly find solutions that are acceptable in practice, or "near perfect" where the optimal solution may require a lifetime to compute. The majority of real-world optimization problems involve simultaneous optimization of two or more, often conflicting objectives, e.g., minimizing transportation costs while maximizing safety and efficiency; this is called a multi-objective optimization problem (MOP). The successes in the role played by optimizing algorithms based on EAs and PSOs, among other metaheuristics in solving MOPs are well documented. Increasingly we are faced with problems that have more than three objectives, i.e., a special case of MOPs, termed many-objective optimization problems (MaOPs). However, the performance of the aforementioned algorithms deteriorates severely with increase in the number of objectives (beyond three) and the number of problem dimensions or decision variables, i.e., for large-scale many-objective optimization problems, which present new challenges for optimization techniques. The proposed research will tackle efficient algorithm design, solution evaluation, and data/algorithm activity visualizations that have not been adequately addressed for MaOPs. Both well-known benchmark functions for MaOPs and large-scale real-world optimization problems arising in network science, such as finding critical nodes in complex networks, will be investigated. The critical node detection problem has many practical applications: e.g., targeting specific proteins in protein interaction networks for use in drug design, in computer network security so as to protect or attack important areas, in determining smart grid vulnerability, and in identifying individuals for vaccination or quarantine when mitigating disease spread. Providing efficient algorithmic solutions for important problems, and by improving our understanding of appropriate algorithms and techniques for different classes of challenging optimization problems, this research will benefit many researchers and practitioners that utilize optimization across different domains. I will involve graduate and senior undergraduate students to find cutting-edge solutions to challenging optimization problems and to advance the theoretical aspects and development of EAs and PSOs.