An Evolutionary Framework for Large-Scale Constrained Optimization

In recent decades, large-scale optimization has received significant research attention; however, most of these studies have not considered problems with functional constraints. The introduction of constraints significantly amplifies the difficulty of solving optimization problems. Given the preva-lence of high-dimensional constrained optimization problems in real-world applications, a critical need has emerged for an in-depth exploration of this research domain. This paper presents a novel framework that can tackle complex, large-scale constrained optimisation problems. The framework incorpo-rates a decomposition method that leverages interactions among decision variables, employing a contribution-based strategy to prioritize subproblems that have more substantial influence on enhancing solution quality. Furthermore, the framework integrates constraint consensus to mitigate constraint violations throughout the search process. The proposed algorithm is evaluated on a test suite of constrained overlapping problems, revealing its superior performance when compared to other state-of-the-art algorithms.

Authors

Institutions

Publication Details

Published
2024-10-06
DOI
https://doi.org/10.1109/smc54092.2024.10831958
Primary Topic
Evolutionary Algorithms and Applications
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

An Evolutionary Framework for Large-Scale Constrained Optimization

Noha Hamza, Daryl Essam, Mohamed A. Meselhi, Ruhul Sarker et al.
Evolutionary Algorithms and Applications
article

An Evolutionary Framework for Large-Scale Constrained Optimization

Noha Hamza, Daryl Essam, Mohamed A. Meselhi, Ruhul Sarker, Saber Elsayed
article en

Abstract

In recent decades, large-scale optimization has received significant research attention; however, most of these studies have not considered problems with functional constraints. The introduction of constraints significantly amplifies the difficulty of solving optimization problems. Given the preva-lence of high-dimensional constrained optimization problems in real-world applications, a critical need has emerged for an in-depth exploration of this research domain. This paper presents a novel framework that can tackle complex, large-scale constrained optimisation problems. The framework incorpo-rates a decomposition method that leverages interactions among decision variables, employing a contribution-based strategy to prioritize subproblems that have more substantial influence on enhancing solution quality. Furthermore, the framework integrates constraint consensus to mitigate constraint violations throughout the search process. The proposed algorithm is evaluated on a test suite of constrained overlapping problems, revealing its superior performance when compared to other state-of-the-art algorithms.

University of Canberra (AU), UNSW Sydney (AU), UNSW Canberra
Openalex Percentile: Top 76%
Evolutionary Algorithms and Applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.