Novel Discrete Differential Evolution Algorithm for Solving D{0-1}KP Problem
The discounted {0-1} knapsack problem (D{0-1}KP) is a more complex variant of the classic 0-1 knap-sack problem (0-1KP). In order to efficiently solve the D{0-1}KP by using discrete differential evolution algorithm, firstly, a novel V-shape transfer function (NV) is proposed. The real vector of an i...
Main Author: | ZHANG Fazhan, HE Yichao, LIU Xuejing, WANG Zekun |
---|---|
Format: | Article |
Language: | zho |
Published: |
Journal of Computer Engineering and Applications Beijing Co., Ltd., Science Press
2022-02-01
|
Series: | Jisuanji kexue yu tansuo |
Subjects: | |
Online Access: | http://fcst.ceaj.org/fileup/1673-9418/PDF/2007047.pdf |
Similar Items
-
A Thermodynamical Selection-Based Discrete Differential Evolution for the 0-1 Knapsack Problem
by: Zhaolu Guo, et al.
Published: (2014-11-01) -
Efficient 0/1-Multiple-Knapsack Problem Solving by Hybrid DP Transformation and Robust Unbiased Filtering
by: Patcharin Buayen, et al.
Published: (2022-09-01) -
Quantum-Inspired Differential Evolution with Grey Wolf Optimizer for 0-1 Knapsack Problem
by: Yule Wang, et al.
Published: (2021-05-01) -
Binary Moth Search Algorithm for Discounted {0-1} Knapsack Problem
by: Yan-Hong Feng, et al.
Published: (2018-01-01) -
A Rough Sets based modified Scatter Search algorithm for solving 0-1 Knapsack problem
by: Hassan Rezazadeh
Published: (2015-07-01)