.png){kind=icon}
返回
A complex-valued encoding wind driven optimization for the 0-1 knapsack problem
.png){kind=icon}
PRE
AI
DOI：10.1007/s10489-016-0855-2.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper presents a complex-valued encoding wind driven optimization (CWDO) with a greedy strategy for the 0-1 knapsack problem. We introduce a complex-value encoding method, which can be viewed as an effective global optimization strategy, and a greedy strategy, which can be viewed as an enhanced local search strategy into wind driven optimization. These strategies increase the diversity of the population and avoid premature convergence. This paper presents three types of test cases for evaluation: standard, small-scale, and large-scale test cases. The experimental results show that the proposed algorithm is suitable for these three cases. Compared to the complex valued cuckoo search algorithm, greedy genetic algorithm, wind driven optimization, binary cuckoo search algorithm, bat algorithm and particle swarm optimization, the performance, stability, and robustness of the CWDO algorithm is better. The simulation results show that the CWDO algorithm is an effective and feasible method for solving the 0-1 knapsack problem.
Keyword:
Complex-valued encoding
Wind driven optimization (WDO)
Greedy strategy
Knapsack problem
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.5
论文数:
7.7K
被引数:
1.9W
机构
引用论文
Optical tracking of relaxation dynamics in semi-dilute hydroxypropylcellulose solutions as a precise phase transition probe.png)
Soft Matter
OAAI
Soft MatterIF0
OAAI分享收藏Gesturing through cursors: implementing multiple pointers in group support systems通过光标进行手势：在群体支持系统中实现多指针
PREAI
分享收藏分享收藏
查看更多内容