.png){kind=icon}
返回
Encoding transformation-based differential evolution algorithm for solving knapsack problem with single continuous variable
.png){kind=icon}
PRE
AI
DOI：10.1016/j.swevo.2019.03.002.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The knapsack problem with a single continuous variable (KPC) is an extension of the standard 0-1 knapsack problem. It is an especial combinatorial optimization problem with continuous variable S so that its solution is more difficult. In this paper, a novel differential evolution algorithm is proposed based on the encoding transformation technique, which is named Encoding Transformation-based Differential Evolution algorithm (ETDE). In ETDE, the individual is represented as an (n + 1)-dimensional vector in which the first n components are transformed into an n-dimensional 0-1 vector by using a special surjection, and the last component is as the value of continuous variable S. From this, a potential solution of KPC is obtained. Moreover, the Gauss-Seidel method is used to accelerate the convergence rate of ETDE, and an effective repair and optimization method is used to handle the infeasible solutions. In order to verify the performance of ETDE, we use it and the exact algorithm, approximation algorithm, particle swarm optimization, and artificial bee colony to solve four classes of large-scale KPC instances, respectively. The computational results show that ETDE not only has the fast speed, but also the calculation result is better than other algorithms. Consequently, ETDE is more suitable for quickly and efficiently solving the KPC problem than other algorithms in practical applications.
Keyword:
Differential evolution
Encoding transformation
Gauss-Seidel method
Infeasible solution
Repair and optimization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8.5
论文数:
2.2K
被引数:
1.0W
机构
引用论文
.png){kind=icon}
分享收藏A hybrid approach of differential evolution and artificial bee colony for feature selection一种差分进化与人工蜂群混合的特征选择方法
PREAI
分享收藏
分享收藏
查看更多内容