Formal concept analysis assisted large-scale global optimization and its application to cloud task scheduling

Effective identification of interdependence information between decision variables is crucial for variable grouping in large-scale global optimization (LSGO). This paper introduces a novel approach called FCA-G (Formal Concept Analysis-Driven Grouping) to solve LSGO problems. FCA, an effective tool for data analysis, is employed in this approach. The primary contribution involves transforming decision variables into the formal context within FCA and utilizing the FCA methodology to solve LSGO problems based on a cooperative coevolution framework. Based on the formal context, a formal concept lattice is constructed, from which equivalent concepts are extracted. All variables within these concepts exhibit explicit interactions. This approach ensures a high degree of correlation among variables within subgroups and a low degree of correlation between subgroups, thereby enhancing cooperative coevolution. Experimental results indicate the significant potential of FCA-G in LSGO, as it outperforms state-of-the-art LSGO algorithms across the majority of LSGO test problems, including those with up to 1000 decision variables and a large-scale cloud task scheduling problem.

Authors

Institutions

Publication Details

Journal
Complex & Intelligent Systems
Published
2025-04-16
DOI
https://doi.org/10.1007/s40747-025-01878-w
Citations
2
Primary Topic
Multi-Criteria Decision Making
Type
article
Field-Weighted Citation Impact
4.21

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Formal concept analysis assisted large-scale global optimization and its application to cloud task scheduling

Fei Hao, Chao Jiang, Yibo Yong, Guo Yu et al.
2 citations
Complex & Intelligent Systems
Multi-Criteria Decision Making
4.21
article

Formal concept analysis assisted large-scale global optimization and its application to cloud task scheduling

Fei Hao, Chao Jiang, Yibo Yong, Guo Yu, Lianbo Ma
article en
2 citations

Abstract

Effective identification of interdependence information between decision variables is crucial for variable grouping in large-scale global optimization (LSGO). This paper introduces a novel approach called FCA-G (Formal Concept Analysis-Driven Grouping) to solve LSGO problems. FCA, an effective tool for data analysis, is employed in this approach. The primary contribution involves transforming decision variables into the formal context within FCA and utilizing the FCA methodology to solve LSGO problems based on a cooperative coevolution framework. Based on the formal context, a formal concept lattice is constructed, from which equivalent concepts are extracted. All variables within these concepts exhibit explicit interactions. This approach ensures a high degree of correlation among variables within subgroups and a low degree of correlation between subgroups, thereby enhancing cooperative coevolution. Experimental results indicate the significant potential of FCA-G in LSGO, as it outperforms state-of-the-art LSGO algorithms across the majority of LSGO test problems, including those with up to 1000 decision variables and a large-scale cloud task scheduling problem.

Complex & Intelligent SystemsVol. 11(6)
Nanjing Tech University (CN), Shaanxi Normal University (CN), Northeastern University (CN)
National Natural Science Foundation of China, Fundamental Research Funds for the Central Universities, Key Research and Development Program of Liaoning Province, Basic and Applied Basic Research Foundation of Guangdong Province
Openalex Percentile: Top 7%
Multi-Criteria Decision Making
4.21
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.