Your Location:
Home >
Browse articles >
Many-Objective Evolutionary Algorithm Based on Dynamic Decomposition and Angle Penalty Distance
Many-Objective Evolutionary Algorithm Based on Dynamic Decomposition and Angle Penalty Distance
- ACTA ELECTRONICA SINICA Vol. 52, Issue 8, Pages: 2773-2785(2024)
DOI: 10.12263/DZXB.20230541
Revised:2023-09-19
Scan QR Code
Full Text(HTML)
Figs( 36 ) Tabs( 9 )
References
Publication Info
Metrics
72
Views
128
Downloads
3
CSCD
Alert me when the article has been cited
Submit
Tools
- BibTeXDownload
- EndnoteDownload
- RefMan Download
- NoteExpressDownload
- NoteFirstDownload
Related Articles
Many-Objective Evolutionary Algorithm Based on SOM Clustering and Adaptive Operator Selection
Pareto Multiobjective Genetic Algorithm with Multiple-Chromosomes Crossover
Objective Reduction with Sparse Feature Selection for Many Objective Optimization Problem
Set-Based Evolutionary Optimization Algorithms Integrating Decision-Maker’s Preferences for Many-Objective Optimization Problems
Multi-Base-Station Cooperative Integrated Sensing and Communication Design for Nearshore Scenarios
Related Author
ZHONG Pei-long
LI Ming
HE Chao
CHEN Hao
ZHU Xue-jun
CHEN Tong
XUE Liang
LI Jun
Related Institution
School of Information Engineering, Nanchang Hangkong University
Key Laboratory of Nondestructive Testing, Ministry of Education, Nanchang Hangkong University
School of Automation, Nanjing University of Aeronautics and Astronautics
School of Mechanical Engineering,Shanghai Jiaotong University
Dept.of Electronic Engineering,Shanghai Jiao Tong University

