CORTEXA
← Browse
arxivcs.NE2026-07-18

Decision Variable Analysis-Guided Differentiated Fuzzy Search for Large-Scale Multi-Objective Optimization

Boxi Xiao, Hui Bai, Jinhua Zheng, Yu Li, Juan Zou

Large-scale multi-objective optimization problems (LSMOPs) are challenging due to their high-dimensional decision spaces. Fuzzy search is an effective technique for improving search efficiency, while decision variable analysis can reveal the distinct roles of variables in promoting convergence and maintaining diversity. However, existing fuzzy search methods generally employ a uniform search granularity for all variables, overlooking the heterogeneous search requirements implied by variable roles. To address this limitation, this paper proposes a Decision variable analysis-guided Differentiated Fuzzy Search method, termed DDFS. The proposed method establishes an explicit mapping between decision-variable roles and fuzzy search granularities. Decision variable analysis is employed to identify variable roles and search sensitivities, enabling different variable groups to adopt differentiated fuzzy search behaviors during offspring generation. Furthermore, a Dual-Indicator Stage Transition Mechanism is developed to dynamically adjust fuzzy-updating intensity throughout the evolutionary process, balancing early-stage search-space compression and late-stage convergence refinement. Extensive experiments on the LSMOP and UF benchmark suites with up to 1000 decision variables show that DDFS generally achieves competitive performance against several representative large-scale multi-objective evolutionary algorithms. The results suggest that explicitly incorporating decision-variable roles into fuzzy search can help improve optimization performance in high-dimensional decision spaces.

View free PDFSource page

Related papers

arxivcs.NE2026-07-22

SpikingMOT: A Spike-Driven Multi-Object Tracker

Yiding Sun, Xiangyang Yang, Dongxu Zhang, Qirui Wang, Zijie Xu, Wenxuan Liu, et al.

Multi-object tracking (MOT) plays a fundamental role in visual perception, where accurate trajectory prediction is essential for reliable target association under complex motion patterns. Recent trackers have improved motion modeling with densely activated artificial neural netwo…

View free PDFSource page
arxivcs.NE2026-07-06

A Large-Scale Sparse Multiobjective Optimization Algorithm Based on Optimal Performance Scores

Jia-Lin Mai, Min-Rong Chen, Guo-Qiang Zeng, Xiang Liu, Jian Weng

Large-scale sparse multiobjective optimization problems (LSSMOPs) involve a large number of decision variables and Pareto optimal solutions with only a few nonzero variables. However, as the number of decision variables grows, it becomes increasingly challenging to accurately ide…

View free PDFSource page
arxivcs.NEcs.AI2026-07-06

LLM-Driven Evolutionary Generation of Multi-Objective Bayesian Optimization Algorithms

Georgios Laskaris, Reuben Brasher, Niki van Stein, Elena Raponi, Thomas Bäck, Florian Neukart

Designing effective multi-objective Bayesian optimization (MOBO) algorithms requires balancing many interdependent design choices whose optimal configuration is problem-dependent and typically demands deep expertise. We extend the LLaMEA framework to MOBO, using large language mo…

View free PDFSource page
arxivcs.LGcs.NE2026-06-29

Partition-Guided Distance Saliency: Bridging Decision and Objective Spaces in Many-Objective Optimization

Cláudio Lúcio do Val Lopes, Flávio Vinícius Cruzeiro Martins, Elizabeth Fialho Wanner

Explainability in Many-Objective Optimization (MaO) is currently hindered by the escalating complexity of the Pareto front, which renders the relationship between high-dimensional decision variables and objective outcomes increasingly opaque. As the number of objectives exceeds t…

View free PDFSource page
arxivcs.NE2026-07-14

A new dual-population constrained multi-objective evolutionary optimization algorithm with repair constraint handling for structural optimization

Fardad Homafar, Jasmin Jelovica

Structural optimization problems often involve a large number of decision variables and highly non-convex feasible regions, making convergence to the true Pareto front extremely challenging. Even when convergence is achievable, it typically requires thousands of function evaluati…

View free PDFSource page
arxivcs.DMcs.NEmath.OC2026-07-13

Representing the Non-dominated Set of Multi-objective Network Problems by Supported Non-dominated Points

David Könen, Lara Löhken, Michael Stiglmayr

In multi-objective combinatorial optimization, unsupported non-dominated points typically outnumber supported points and are often significantly more challenging to compute. Recent studies show that extreme supported non-dominated points provide high-quality representations of th…

View free PDFSource page