TMHSCA: a novel hybrid two-stage mutation with a sine cosine algorithm for discounted {0-1} knapsack problems.
Yan KangHaining WangBin PuJiansong LiuShin-Jye LeeXuekun YangLiu TaoPublished in: Neural Comput. Appl. (2023)
Keyphrases
- knapsack problem
- dynamic programming
- learning algorithm
- np hard
- objective function
- test problems
- computational complexity
- k means
- optimal solution
- search space
- upper bound
- worst case
- optimization algorithm
- mathematical model
- machine learning
- piecewise linear
- solution quality
- bicriteria
- convergence rate
- detection algorithm
- particle swarm optimization
- optimization problems
- simulated annealing
- feature vectors