计算机应用 ›› 2021, Vol. 41 ›› Issue (6): 1748-1755.DOI: 10.11772/j.issn.1001-9081.2020091390

所属专题: 先进计算

• 先进计算 • 上一篇    下一篇

信息筛选多任务优化自组织迁移算法

程美英1,2, 钱乾2,3, 倪志伟4, 朱旭辉4   

  1. 1. 湖州师范学院 经济管理学院, 浙江 湖州 313000;
    2. 浙江省教育信息化评价与应用研究中心, 浙江 湖州 313000;
    3. 湖州师范学院 教师教育学院, 浙江 湖州 313000;
    4. 合肥工业大学 管理学院, 合肥 230009
  • 收稿日期:2020-09-08 修回日期:2020-11-10 出版日期:2021-06-10 发布日期:2020-11-26
  • 通讯作者: 程美英
  • 作者简介:程美英(1983-),女,安徽黄山人,讲师,博士,主要研究方向:群体智能优化;钱乾(1983-),男,安徽芜湖人,讲师,硕士,主要研究方向:进化计算;倪志伟(1965-),男,安徽桐城人,教授,博士,主要研究方向:人工智能;朱旭辉(1991-),男,安徽阜阳人,讲师,博士,主要研究方向:智能计算、数据挖掘。
  • 基金资助:
    浙江省教育科学规划课题(2019SCG036);湖州市科技计划课题(2018YZ11);浙江省人力资源和社会保障科研项目(2019088)。

Self-organized migrating algorithm for multi-task optimization with information filtering

CHENG Meiying1,2, QIAN Qian2,3, NI Zhiwei4, ZHU Xuhui4   

  1. 1. School of Economics&Management, Huzhou University, Huzhou Zhejiang 313000, China;
    2. Research Center of Education Information Evaluation and Application of Zhejiang Province, Huzhou Zhejiang 313000, China;
    3. School of Teacher Education, Huzhou University, Huzhou Zhejiang 313000, China;
    4. School of Management, Hefei University of Technology, Hefei Anhui 230009, China
  • Received:2020-09-08 Revised:2020-11-10 Online:2021-06-10 Published:2020-11-26
  • Supported by:
    This work is partially supported by the Educational Science Planning Project in Zhejiang Province (2019SCG036), the Huzhou Science and Technology Planning Project (2018YZ11), the Scientific Research Project of Human Resources and Social Security in Zhejiang Province (2019088).

摘要: 针对现有自组织迁移算法(SOMA)只能求解单个优化问题及其“隐并行性”未能被充分挖掘的缺陷,提出信息筛选多任务优化自组织迁移算法(SOMAMIF)实现同一时刻处理多个优化问题。首先,构造多任务统一搜索空间,并根据任务个数设置相应的子种群;然后,对各子种群当前最优适应值进行判断,当任务连续若干代停滞进化时则产生信息交互需求;接着,按概率从剩余子种群中筛选对自己有用的信息并过滤无用信息,从而在保证信息正向迁移同时实现种群结构的重新调整;最后对算法的时间复杂度和空间复杂度进行分析。实验结果表明,SOMAMIF在同时求解多个高维函数优化问题时均快速收敛至全局最优解0,而SOMAMIF与分形技术相结合同时提取不同户籍高校学生返乡关键制约因素时,其在两个数据集上得到的平均分类准确率与原始数据集的平均分类准确率相比分别提高了0.348 66个百分点和0.598 57个百分点。

关键词: 多任务优化, 自组织迁移算法, 信息筛选, 多任务高维函数优化, 多任务离散优化问题

Abstract: The Self-Organized Migrating Algorithm (SOMA) only can solve the single task, and the "implicit parallelism" of SOMA is not fully exploited. Aiming at the shortcomings, a new Self-Organized Migrating Algorithm for Multi-task optimization with Information Filtering (SOMAMIF) was proposed to solve multiple tasks concurrently. Firstly, the multi-task uniform search space was constructed, and the subpopulations were set according to the number of tasks. Secondly, the current optimal fitness of each subpopulation was judged, and the information transfer need was generated when the evolution of a task stagnated in a successive generations. Thirdly, the useful information was chosen from the remaining subpopulations and the useless information was filtered according to a probability, so as to ensure the positive transfer and readjust the population structure at the same time. Finally, the time complexity and space complexity of SOMAMIF were analyzed. Experimental results show that, SOMAMIF converges rapidly to the global optimal solution 0 when solving multiple high-dimensional function problems simultaneously; compared with those of the original datasets, the average classification accuracies obtained on two datasets by SOMAMIF combing with the fractal technology to extract the key home returning constraints from college students with different census register increase by 0.348 66 percentage points and 0.598 57 percentage points respectively.

Key words: multi-task optimization, Self-Organized Migrating Algorithm (SOMA), information filtering, multi-task high-dimensional function optimization, multi-task discrete optimization problem

中图分类号: