An Adaptive Memetic P System to Solve the 0/1 Knapsack Problem.
Jianping DongHaina RongFerrante NeriQiang YangMing ZhuGexiang ZhangPublished in: CEC (2020)
Keyphrases
- knapsack problem
- randomly generated test instances
- continuous relaxation
- combinatorial optimization problems
- optimal solution
- optimization problems
- np hard
- multidimensional knapsack problem
- dynamic programming
- greedy algorithm
- linear programming relaxation
- test problems
- bicriteria
- exact algorithms
- heuristic solution
- np hard problems
- neural network
- integer variables
- greedy heuristic
- maximum profit
- implicit enumeration
- cost function
- particle swarm optimizer
- cutting plane
- differential evolution
- metaheuristic