AscendMOEA: An Ascend NPU-Accelerated Platform for Tensorized Multi-Objective Evolutionary Algorithms
Organizations: College of Science, Northwest A&F University, Yangling 712100, China · Faculty of Data Science, City University of Macau, Macau, China · College of Economics and Management, Northwest A&F University, Yangling 712100, China
Abstract
Multi-objective evolutionary optimization increasingly involves large populations, expensive problem evaluations, and diverse algorithmic structures. These workloads expose the limited parallelism of loop-based implementations, while rewrites for accelerator execution can alter selection order, tie handling, and population updates. AscendMOEA is presented as a scalable platform that executes multi-objective evolutionary algorithms (MOEAs) on Huawei Ascend neural processing units (NPUs) and conventional central processing units (CPUs). The platform represents the decision vectors, objectives, constraints, and auxiliary states as tensors and provides reusable interfaces for algorithms, problems, population operators, quality indicators, monitoring, and repeated experiments. Dense computations are executed in batches, such as dominance, distance, variation, and problem-evaluation calculations. Short recurrences with causal dependencies retain their prescribed order and consume precomputed tensor results, which preserves the behavior of the original algorithms. AscendMOEA contains 18 algorithms, 155 benchmark and application problems, 19 public operator interfaces, and 11 quality indicators. Experiments on eight Ascend NPUs and 192 physical CPU cores evaluate operator throughput, end-to-end runtime, memory consumption, numerical agreement, and implementation ablation. Tensorized operators obtain a median acceleration of 1.58 times on the NPU. At large population scales, complete algorithms achieve a median acceleration of 5.76 times while retaining the recorded quality indicators. Moreover, the results identify the workload scale and ordered computation that determine whether accelerator execution is beneficial. AscendMOEA is open-sourced at https://github.com/dqlme/AscendMOEA.
Figures & tables
| System | Primary scope | Software organization | Parallel or accelerator support | Reported validation |
|---|---|---|---|---|
| PlatEMO [ 4 ] | Evolutionary multi-objective optimization | Algorithms, problems, indicators, experiments, and visualization in MATLAB | Parallel evaluation through the MATLAB ecosystem | Algorithm behavior and benchmark experiments |
| pymoo [ 5 ] | Multi-objective optimization in Python | Modular sampling, selection, variation, termination, and decision support | Parallel problem evaluation and vectorized numerical components | Optimization quality and software examples |
| EvoX [ 11 ] | General scalable evolutionary computation | Functional states, workflows, analyzers, and execution engines | Distributed GPU execution through JAX and Ray | System scalability and model performance |
| EvoMO [ 12 ] | Tensorized evolutionary multi-objective optimization | Tensor formulations of representative algorithms | Large-population GPU execution | Runtime and indicator-level comparison |
| AscendMOEA | Broad multi-objective evolutionary optimization | Algorithms, problems, operators, indicators, monitors, and typed registries | Ascend NPU and CPU execution with ordered host control | Operator equivalence, generation state, terminal indicators, runtime, and memory |
| Category | Count | MOEAs or MOP suites | Principal tensorized calculations |
|---|---|---|---|
| General MOEAs | 3 | NSGA-II [ 21 ] , MOEA/D [ 8 ] , and SPEA2 [ 9 ] | Dominance, fronts, crowding, scalarization, neighborhoods, strength fitness, and exact truncation |
| CMOEAs | 7 | BiCo [ 32 ] , C-MOEA/D [ 31 ] , CCMO [ 33 ] , CMEGL [ 34 ] , CMOEA-CD [ 35 ] , CMOEA-MS [ 36 ] , and EMCMO [ 37 ] | Constraint violation, feasibility masks, auxiliary populations, adaptive stages, and population exchange |
| MMOEAs | 3 | HREA [ 38 ] , CMMO [ 39 ] , and CoMMEA [ 40 ] | Local convergence, neighborhoods in the decision space, hierarchical ranking, epsilon relations, and archive cooperation |
| Sparse and large-scale MOEAs | 5 | SparseEA [ 41 ] , SparseEA2 [ 42 ] , TS-SparseEA [ 43 ] , LMEA [ 44 ] , and MOEA/PSL [ 45 ] | Variable scoring, sparse masks, grouped variation, correlation, and model training |
| Unconstrained MOPs | 13 | ZDT1–6 [ 46 ] and DTLZ1–7 [ 47 ] | Separable, disconnected, biased, degenerate, and many-objective PFs |
| CMOPs | 33 | CF1–10 [ 48 ] , DASCMOP1–9 [ 49 ] , and LIRCMOP1–14 [ 50 ] | Adjustable feasibility, disconnected regions, and large infeasible barriers |
| Experiment | Configurations | Repetitions | Recorded outputs |
|---|---|---|---|
| Operator stress | with varied , , ties, encodings, and operator parameters | 5 after warmup | Runtime, throughput, host memory, NPU memory, output agreement, OOM, and timeout |
| Standard algorithms | and for every compatible algorithm–problem pair | 20 paired seeds | Runtime, complete population histories, indicators, FE, terminal state, and memory |
| Scale algorithms | from to | 5 paired seeds | CPU-to-NPU speedup, convergence, memory growth, OOM, and timeout |
| Implementation ablation | Reference, common-operator, and full tensorized implementations under matched settings | 5 paired seeds | Reference/operator, operator/full, and reference/full timing gains |
| Experiment | Pairs | Clusters | Median | 95% CI |
|---|---|---|---|---|
| Standard workload | 20,100 | 1,005 | – | |
| Scale workload | 373 | 77 | – | |
| Real-world subset | 2,920 | 146 | – |
Evolutionary Optimization
Evolutionary optimization searches for strong solutions through population-based variation, selection, and adaptation.
See all 308 papers