Variable interaction network analysis to enhance boundary update method for constrained optimization

• BU method reduces infeasible search space and enhances optimization efficiency. • DG2 reveals fewer and simpler variable interactions using the BU method. • BU method improves variable independence, simplifying the optimization landscape. • TOPSIS confirms the superior performance of the BU method in optimization tasks. The boundary update approach was proposed by Gandomi and Deb [ Computer Methods in Applied Mechanics and Engineering , 363, 112,917, 2020] for constrained optimization problems. The boundary update (BU) method defines a dynamic formulation of an optimization problem in order to eliminate the infeasible search space. This study investigates the concept of variable interaction using a differential grouping algorithm, DG2, to evaluate and visualize variable interaction impacted by the boundary update method. Using multiple social network analysis (SNA) metrics, including Average Betweenness Centrality, Average Closeness Centrality, Network Density, and Clustering Coefficient, this research reveals significant structural simplifications in optimization problems under the BU method. Results show significant improvements in some aspects by applying the BU method. For example, it reduces network density by up to 34 %, closeness centrality by over 67 %, and enhances independence among variables by 45 %, simplifying the optimization landscape. Furthermore, a systematic evaluation using the TOPSIS multi-criteria decision-making (MCDM) approach confirms that BU improves convergence efficiency and solution quality by 20%–30 % compared to without BU methods across various benchmark problems. Network visualizations corroborate these findings, demonstrating reduced complexity and improved clarity in variable relationships. This comprehensive analysis establishes the BU method as a transformative framework, significantly advancing constrained optimization through its ability to streamline variable interactions and enhance algorithmic performance.

Authors

Institutions

Publication Details

Journal
Results in Engineering
Published
2024-12-19
DOI
https://doi.org/10.1016/j.rineng.2024.103727
Primary Topic
Metaheuristic Optimization Algorithms Research
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Variable interaction network analysis to enhance boundary update method for constrained optimization

Mohammad Reza Nikoo, Navid Yazdanjue, Amir H. Gandomi, Iman Rahimi et al.
Results in Engineering
Metaheuristic Optimization Algorithms Research
article

Variable interaction network analysis to enhance boundary update method for constrained optimization

Mohammad Reza Nikoo, Navid Yazdanjue, Amir H. Gandomi, Iman Rahimi, Fang Chen, Mohammad Sadegh Khorshidi
article en

Abstract

• BU method reduces infeasible search space and enhances optimization efficiency. • DG2 reveals fewer and simpler variable interactions using the BU method. • BU method improves variable independence, simplifying the optimization landscape. • TOPSIS confirms the superior performance of the BU method in optimization tasks. The boundary update approach was proposed by Gandomi and Deb [ Computer Methods in Applied Mechanics and Engineering , 363, 112,917, 2020] for constrained optimization problems. The boundary update (BU) method defines a dynamic formulation of an optimization problem in order to eliminate the infeasible search space. This study investigates the concept of variable interaction using a differential grouping algorithm, DG2, to evaluate and visualize variable interaction impacted by the boundary update method. Using multiple social network analysis (SNA) metrics, including Average Betweenness Centrality, Average Closeness Centrality, Network Density, and Clustering Coefficient, this research reveals significant structural simplifications in optimization problems under the BU method. Results show significant improvements in some aspects by applying the BU method. For example, it reduces network density by up to 34 %, closeness centrality by over 67 %, and enhances independence among variables by 45 %, simplifying the optimization landscape. Furthermore, a systematic evaluation using the TOPSIS multi-criteria decision-making (MCDM) approach confirms that BU improves convergence efficiency and solution quality by 20%–30 % compared to without BU methods across various benchmark problems. Network visualizations corroborate these findings, demonstrating reduced complexity and improved clarity in variable relationships. This comprehensive analysis establishes the BU method as a transformative framework, significantly advancing constrained optimization through its ability to streamline variable interactions and enhance algorithmic performance.

Results in EngineeringVol. 25
Obuda University (HU), University of Technology Sydney (AU), Sultan Qaboos University (OM)
Openalex Percentile: Top 79%
Metaheuristic Optimization Algorithms Research
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.