<p>Some meta-heuristic algorithms are unable to solve the multi-extremal function optimization problem, so this paper proposes a team innovation algorithm (TIA) based on the process of team innovation. The algorithm simulates the hierarchy of team structures consisting of team leaders, team members, and backup members, as well as the process of innovation through team structure division, team members research, and research direction correction. The algorithm is suitable for multi-extremal function optimization problems. by constructing different group leaders to simulate multiple unknown optimal solutions that may exist in the optimization process. An adaptive search range adjustment method is established by simulating the research direction correction process, and the search range is automatically adjusted in the optimization process. 12 CEC2022 benchmark functions and 3 multiple-solution functions are used to benchmark TIA and compare with different meta-heuristic algorithms. The experimental results show that TIA can provide very competitive results in both single objective and multi-objective optimization problems with good optimization accuracy.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

A socially inspired optimization algorithm for multi-extremal function optimization: team innovation algorithm

  • Xinjie Hu,
  • Wenxin Yu,
  • Qiumei Xiao

摘要

Some meta-heuristic algorithms are unable to solve the multi-extremal function optimization problem, so this paper proposes a team innovation algorithm (TIA) based on the process of team innovation. The algorithm simulates the hierarchy of team structures consisting of team leaders, team members, and backup members, as well as the process of innovation through team structure division, team members research, and research direction correction. The algorithm is suitable for multi-extremal function optimization problems. by constructing different group leaders to simulate multiple unknown optimal solutions that may exist in the optimization process. An adaptive search range adjustment method is established by simulating the research direction correction process, and the search range is automatically adjusted in the optimization process. 12 CEC2022 benchmark functions and 3 multiple-solution functions are used to benchmark TIA and compare with different meta-heuristic algorithms. The experimental results show that TIA can provide very competitive results in both single objective and multi-objective optimization problems with good optimization accuracy.