.png){kind=icon}
返回
Set Theory-Based Operator Design in Evolutionary Algorithms for Solving Knapsack Problems
.png){kind=icon}
PRE
AI
DOI：10.1109/TEVC.2021.3080683.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Knapsack problems (KPs) are famous combinatorial optimization problems that can be solved by evolutionary algorithms (EAs). In such methods, a key step is to produce new solutions for each generation. However, traditional EAs cannot guarantee the feasibility of the new solutions, causing ineffectiveness or inefficiency of the methods. Owing to the fact that directly generating a feasible solution is difficult, a practical way is to generate a potential solution and transform it to a feasible one if necessary; more ideally, transform it to the local-optimal solution. Essentially, this transforming process is to map an element of the solution set to an element of the feasible solution set, which can be analyzed and optimized from a new perspective, i.e., the set theory (ST). In this article, we provide new explanations for the transforming process of solutions based on ST and summarize the properties that the transforming process should satisfy. Furthermore, based on the proposed concepts and theories, we put forward the ideas for improving the transforming process. Consequently, some new operators for KPs are proposed. Experimental results demonstrate the superiority of the proposed operators.
Keyword:
Optimization
Set theory
Mathematical model
Maintenance engineering
Genetic algorithms
Transforms
Search problems
Combinatorial optimization
evolutionary algorithm (EA)
knapsack problem (KP)
set theory (ST)
transforming process
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
12
论文数:
1.9K
被引数:
2.4W
机构
引用论文
.png){kind=icon}
Moth-flame optimization algorithm: A novel nature-inspired heuristic paradigm蛾焰优化算法: 一种新的自然启发启发式范式
PREAI
分享收藏分享收藏
查看更多内容