Robotics & Machine Learning Daily News2024,Issue(Jul.1) :88-89.

Reports from Jiangsu University Describe Recent Advances in Intelligent Systems (Improving Two-layer Encoding of Evolutionary Algorithms for Sparse Large-scale Multiobjective Optimization Problems)

江苏大学的报告描述了智能系统的最新进展(改进稀疏大规模多目标优化问题进化算法的两层编码)

Robotics & Machine Learning Daily News2024,Issue(Jul.1) :88-89.

Reports from Jiangsu University Describe Recent Advances in Intelligent Systems (Improving Two-layer Encoding of Evolutionary Algorithms for Sparse Large-scale Multiobjective Optimization Problems)

江苏大学的报告描述了智能系统的最新进展(改进稀疏大规模多目标优化问题进化算法的两层编码)

扫码查看

摘要

一位新闻记者-机器人与机器学习每日新闻的工作人员新闻编辑-机器学习-智能NT系统的研究结果在一份新的报告中讨论。根据NewsRx记者在中华人民共和国江苏的新闻报道,研究表明:“稀疏大规模多目标问题(LSMOPs)是一个NP硬问题,在Pareto最优解中存在大量零值变量。在求解稀疏大规模多目标问题时,最近的研究通常采用特殊的两层编码。”其中低层负责零变量的优化,高层负责非零变量。国家自然科学基金(NSFC),国家自然科学基金(NSFC),安徽省教委自然科学研究项目。

Abstract

By a News Reporter-Staff News Editor at Robotics & Machine Learning Daily News – Research findings on Machine Learning - Intellige nt Systems are discussed in a new report. According to news reporting from Jiang su, People’s Republic of China, by NewsRx journalists, research stated, “Sparse large-scale multiobjective problems (LSMOPs) are characterized as an NP-hard iss ue that undergoes a significant presence of zero-valued variables in Pareto opti mal solutions. In solving sparse LSMOPs, recent studies typically employ a speci alized two-layer encoding, where the low-level layer undertakes the optimization of zero variables and the high-level layer is in charge of non-zero variables.” Financial supporters for this research include National Natural Science Foundati on of China (NSFC), National Natural Science Foundation of China (NSFC), Natural Science Research Project of Anhui Educational Committee.

Key words

Jiangsu/People's Republic of China/Asi a/Intelligent Systems/Machine Learning/Algorithms/Evolutionary Algorithm/Ma thematics/Jiangsu University

引用本文复制引用

出版年

2024
Robotics & Machine Learning Daily News

Robotics & Machine Learning Daily News

ISSN:
段落导航相关论文