A Random Projection Based Evolutionary Strategy for Solving Large-Scale Optimization Problems

Limited Memory Matrix Adaptation Evolution Strategy (LM-MA-ES) is an important branch of evolutionary strategy that utilizes a limited set of direction vectors to generate candidate solutions. However, it still faces challenges when applied to large-scale optimization problems. To address this issue, we propose a framework named Random Projection-Based Evolution Strategy (RP-ES). The core idea is to map the original population from high-dimensional space to a low-dimensional space using a random projection matrix. The offspring solutions are then generated in this low-dimensional space and projected back into the high-dimensional space. Additionally, the high-dimensional offspring are evaluated and selected based on the objective function. Experimental results demonstrate that the proposed framework outperforms existing algorithms in both benchmark tests and complex problem scenarios.

Authors

Institutions

Publication Details

Published
2025-05-09
DOI
https://doi.org/10.1109/ddcls66240.2025.11066059
Primary Topic
Metaheuristic Optimization Algorithms Research
Type
article
Field-Weighted Citation Impact
0.00

Funders

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

A Random Projection Based Evolutionary Strategy for Solving Large-Scale Optimization Problems

Jianfei Hou, Fei Li
Metaheuristic Optimization Algorithms Research
article

A Random Projection Based Evolutionary Strategy for Solving Large-Scale Optimization Problems

Jianfei Hou, Fei Li
article en

Abstract

Limited Memory Matrix Adaptation Evolution Strategy (LM-MA-ES) is an important branch of evolutionary strategy that utilizes a limited set of direction vectors to generate candidate solutions. However, it still faces challenges when applied to large-scale optimization problems. To address this issue, we propose a framework named Random Projection-Based Evolution Strategy (RP-ES). The core idea is to map the original population from high-dimensional space to a low-dimensional space using a random projection matrix. The offspring solutions are then generated in this low-dimensional space and projected back into the high-dimensional space. Additionally, the high-dimensional offspring are evaluated and selected based on the objective function. Experimental results demonstrate that the proposed framework outperforms existing algorithms in both benchmark tests and complex problem scenarios.

Anhui University of Technology (CN)
National Natural Science Foundation of China, Engineering Laboratory
Openalex Percentile: Top 92%
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.

A Random Projection Based Evolutionary Strategy for Solving Large-Scale Optimization Problems — Jianfei Hou, Fei Li · (2025) | TGRS Research Map | TGRS